/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix025_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:01:06,594 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:01:06,597 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:01:06,615 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:01:06,615 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:01:06,617 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:01:06,619 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:01:06,621 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:01:06,623 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:01:06,623 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:01:06,624 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:01:06,625 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:01:06,626 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:01:06,626 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:01:06,627 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:01:06,628 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:01:06,629 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:01:06,630 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:01:06,632 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:01:06,634 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:01:06,636 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:01:06,637 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:01:06,641 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:01:06,641 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:01:06,645 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:01:06,645 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:01:06,646 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:01:06,647 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:01:06,648 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:01:06,649 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:01:06,651 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:01:06,652 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:01:06,653 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:01:06,653 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:01:06,654 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:01:06,655 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:01:06,658 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:01:06,658 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:01:06,658 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:01:06,661 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:01:06,661 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:01:06,662 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 22:01:06,675 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:01:06,675 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:01:06,676 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:01:06,676 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:01:06,676 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:01:06,677 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:01:06,677 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:01:06,677 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:01:06,677 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:01:06,677 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:01:06,678 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:01:06,678 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:01:06,678 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:01:06,678 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:01:06,678 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:01:06,679 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:01:06,679 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:01:06,679 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:01:06,679 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:01:06,679 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:01:06,680 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:01:06,680 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:01:06,680 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:01:06,680 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:01:06,680 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:01:06,681 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:01:06,681 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:01:06,681 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:01:06,681 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:01:06,681 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:01:06,947 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:01:06,962 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:01:06,965 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:01:06,967 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:01:06,967 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:01:06,968 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_rmo.opt.i [2019-12-26 22:01:07,034 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1473720f7/ad6a291518044e8f83ad23e7454b2a80/FLAG833cb1248 [2019-12-26 22:01:07,556 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:01:07,557 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_rmo.opt.i [2019-12-26 22:01:07,584 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1473720f7/ad6a291518044e8f83ad23e7454b2a80/FLAG833cb1248 [2019-12-26 22:01:07,829 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1473720f7/ad6a291518044e8f83ad23e7454b2a80 [2019-12-26 22:01:07,838 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:01:07,840 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:01:07,842 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:01:07,843 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:01:07,847 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:01:07,848 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:01:07" (1/1) ... [2019-12-26 22:01:07,851 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c54fe63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:01:07, skipping insertion in model container [2019-12-26 22:01:07,851 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:01:07" (1/1) ... [2019-12-26 22:01:07,859 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:01:07,903 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:01:08,357 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:01:08,369 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:01:08,466 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:01:08,544 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:01:08,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:01:08 WrapperNode [2019-12-26 22:01:08,545 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:01:08,546 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:01:08,546 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:01:08,546 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:01:08,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:01:08" (1/1) ... [2019-12-26 22:01:08,577 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:01:08" (1/1) ... [2019-12-26 22:01:08,608 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:01:08,609 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:01:08,609 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:01:08,609 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:01:08,618 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:01:08" (1/1) ... [2019-12-26 22:01:08,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:01:08" (1/1) ... [2019-12-26 22:01:08,623 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:01:08" (1/1) ... [2019-12-26 22:01:08,624 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:01:08" (1/1) ... [2019-12-26 22:01:08,642 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:01:08" (1/1) ... [2019-12-26 22:01:08,646 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:01:08" (1/1) ... [2019-12-26 22:01:08,649 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:01:08" (1/1) ... [2019-12-26 22:01:08,655 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:01:08,667 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:01:08,667 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:01:08,667 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:01:08,668 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:01:08" (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-26 22:01:08,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:01:08,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:01:08,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:01:08,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:01:08,729 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:01:08,729 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:01:08,729 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:01:08,729 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:01:08,729 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 22:01:08,730 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 22:01:08,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:01:08,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:01:08,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:01:08,732 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 22:01:09,487 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:01:09,488 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:01:09,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:01:09 BoogieIcfgContainer [2019-12-26 22:01:09,489 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:01:09,491 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:01:09,491 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:01:09,494 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:01:09,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:01:07" (1/3) ... [2019-12-26 22:01:09,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3979c3fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:01:09, skipping insertion in model container [2019-12-26 22:01:09,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:01:08" (2/3) ... [2019-12-26 22:01:09,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3979c3fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:01:09, skipping insertion in model container [2019-12-26 22:01:09,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:01:09" (3/3) ... [2019-12-26 22:01:09,498 INFO L109 eAbstractionObserver]: Analyzing ICFG mix025_rmo.opt.i [2019-12-26 22:01:09,508 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:01:09,508 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:01:09,516 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:01:09,517 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:01:09,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,559 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,559 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,583 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,583 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,584 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,584 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,584 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,592 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,592 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,618 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,619 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,619 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,635 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,635 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,639 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,640 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:01:09,660 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 22:01:09,684 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:01:09,685 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:01:09,685 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:01:09,685 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:01:09,685 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:01:09,685 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:01:09,686 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:01:09,686 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:01:09,713 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-26 22:01:09,715 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-26 22:01:09,818 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-26 22:01:09,819 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:01:09,839 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-26 22:01:09,861 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-26 22:01:09,951 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-26 22:01:09,951 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:01:09,959 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-26 22:01:09,978 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-26 22:01:09,980 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:01:15,130 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-12-26 22:01:15,781 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-26 22:01:15,937 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-26 22:01:15,977 INFO L206 etLargeBlockEncoding]: Checked pairs total: 73051 [2019-12-26 22:01:15,978 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-26 22:01:15,983 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 91 transitions [2019-12-26 22:01:26,898 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 83162 states. [2019-12-26 22:01:26,900 INFO L276 IsEmpty]: Start isEmpty. Operand 83162 states. [2019-12-26 22:01:26,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-26 22:01:26,907 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:01:26,908 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-26 22:01:26,908 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:01:26,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:01:26,914 INFO L82 PathProgramCache]: Analyzing trace with hash 800250999, now seen corresponding path program 1 times [2019-12-26 22:01:26,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:01:26,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317072719] [2019-12-26 22:01:26,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:01:27,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:01:27,127 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-26 22:01:27,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317072719] [2019-12-26 22:01:27,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:01:27,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:01:27,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790729342] [2019-12-26 22:01:27,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:01:27,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:01:27,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:01:27,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:01:27,148 INFO L87 Difference]: Start difference. First operand 83162 states. Second operand 3 states. [2019-12-26 22:01:29,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:01:29,378 INFO L93 Difference]: Finished difference Result 82042 states and 356056 transitions. [2019-12-26 22:01:29,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:01:29,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-26 22:01:29,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:01:29,865 INFO L225 Difference]: With dead ends: 82042 [2019-12-26 22:01:29,866 INFO L226 Difference]: Without dead ends: 77338 [2019-12-26 22:01:29,867 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-26 22:01:34,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77338 states. [2019-12-26 22:01:36,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77338 to 77338. [2019-12-26 22:01:36,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77338 states. [2019-12-26 22:01:39,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77338 states to 77338 states and 335168 transitions. [2019-12-26 22:01:39,564 INFO L78 Accepts]: Start accepts. Automaton has 77338 states and 335168 transitions. Word has length 5 [2019-12-26 22:01:39,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:01:39,565 INFO L462 AbstractCegarLoop]: Abstraction has 77338 states and 335168 transitions. [2019-12-26 22:01:39,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:01:39,565 INFO L276 IsEmpty]: Start isEmpty. Operand 77338 states and 335168 transitions. [2019-12-26 22:01:39,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 22:01:39,581 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:01:39,581 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:01:39,581 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:01:39,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:01:39,582 INFO L82 PathProgramCache]: Analyzing trace with hash -463413440, now seen corresponding path program 1 times [2019-12-26 22:01:39,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:01:39,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530905078] [2019-12-26 22:01:39,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:01:39,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:01:39,743 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-26 22:01:39,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530905078] [2019-12-26 22:01:39,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:01:39,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:01:39,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858067040] [2019-12-26 22:01:39,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:01:39,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:01:39,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:01:39,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:01:39,749 INFO L87 Difference]: Start difference. First operand 77338 states and 335168 transitions. Second operand 4 states. [2019-12-26 22:01:44,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:01:44,253 INFO L93 Difference]: Finished difference Result 119002 states and 493831 transitions. [2019-12-26 22:01:44,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:01:44,253 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 22:01:44,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:01:44,883 INFO L225 Difference]: With dead ends: 119002 [2019-12-26 22:01:44,884 INFO L226 Difference]: Without dead ends: 118911 [2019-12-26 22:01:44,885 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-26 22:01:47,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118911 states. [2019-12-26 22:01:50,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118911 to 109839. [2019-12-26 22:01:50,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109839 states. [2019-12-26 22:01:51,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109839 states to 109839 states and 460824 transitions. [2019-12-26 22:01:51,387 INFO L78 Accepts]: Start accepts. Automaton has 109839 states and 460824 transitions. Word has length 13 [2019-12-26 22:01:51,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:01:51,388 INFO L462 AbstractCegarLoop]: Abstraction has 109839 states and 460824 transitions. [2019-12-26 22:01:51,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:01:51,388 INFO L276 IsEmpty]: Start isEmpty. Operand 109839 states and 460824 transitions. [2019-12-26 22:01:51,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 22:01:51,395 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:01:51,396 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:01:51,396 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:01:51,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:01:51,396 INFO L82 PathProgramCache]: Analyzing trace with hash 2092378622, now seen corresponding path program 1 times [2019-12-26 22:01:51,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:01:51,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548282482] [2019-12-26 22:01:51,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:01:51,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:01:51,512 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-26 22:01:51,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548282482] [2019-12-26 22:01:51,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:01:51,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:01:51,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071987395] [2019-12-26 22:01:51,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:01:51,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:01:51,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:01:51,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:01:51,516 INFO L87 Difference]: Start difference. First operand 109839 states and 460824 transitions. Second operand 4 states. [2019-12-26 22:01:52,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:01:52,491 INFO L93 Difference]: Finished difference Result 153490 states and 628667 transitions. [2019-12-26 22:01:52,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:01:52,491 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 22:01:52,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:01:58,247 INFO L225 Difference]: With dead ends: 153490 [2019-12-26 22:01:58,247 INFO L226 Difference]: Without dead ends: 153386 [2019-12-26 22:01:58,247 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-26 22:02:01,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153386 states. [2019-12-26 22:02:04,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153386 to 130549. [2019-12-26 22:02:04,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130549 states. [2019-12-26 22:02:05,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130549 states to 130549 states and 543763 transitions. [2019-12-26 22:02:05,152 INFO L78 Accepts]: Start accepts. Automaton has 130549 states and 543763 transitions. Word has length 13 [2019-12-26 22:02:05,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:02:05,152 INFO L462 AbstractCegarLoop]: Abstraction has 130549 states and 543763 transitions. [2019-12-26 22:02:05,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:02:05,153 INFO L276 IsEmpty]: Start isEmpty. Operand 130549 states and 543763 transitions. [2019-12-26 22:02:05,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 22:02:05,157 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:02:05,157 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:02:05,157 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:02:05,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:02:05,158 INFO L82 PathProgramCache]: Analyzing trace with hash 740124844, now seen corresponding path program 1 times [2019-12-26 22:02:05,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:02:05,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424257505] [2019-12-26 22:02:05,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:02:05,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:02:05,265 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-26 22:02:05,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424257505] [2019-12-26 22:02:05,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:02:05,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:02:05,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594818019] [2019-12-26 22:02:05,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:02:05,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:02:05,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:02:05,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:02:05,269 INFO L87 Difference]: Start difference. First operand 130549 states and 543763 transitions. Second operand 4 states. [2019-12-26 22:02:07,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:02:07,397 INFO L93 Difference]: Finished difference Result 162838 states and 668586 transitions. [2019-12-26 22:02:07,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:02:07,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-26 22:02:07,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:02:07,886 INFO L225 Difference]: With dead ends: 162838 [2019-12-26 22:02:07,886 INFO L226 Difference]: Without dead ends: 162750 [2019-12-26 22:02:07,887 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-26 22:02:12,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162750 states. [2019-12-26 22:02:21,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162750 to 140790. [2019-12-26 22:02:21,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140790 states. [2019-12-26 22:02:23,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140790 states to 140790 states and 584562 transitions. [2019-12-26 22:02:23,141 INFO L78 Accepts]: Start accepts. Automaton has 140790 states and 584562 transitions. Word has length 14 [2019-12-26 22:02:23,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:02:23,141 INFO L462 AbstractCegarLoop]: Abstraction has 140790 states and 584562 transitions. [2019-12-26 22:02:23,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:02:23,142 INFO L276 IsEmpty]: Start isEmpty. Operand 140790 states and 584562 transitions. [2019-12-26 22:02:23,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 22:02:23,145 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:02:23,145 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:02:23,145 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:02:23,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:02:23,145 INFO L82 PathProgramCache]: Analyzing trace with hash 739988072, now seen corresponding path program 1 times [2019-12-26 22:02:23,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:02:23,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741576401] [2019-12-26 22:02:23,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:02:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:02:23,177 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-26 22:02:23,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741576401] [2019-12-26 22:02:23,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:02:23,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:02:23,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470626023] [2019-12-26 22:02:23,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:02:23,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:02:23,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:02:23,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:02:23,179 INFO L87 Difference]: Start difference. First operand 140790 states and 584562 transitions. Second operand 3 states. [2019-12-26 22:02:24,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:02:24,119 INFO L93 Difference]: Finished difference Result 195371 states and 811522 transitions. [2019-12-26 22:02:24,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:02:24,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-26 22:02:24,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:02:26,080 INFO L225 Difference]: With dead ends: 195371 [2019-12-26 22:02:26,080 INFO L226 Difference]: Without dead ends: 195371 [2019-12-26 22:02:26,081 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-26 22:02:36,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195371 states. [2019-12-26 22:02:39,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195371 to 171215. [2019-12-26 22:02:39,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171215 states. [2019-12-26 22:02:41,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171215 states to 171215 states and 713371 transitions. [2019-12-26 22:02:41,279 INFO L78 Accepts]: Start accepts. Automaton has 171215 states and 713371 transitions. Word has length 14 [2019-12-26 22:02:41,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:02:41,279 INFO L462 AbstractCegarLoop]: Abstraction has 171215 states and 713371 transitions. [2019-12-26 22:02:41,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:02:41,280 INFO L276 IsEmpty]: Start isEmpty. Operand 171215 states and 713371 transitions. [2019-12-26 22:02:41,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 22:02:41,284 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:02:41,284 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:02:41,285 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:02:41,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:02:41,285 INFO L82 PathProgramCache]: Analyzing trace with hash 575422588, now seen corresponding path program 1 times [2019-12-26 22:02:41,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:02:41,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517852021] [2019-12-26 22:02:41,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:02:41,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:02:41,354 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-26 22:02:41,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517852021] [2019-12-26 22:02:41,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:02:41,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:02:41,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686455479] [2019-12-26 22:02:41,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:02:41,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:02:41,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:02:41,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:02:41,357 INFO L87 Difference]: Start difference. First operand 171215 states and 713371 transitions. Second operand 4 states. [2019-12-26 22:02:42,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:02:42,503 INFO L93 Difference]: Finished difference Result 200032 states and 824493 transitions. [2019-12-26 22:02:42,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:02:42,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-26 22:02:42,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:02:50,021 INFO L225 Difference]: With dead ends: 200032 [2019-12-26 22:02:50,022 INFO L226 Difference]: Without dead ends: 199944 [2019-12-26 22:02:50,022 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-26 22:02:54,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199944 states. [2019-12-26 22:02:57,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199944 to 173869. [2019-12-26 22:02:57,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173869 states. [2019-12-26 22:02:59,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173869 states to 173869 states and 724501 transitions. [2019-12-26 22:02:59,065 INFO L78 Accepts]: Start accepts. Automaton has 173869 states and 724501 transitions. Word has length 14 [2019-12-26 22:02:59,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:02:59,066 INFO L462 AbstractCegarLoop]: Abstraction has 173869 states and 724501 transitions. [2019-12-26 22:02:59,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:02:59,066 INFO L276 IsEmpty]: Start isEmpty. Operand 173869 states and 724501 transitions. [2019-12-26 22:02:59,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-26 22:02:59,091 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:02:59,091 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-26 22:02:59,091 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:02:59,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:02:59,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1027045792, now seen corresponding path program 1 times [2019-12-26 22:02:59,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:02:59,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463059974] [2019-12-26 22:02:59,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:02:59,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:02:59,158 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-26 22:02:59,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463059974] [2019-12-26 22:02:59,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:02:59,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:02:59,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351868474] [2019-12-26 22:02:59,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:02:59,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:02:59,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:02:59,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:02:59,161 INFO L87 Difference]: Start difference. First operand 173869 states and 724501 transitions. Second operand 3 states. [2019-12-26 22:02:59,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:02:59,975 INFO L93 Difference]: Finished difference Result 173738 states and 723945 transitions. [2019-12-26 22:02:59,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:02:59,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-26 22:02:59,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:03:07,379 INFO L225 Difference]: With dead ends: 173738 [2019-12-26 22:03:07,379 INFO L226 Difference]: Without dead ends: 173738 [2019-12-26 22:03:07,380 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-26 22:03:11,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173738 states. [2019-12-26 22:03:14,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173738 to 173738. [2019-12-26 22:03:14,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173738 states. [2019-12-26 22:03:15,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173738 states to 173738 states and 723945 transitions. [2019-12-26 22:03:15,010 INFO L78 Accepts]: Start accepts. Automaton has 173738 states and 723945 transitions. Word has length 18 [2019-12-26 22:03:15,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:03:15,010 INFO L462 AbstractCegarLoop]: Abstraction has 173738 states and 723945 transitions. [2019-12-26 22:03:15,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:03:15,010 INFO L276 IsEmpty]: Start isEmpty. Operand 173738 states and 723945 transitions. [2019-12-26 22:03:15,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 22:03:15,037 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:03:15,037 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:03:15,037 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:03:15,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:03:15,038 INFO L82 PathProgramCache]: Analyzing trace with hash 930576187, now seen corresponding path program 1 times [2019-12-26 22:03:15,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:03:15,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921919490] [2019-12-26 22:03:15,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:03:15,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:03:15,115 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-26 22:03:15,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921919490] [2019-12-26 22:03:15,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:03:15,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:03:15,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852508941] [2019-12-26 22:03:15,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:03:15,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:03:15,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:03:15,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:03:15,118 INFO L87 Difference]: Start difference. First operand 173738 states and 723945 transitions. Second operand 3 states. [2019-12-26 22:03:17,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:03:17,609 INFO L93 Difference]: Finished difference Result 286764 states and 1191382 transitions. [2019-12-26 22:03:17,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:03:17,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-26 22:03:17,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:03:25,734 INFO L225 Difference]: With dead ends: 286764 [2019-12-26 22:03:25,734 INFO L226 Difference]: Without dead ends: 162140 [2019-12-26 22:03:25,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:03:29,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162140 states. [2019-12-26 22:03:31,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162140 to 153170. [2019-12-26 22:03:31,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153170 states. [2019-12-26 22:03:32,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153170 states to 153170 states and 628295 transitions. [2019-12-26 22:03:32,657 INFO L78 Accepts]: Start accepts. Automaton has 153170 states and 628295 transitions. Word has length 19 [2019-12-26 22:03:32,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:03:32,657 INFO L462 AbstractCegarLoop]: Abstraction has 153170 states and 628295 transitions. [2019-12-26 22:03:32,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:03:32,657 INFO L276 IsEmpty]: Start isEmpty. Operand 153170 states and 628295 transitions. [2019-12-26 22:03:32,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 22:03:32,674 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:03:32,674 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-26 22:03:32,674 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:03:32,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:03:32,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1809324800, now seen corresponding path program 1 times [2019-12-26 22:03:32,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:03:32,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108381299] [2019-12-26 22:03:32,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:03:32,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:03:32,736 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-26 22:03:32,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108381299] [2019-12-26 22:03:32,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:03:32,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:03:32,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340911492] [2019-12-26 22:03:32,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:03:32,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:03:32,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:03:32,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:03:32,740 INFO L87 Difference]: Start difference. First operand 153170 states and 628295 transitions. Second operand 3 states. [2019-12-26 22:03:34,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:03:34,653 INFO L93 Difference]: Finished difference Result 145211 states and 588530 transitions. [2019-12-26 22:03:34,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:03:34,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-26 22:03:34,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:03:35,086 INFO L225 Difference]: With dead ends: 145211 [2019-12-26 22:03:35,086 INFO L226 Difference]: Without dead ends: 145211 [2019-12-26 22:03:35,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:03:44,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145211 states. [2019-12-26 22:03:46,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145211 to 143797. [2019-12-26 22:03:46,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143797 states. [2019-12-26 22:03:47,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143797 states to 143797 states and 583330 transitions. [2019-12-26 22:03:47,737 INFO L78 Accepts]: Start accepts. Automaton has 143797 states and 583330 transitions. Word has length 19 [2019-12-26 22:03:47,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:03:47,737 INFO L462 AbstractCegarLoop]: Abstraction has 143797 states and 583330 transitions. [2019-12-26 22:03:47,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:03:47,737 INFO L276 IsEmpty]: Start isEmpty. Operand 143797 states and 583330 transitions. [2019-12-26 22:03:47,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 22:03:47,753 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:03:47,753 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-26 22:03:47,753 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:03:47,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:03:47,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1754353062, now seen corresponding path program 1 times [2019-12-26 22:03:47,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:03:47,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058489705] [2019-12-26 22:03:47,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:03:47,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:03:47,814 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-26 22:03:47,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058489705] [2019-12-26 22:03:47,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:03:47,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:03:47,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034130602] [2019-12-26 22:03:47,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:03:47,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:03:47,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:03:47,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:03:47,816 INFO L87 Difference]: Start difference. First operand 143797 states and 583330 transitions. Second operand 5 states. [2019-12-26 22:03:50,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:03:50,405 INFO L93 Difference]: Finished difference Result 191486 states and 758167 transitions. [2019-12-26 22:03:50,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:03:50,405 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-26 22:03:50,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:03:50,962 INFO L225 Difference]: With dead ends: 191486 [2019-12-26 22:03:50,963 INFO L226 Difference]: Without dead ends: 191267 [2019-12-26 22:03:50,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:04:00,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191267 states. [2019-12-26 22:04:02,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191267 to 152009. [2019-12-26 22:04:02,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152009 states. [2019-12-26 22:04:03,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152009 states to 152009 states and 614599 transitions. [2019-12-26 22:04:03,436 INFO L78 Accepts]: Start accepts. Automaton has 152009 states and 614599 transitions. Word has length 19 [2019-12-26 22:04:03,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:04:03,436 INFO L462 AbstractCegarLoop]: Abstraction has 152009 states and 614599 transitions. [2019-12-26 22:04:03,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:04:03,436 INFO L276 IsEmpty]: Start isEmpty. Operand 152009 states and 614599 transitions. [2019-12-26 22:04:03,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 22:04:03,451 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:04:03,451 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-26 22:04:03,451 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:04:03,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:04:03,452 INFO L82 PathProgramCache]: Analyzing trace with hash 422869821, now seen corresponding path program 1 times [2019-12-26 22:04:03,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:04:03,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635129674] [2019-12-26 22:04:03,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:04:03,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:04:03,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:04:03,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635129674] [2019-12-26 22:04:03,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:04:03,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:04:03,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272591826] [2019-12-26 22:04:03,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:04:03,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:04:03,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:04:03,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:04:03,533 INFO L87 Difference]: Start difference. First operand 152009 states and 614599 transitions. Second operand 4 states. [2019-12-26 22:04:03,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:04:03,742 INFO L93 Difference]: Finished difference Result 37859 states and 130356 transitions. [2019-12-26 22:04:03,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:04:03,743 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-26 22:04:03,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:04:03,796 INFO L225 Difference]: With dead ends: 37859 [2019-12-26 22:04:03,796 INFO L226 Difference]: Without dead ends: 29780 [2019-12-26 22:04:03,797 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-26 22:04:04,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29780 states. [2019-12-26 22:04:05,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29780 to 29780. [2019-12-26 22:04:05,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29780 states. [2019-12-26 22:04:05,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29780 states to 29780 states and 97851 transitions. [2019-12-26 22:04:05,358 INFO L78 Accepts]: Start accepts. Automaton has 29780 states and 97851 transitions. Word has length 19 [2019-12-26 22:04:05,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:04:05,358 INFO L462 AbstractCegarLoop]: Abstraction has 29780 states and 97851 transitions. [2019-12-26 22:04:05,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:04:05,358 INFO L276 IsEmpty]: Start isEmpty. Operand 29780 states and 97851 transitions. [2019-12-26 22:04:05,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 22:04:05,364 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:04:05,364 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-26 22:04:05,365 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:04:05,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:04:05,365 INFO L82 PathProgramCache]: Analyzing trace with hash -532738305, now seen corresponding path program 1 times [2019-12-26 22:04:05,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:04:05,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993178496] [2019-12-26 22:04:05,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:04:05,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:04:05,416 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-26 22:04:05,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993178496] [2019-12-26 22:04:05,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:04:05,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:04:05,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145129370] [2019-12-26 22:04:05,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:04:05,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:04:05,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:04:05,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:04:05,418 INFO L87 Difference]: Start difference. First operand 29780 states and 97851 transitions. Second operand 5 states. [2019-12-26 22:04:05,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:04:05,896 INFO L93 Difference]: Finished difference Result 39465 states and 127242 transitions. [2019-12-26 22:04:05,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:04:05,896 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-26 22:04:05,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:04:05,962 INFO L225 Difference]: With dead ends: 39465 [2019-12-26 22:04:05,962 INFO L226 Difference]: Without dead ends: 39274 [2019-12-26 22:04:05,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:04:06,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39274 states. [2019-12-26 22:04:06,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39274 to 30971. [2019-12-26 22:04:06,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30971 states. [2019-12-26 22:04:09,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30971 states to 30971 states and 101410 transitions. [2019-12-26 22:04:09,209 INFO L78 Accepts]: Start accepts. Automaton has 30971 states and 101410 transitions. Word has length 22 [2019-12-26 22:04:09,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:04:09,209 INFO L462 AbstractCegarLoop]: Abstraction has 30971 states and 101410 transitions. [2019-12-26 22:04:09,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:04:09,209 INFO L276 IsEmpty]: Start isEmpty. Operand 30971 states and 101410 transitions. [2019-12-26 22:04:09,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 22:04:09,216 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:04:09,216 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-26 22:04:09,216 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:04:09,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:04:09,217 INFO L82 PathProgramCache]: Analyzing trace with hash 828372869, now seen corresponding path program 1 times [2019-12-26 22:04:09,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:04:09,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672167929] [2019-12-26 22:04:09,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:04:09,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:04:09,261 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-26 22:04:09,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672167929] [2019-12-26 22:04:09,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:04:09,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:04:09,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821515254] [2019-12-26 22:04:09,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:04:09,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:04:09,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:04:09,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:04:09,264 INFO L87 Difference]: Start difference. First operand 30971 states and 101410 transitions. Second operand 5 states. [2019-12-26 22:04:09,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:04:09,766 INFO L93 Difference]: Finished difference Result 39564 states and 127608 transitions. [2019-12-26 22:04:09,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:04:09,766 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-26 22:04:09,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:04:09,828 INFO L225 Difference]: With dead ends: 39564 [2019-12-26 22:04:09,829 INFO L226 Difference]: Without dead ends: 39295 [2019-12-26 22:04:09,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:04:09,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39295 states. [2019-12-26 22:04:10,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39295 to 29549. [2019-12-26 22:04:10,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29549 states. [2019-12-26 22:04:10,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29549 states to 29549 states and 96955 transitions. [2019-12-26 22:04:10,384 INFO L78 Accepts]: Start accepts. Automaton has 29549 states and 96955 transitions. Word has length 22 [2019-12-26 22:04:10,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:04:10,384 INFO L462 AbstractCegarLoop]: Abstraction has 29549 states and 96955 transitions. [2019-12-26 22:04:10,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:04:10,384 INFO L276 IsEmpty]: Start isEmpty. Operand 29549 states and 96955 transitions. [2019-12-26 22:04:10,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 22:04:10,398 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:04:10,398 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-26 22:04:10,398 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:04:10,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:04:10,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1106278827, now seen corresponding path program 1 times [2019-12-26 22:04:10,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:04:10,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079587937] [2019-12-26 22:04:10,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:04:10,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:04:10,453 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-26 22:04:10,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079587937] [2019-12-26 22:04:10,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:04:10,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:04:10,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104330116] [2019-12-26 22:04:10,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:04:10,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:04:10,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:04:10,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:04:10,455 INFO L87 Difference]: Start difference. First operand 29549 states and 96955 transitions. Second operand 5 states. [2019-12-26 22:04:10,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:04:10,872 INFO L93 Difference]: Finished difference Result 40243 states and 130195 transitions. [2019-12-26 22:04:10,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:04:10,872 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-26 22:04:10,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:04:10,938 INFO L225 Difference]: With dead ends: 40243 [2019-12-26 22:04:10,938 INFO L226 Difference]: Without dead ends: 40219 [2019-12-26 22:04:10,939 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-26 22:04:11,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40219 states. [2019-12-26 22:04:11,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40219 to 32671. [2019-12-26 22:04:11,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32671 states. [2019-12-26 22:04:11,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32671 states to 32671 states and 106843 transitions. [2019-12-26 22:04:11,777 INFO L78 Accepts]: Start accepts. Automaton has 32671 states and 106843 transitions. Word has length 28 [2019-12-26 22:04:11,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:04:11,778 INFO L462 AbstractCegarLoop]: Abstraction has 32671 states and 106843 transitions. [2019-12-26 22:04:11,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:04:11,778 INFO L276 IsEmpty]: Start isEmpty. Operand 32671 states and 106843 transitions. [2019-12-26 22:04:11,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-26 22:04:11,794 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:04:11,795 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:04:11,795 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:04:11,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:04:11,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1126449648, now seen corresponding path program 1 times [2019-12-26 22:04:11,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:04:11,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388773042] [2019-12-26 22:04:11,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:04:11,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:04:11,858 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-26 22:04:11,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388773042] [2019-12-26 22:04:11,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:04:11,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:04:11,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886841247] [2019-12-26 22:04:11,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:04:11,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:04:11,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:04:11,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:04:11,860 INFO L87 Difference]: Start difference. First operand 32671 states and 106843 transitions. Second operand 5 states. [2019-12-26 22:04:12,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:04:12,250 INFO L93 Difference]: Finished difference Result 41985 states and 135178 transitions. [2019-12-26 22:04:12,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:04:12,250 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-26 22:04:12,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:04:12,323 INFO L225 Difference]: With dead ends: 41985 [2019-12-26 22:04:12,323 INFO L226 Difference]: Without dead ends: 41961 [2019-12-26 22:04:12,324 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-26 22:04:12,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41961 states. [2019-12-26 22:04:12,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41961 to 32060. [2019-12-26 22:04:12,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32060 states. [2019-12-26 22:04:12,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32060 states to 32060 states and 104673 transitions. [2019-12-26 22:04:12,914 INFO L78 Accepts]: Start accepts. Automaton has 32060 states and 104673 transitions. Word has length 29 [2019-12-26 22:04:12,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:04:12,915 INFO L462 AbstractCegarLoop]: Abstraction has 32060 states and 104673 transitions. [2019-12-26 22:04:12,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:04:12,915 INFO L276 IsEmpty]: Start isEmpty. Operand 32060 states and 104673 transitions. [2019-12-26 22:04:12,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-26 22:04:12,933 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:04:12,933 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:04:12,933 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:04:12,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:04:12,933 INFO L82 PathProgramCache]: Analyzing trace with hash -14540022, now seen corresponding path program 1 times [2019-12-26 22:04:12,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:04:12,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669488924] [2019-12-26 22:04:12,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:04:12,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:04:12,995 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-26 22:04:12,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669488924] [2019-12-26 22:04:12,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:04:12,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:04:12,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088960415] [2019-12-26 22:04:12,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:04:12,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:04:12,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:04:12,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:04:13,000 INFO L87 Difference]: Start difference. First operand 32060 states and 104673 transitions. Second operand 5 states. [2019-12-26 22:04:13,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:04:13,247 INFO L93 Difference]: Finished difference Result 13714 states and 42374 transitions. [2019-12-26 22:04:13,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:04:13,247 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-26 22:04:13,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:04:13,263 INFO L225 Difference]: With dead ends: 13714 [2019-12-26 22:04:13,264 INFO L226 Difference]: Without dead ends: 11900 [2019-12-26 22:04:13,264 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-26 22:04:13,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11900 states. [2019-12-26 22:04:13,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11900 to 11593. [2019-12-26 22:04:13,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11593 states. [2019-12-26 22:04:13,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11593 states to 11593 states and 35673 transitions. [2019-12-26 22:04:13,439 INFO L78 Accepts]: Start accepts. Automaton has 11593 states and 35673 transitions. Word has length 30 [2019-12-26 22:04:13,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:04:13,439 INFO L462 AbstractCegarLoop]: Abstraction has 11593 states and 35673 transitions. [2019-12-26 22:04:13,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:04:13,440 INFO L276 IsEmpty]: Start isEmpty. Operand 11593 states and 35673 transitions. [2019-12-26 22:04:13,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 22:04:13,453 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:04:13,453 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:04:13,453 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:04:13,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:04:13,453 INFO L82 PathProgramCache]: Analyzing trace with hash -761398124, now seen corresponding path program 1 times [2019-12-26 22:04:13,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:04:13,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814733632] [2019-12-26 22:04:13,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:04:13,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:04:13,525 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-26 22:04:13,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814733632] [2019-12-26 22:04:13,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:04:13,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:04:13,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100992191] [2019-12-26 22:04:13,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:04:13,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:04:13,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:04:13,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:04:13,527 INFO L87 Difference]: Start difference. First operand 11593 states and 35673 transitions. Second operand 6 states. [2019-12-26 22:04:14,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:04:14,038 INFO L93 Difference]: Finished difference Result 14689 states and 43755 transitions. [2019-12-26 22:04:14,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 22:04:14,039 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-26 22:04:14,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:04:14,069 INFO L225 Difference]: With dead ends: 14689 [2019-12-26 22:04:14,069 INFO L226 Difference]: Without dead ends: 14687 [2019-12-26 22:04:14,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-12-26 22:04:14,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14687 states. [2019-12-26 22:04:14,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14687 to 11869. [2019-12-26 22:04:14,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11869 states. [2019-12-26 22:04:14,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11869 states to 11869 states and 36412 transitions. [2019-12-26 22:04:14,291 INFO L78 Accepts]: Start accepts. Automaton has 11869 states and 36412 transitions. Word has length 40 [2019-12-26 22:04:14,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:04:14,291 INFO L462 AbstractCegarLoop]: Abstraction has 11869 states and 36412 transitions. [2019-12-26 22:04:14,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:04:14,291 INFO L276 IsEmpty]: Start isEmpty. Operand 11869 states and 36412 transitions. [2019-12-26 22:04:14,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 22:04:14,303 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:04:14,303 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:04:14,304 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:04:14,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:04:14,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1633369453, now seen corresponding path program 1 times [2019-12-26 22:04:14,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:04:14,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925523637] [2019-12-26 22:04:14,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:04:14,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:04:14,372 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-26 22:04:14,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925523637] [2019-12-26 22:04:14,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:04:14,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:04:14,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357452533] [2019-12-26 22:04:14,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:04:14,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:04:14,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:04:14,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:04:14,374 INFO L87 Difference]: Start difference. First operand 11869 states and 36412 transitions. Second operand 5 states. [2019-12-26 22:04:14,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:04:14,952 INFO L93 Difference]: Finished difference Result 18223 states and 55480 transitions. [2019-12-26 22:04:14,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:04:14,952 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-26 22:04:14,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:04:14,997 INFO L225 Difference]: With dead ends: 18223 [2019-12-26 22:04:14,997 INFO L226 Difference]: Without dead ends: 18223 [2019-12-26 22:04:14,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:04:15,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18223 states. [2019-12-26 22:04:15,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18223 to 15984. [2019-12-26 22:04:15,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15984 states. [2019-12-26 22:04:15,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15984 states to 15984 states and 49182 transitions. [2019-12-26 22:04:15,391 INFO L78 Accepts]: Start accepts. Automaton has 15984 states and 49182 transitions. Word has length 40 [2019-12-26 22:04:15,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:04:15,392 INFO L462 AbstractCegarLoop]: Abstraction has 15984 states and 49182 transitions. [2019-12-26 22:04:15,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:04:15,392 INFO L276 IsEmpty]: Start isEmpty. Operand 15984 states and 49182 transitions. [2019-12-26 22:04:15,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 22:04:15,419 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:04:15,420 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:04:15,420 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:04:15,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:04:15,420 INFO L82 PathProgramCache]: Analyzing trace with hash -308441065, now seen corresponding path program 2 times [2019-12-26 22:04:15,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:04:15,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974541207] [2019-12-26 22:04:15,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:04:15,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:04:15,481 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-26 22:04:15,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974541207] [2019-12-26 22:04:15,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:04:15,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:04:15,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679582265] [2019-12-26 22:04:15,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:04:15,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:04:15,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:04:15,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:04:15,484 INFO L87 Difference]: Start difference. First operand 15984 states and 49182 transitions. Second operand 3 states. [2019-12-26 22:04:15,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:04:15,559 INFO L93 Difference]: Finished difference Result 15143 states and 45952 transitions. [2019-12-26 22:04:15,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:04:15,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-26 22:04:15,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:04:15,586 INFO L225 Difference]: With dead ends: 15143 [2019-12-26 22:04:15,587 INFO L226 Difference]: Without dead ends: 15143 [2019-12-26 22:04:15,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:04:15,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15143 states. [2019-12-26 22:04:15,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15143 to 14516. [2019-12-26 22:04:15,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14516 states. [2019-12-26 22:04:15,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14516 states to 14516 states and 44169 transitions. [2019-12-26 22:04:15,931 INFO L78 Accepts]: Start accepts. Automaton has 14516 states and 44169 transitions. Word has length 40 [2019-12-26 22:04:15,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:04:15,931 INFO L462 AbstractCegarLoop]: Abstraction has 14516 states and 44169 transitions. [2019-12-26 22:04:15,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:04:15,931 INFO L276 IsEmpty]: Start isEmpty. Operand 14516 states and 44169 transitions. [2019-12-26 22:04:15,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-26 22:04:15,951 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:04:15,951 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-26 22:04:15,951 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:04:15,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:04:15,952 INFO L82 PathProgramCache]: Analyzing trace with hash 797278347, now seen corresponding path program 1 times [2019-12-26 22:04:15,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:04:15,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700480745] [2019-12-26 22:04:15,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:04:15,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:04:16,011 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-26 22:04:16,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700480745] [2019-12-26 22:04:16,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:04:16,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:04:16,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348478071] [2019-12-26 22:04:16,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:04:16,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:04:16,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:04:16,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:04:16,013 INFO L87 Difference]: Start difference. First operand 14516 states and 44169 transitions. Second operand 6 states. [2019-12-26 22:04:16,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:04:16,511 INFO L93 Difference]: Finished difference Result 17222 states and 51134 transitions. [2019-12-26 22:04:16,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 22:04:16,512 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-26 22:04:16,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:04:16,535 INFO L225 Difference]: With dead ends: 17222 [2019-12-26 22:04:16,535 INFO L226 Difference]: Without dead ends: 17220 [2019-12-26 22:04:16,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-12-26 22:04:16,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17220 states. [2019-12-26 22:04:16,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17220 to 13885. [2019-12-26 22:04:16,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13885 states. [2019-12-26 22:04:16,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13885 states to 13885 states and 42429 transitions. [2019-12-26 22:04:16,754 INFO L78 Accepts]: Start accepts. Automaton has 13885 states and 42429 transitions. Word has length 41 [2019-12-26 22:04:16,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:04:16,755 INFO L462 AbstractCegarLoop]: Abstraction has 13885 states and 42429 transitions. [2019-12-26 22:04:16,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:04:16,755 INFO L276 IsEmpty]: Start isEmpty. Operand 13885 states and 42429 transitions. [2019-12-26 22:04:16,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-26 22:04:16,773 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:04:16,773 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-26 22:04:16,774 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:04:16,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:04:16,774 INFO L82 PathProgramCache]: Analyzing trace with hash 771947399, now seen corresponding path program 1 times [2019-12-26 22:04:16,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:04:16,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120930915] [2019-12-26 22:04:16,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:04:16,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:04:16,865 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-26 22:04:16,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120930915] [2019-12-26 22:04:16,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:04:16,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:04:16,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150936743] [2019-12-26 22:04:16,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:04:16,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:04:16,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:04:16,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:04:16,867 INFO L87 Difference]: Start difference. First operand 13885 states and 42429 transitions. Second operand 6 states. [2019-12-26 22:04:16,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:04:16,969 INFO L93 Difference]: Finished difference Result 12733 states and 39642 transitions. [2019-12-26 22:04:16,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:04:16,969 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-26 22:04:16,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:04:16,986 INFO L225 Difference]: With dead ends: 12733 [2019-12-26 22:04:16,986 INFO L226 Difference]: Without dead ends: 11550 [2019-12-26 22:04:16,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:04:17,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11550 states. [2019-12-26 22:04:17,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11550 to 11130. [2019-12-26 22:04:17,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11130 states. [2019-12-26 22:04:17,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11130 states to 11130 states and 35538 transitions. [2019-12-26 22:04:17,160 INFO L78 Accepts]: Start accepts. Automaton has 11130 states and 35538 transitions. Word has length 41 [2019-12-26 22:04:17,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:04:17,161 INFO L462 AbstractCegarLoop]: Abstraction has 11130 states and 35538 transitions. [2019-12-26 22:04:17,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:04:17,161 INFO L276 IsEmpty]: Start isEmpty. Operand 11130 states and 35538 transitions. [2019-12-26 22:04:17,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-26 22:04:17,174 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:04:17,174 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:04:17,174 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:04:17,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:04:17,174 INFO L82 PathProgramCache]: Analyzing trace with hash 852736153, now seen corresponding path program 1 times [2019-12-26 22:04:17,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:04:17,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995437025] [2019-12-26 22:04:17,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:04:17,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:04:17,226 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-26 22:04:17,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995437025] [2019-12-26 22:04:17,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:04:17,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:04:17,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977189985] [2019-12-26 22:04:17,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:04:17,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:04:17,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:04:17,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:04:17,231 INFO L87 Difference]: Start difference. First operand 11130 states and 35538 transitions. Second operand 3 states. [2019-12-26 22:04:17,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:04:17,316 INFO L93 Difference]: Finished difference Result 12575 states and 38277 transitions. [2019-12-26 22:04:17,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:04:17,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-26 22:04:17,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:04:17,340 INFO L225 Difference]: With dead ends: 12575 [2019-12-26 22:04:17,340 INFO L226 Difference]: Without dead ends: 12575 [2019-12-26 22:04:17,341 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-26 22:04:17,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12575 states. [2019-12-26 22:04:17,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12575 to 9907. [2019-12-26 22:04:17,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9907 states. [2019-12-26 22:04:17,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9907 states to 9907 states and 30647 transitions. [2019-12-26 22:04:17,521 INFO L78 Accepts]: Start accepts. Automaton has 9907 states and 30647 transitions. Word has length 56 [2019-12-26 22:04:17,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:04:17,521 INFO L462 AbstractCegarLoop]: Abstraction has 9907 states and 30647 transitions. [2019-12-26 22:04:17,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:04:17,521 INFO L276 IsEmpty]: Start isEmpty. Operand 9907 states and 30647 transitions. [2019-12-26 22:04:17,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-26 22:04:17,531 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:04:17,531 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:04:17,531 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:04:17,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:04:17,532 INFO L82 PathProgramCache]: Analyzing trace with hash -415784116, now seen corresponding path program 1 times [2019-12-26 22:04:17,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:04:17,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404411310] [2019-12-26 22:04:17,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:04:17,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:04:17,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:04:17,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404411310] [2019-12-26 22:04:17,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:04:17,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:04:17,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118810249] [2019-12-26 22:04:17,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:04:17,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:04:17,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:04:17,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:04:17,585 INFO L87 Difference]: Start difference. First operand 9907 states and 30647 transitions. Second operand 4 states. [2019-12-26 22:04:17,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:04:17,653 INFO L93 Difference]: Finished difference Result 16499 states and 51208 transitions. [2019-12-26 22:04:17,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:04:17,654 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-26 22:04:17,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:04:17,666 INFO L225 Difference]: With dead ends: 16499 [2019-12-26 22:04:17,666 INFO L226 Difference]: Without dead ends: 6904 [2019-12-26 22:04:17,667 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-26 22:04:17,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6904 states. [2019-12-26 22:04:17,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6904 to 6904. [2019-12-26 22:04:17,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6904 states. [2019-12-26 22:04:17,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6904 states to 6904 states and 21383 transitions. [2019-12-26 22:04:17,776 INFO L78 Accepts]: Start accepts. Automaton has 6904 states and 21383 transitions. Word has length 56 [2019-12-26 22:04:17,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:04:17,776 INFO L462 AbstractCegarLoop]: Abstraction has 6904 states and 21383 transitions. [2019-12-26 22:04:17,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:04:17,776 INFO L276 IsEmpty]: Start isEmpty. Operand 6904 states and 21383 transitions. [2019-12-26 22:04:17,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-26 22:04:17,784 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:04:17,784 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:04:17,784 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:04:17,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:04:17,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1395977884, now seen corresponding path program 2 times [2019-12-26 22:04:17,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:04:17,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31036808] [2019-12-26 22:04:17,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:04:17,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:04:18,372 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-26 22:04:18,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31036808] [2019-12-26 22:04:18,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:04:18,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-26 22:04:18,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175178867] [2019-12-26 22:04:18,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-26 22:04:18,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:04:18,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-26 22:04:18,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-26 22:04:18,374 INFO L87 Difference]: Start difference. First operand 6904 states and 21383 transitions. Second operand 15 states. Received shutdown request... [2019-12-26 22:04:19,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 22:04:19,056 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-26 22:04:19,060 WARN L227 ceAbstractionStarter]: Timeout [2019-12-26 22:04:19,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 10:04:19 BasicIcfg [2019-12-26 22:04:19,060 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 22:04:19,061 INFO L168 Benchmark]: Toolchain (without parser) took 191222.35 ms. Allocated memory was 143.7 MB in the beginning and 3.6 GB in the end (delta: 3.5 GB). Free memory was 98.8 MB in the beginning and 2.9 GB in the end (delta: -2.8 GB). Peak memory consumption was 642.5 MB. Max. memory is 7.1 GB. [2019-12-26 22:04:19,062 INFO L168 Benchmark]: CDTParser took 1.08 ms. Allocated memory is still 143.7 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-26 22:04:19,063 INFO L168 Benchmark]: CACSL2BoogieTranslator took 703.03 ms. Allocated memory was 143.7 MB in the beginning and 201.3 MB in the end (delta: 57.7 MB). Free memory was 98.4 MB in the beginning and 155.0 MB in the end (delta: -56.7 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2019-12-26 22:04:19,063 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.01 ms. Allocated memory is still 201.3 MB. Free memory was 155.0 MB in the beginning and 152.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-26 22:04:19,064 INFO L168 Benchmark]: Boogie Preprocessor took 45.93 ms. Allocated memory is still 201.3 MB. Free memory was 152.2 MB in the beginning and 150.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-26 22:04:19,064 INFO L168 Benchmark]: RCFGBuilder took 822.58 ms. Allocated memory is still 201.3 MB. Free memory was 150.1 MB in the beginning and 103.0 MB in the end (delta: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 7.1 GB. [2019-12-26 22:04:19,065 INFO L168 Benchmark]: TraceAbstraction took 189569.50 ms. Allocated memory was 201.3 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 103.0 MB in the beginning and 2.9 GB in the end (delta: -2.8 GB). Peak memory consumption was 589.0 MB. Max. memory is 7.1 GB. [2019-12-26 22:04:19,067 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.08 ms. Allocated memory is still 143.7 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 703.03 ms. Allocated memory was 143.7 MB in the beginning and 201.3 MB in the end (delta: 57.7 MB). Free memory was 98.4 MB in the beginning and 155.0 MB in the end (delta: -56.7 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.01 ms. Allocated memory is still 201.3 MB. Free memory was 155.0 MB in the beginning and 152.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.93 ms. Allocated memory is still 201.3 MB. Free memory was 152.2 MB in the beginning and 150.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 822.58 ms. Allocated memory is still 201.3 MB. Free memory was 150.1 MB in the beginning and 103.0 MB in the end (delta: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 189569.50 ms. Allocated memory was 201.3 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 103.0 MB in the beginning and 2.9 GB in the end (delta: -2.8 GB). Peak memory consumption was 589.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.2s, 164 ProgramPointsBefore, 82 ProgramPointsAfterwards, 195 TransitionsBefore, 91 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 26 ChoiceCompositions, 6794 VarBasedMoverChecksPositive, 260 VarBasedMoverChecksNegative, 81 SemBasedMoverChecksPositive, 256 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 73051 CheckedPairsTotal, 115 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (6904states) and FLOYD_HOARE automaton (currently 12 states, 15 states before enhancement),while ReachableStatesComputation was computing reachable states (248 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (6904states) and FLOYD_HOARE automaton (currently 12 states, 15 states before enhancement),while ReachableStatesComputation was computing reachable states (248 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: TIMEOUT, OverallTime: 189.3s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 58.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3394 SDtfs, 3848 SDslu, 5451 SDs, 0 SdLazy, 3548 SolverSat, 189 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 156 GetRequests, 34 SyntacticMatches, 9 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=173869occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 110.8s AutomataMinimizationTime, 23 MinimizatonAttempts, 201654 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 668 NumberOfCodeBlocks, 668 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 644 ConstructedInterpolants, 0 QuantifiedInterpolants, 78396 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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