/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix025_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 16:52:14,611 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 16:52:14,613 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 16:52:14,626 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 16:52:14,626 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 16:52:14,627 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 16:52:14,628 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 16:52:14,630 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 16:52:14,632 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 16:52:14,632 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 16:52:14,633 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 16:52:14,634 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 16:52:14,635 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 16:52:14,636 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 16:52:14,637 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 16:52:14,638 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 16:52:14,638 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 16:52:14,639 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 16:52:14,641 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 16:52:14,643 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 16:52:14,645 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 16:52:14,647 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 16:52:14,649 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 16:52:14,649 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 16:52:14,652 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 16:52:14,652 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 16:52:14,652 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 16:52:14,653 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 16:52:14,654 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 16:52:14,655 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 16:52:14,655 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 16:52:14,657 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 16:52:14,658 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 16:52:14,659 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 16:52:14,660 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 16:52:14,660 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 16:52:14,662 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 16:52:14,662 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 16:52:14,662 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 16:52:14,665 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 16:52:14,668 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 16:52:14,669 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 16:52:14,692 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 16:52:14,692 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 16:52:14,694 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 16:52:14,694 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 16:52:14,694 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 16:52:14,695 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 16:52:14,695 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 16:52:14,695 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 16:52:14,695 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 16:52:14,695 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 16:52:14,696 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 16:52:14,697 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 16:52:14,697 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 16:52:14,697 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 16:52:14,698 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 16:52:14,698 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 16:52:14,698 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 16:52:14,698 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 16:52:14,698 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 16:52:14,698 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 16:52:14,699 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 16:52:14,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 16:52:14,699 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 16:52:14,700 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 16:52:14,700 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 16:52:14,700 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 16:52:14,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 16:52:14,700 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 16:52:14,700 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 16:52:14,986 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 16:52:15,004 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 16:52:15,007 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 16:52:15,009 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 16:52:15,009 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 16:52:15,010 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-18 16:52:15,093 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7688d3d3/67f0726b7c1743e0a9ee3864bd38acb9/FLAG6574aab4b [2019-12-18 16:52:15,680 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 16:52:15,681 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_rmo.opt.i [2019-12-18 16:52:15,696 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7688d3d3/67f0726b7c1743e0a9ee3864bd38acb9/FLAG6574aab4b [2019-12-18 16:52:15,912 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7688d3d3/67f0726b7c1743e0a9ee3864bd38acb9 [2019-12-18 16:52:15,919 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 16:52:15,921 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 16:52:15,922 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 16:52:15,922 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 16:52:15,926 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 16:52:15,927 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:52:15" (1/1) ... [2019-12-18 16:52:15,929 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fa21428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:52:15, skipping insertion in model container [2019-12-18 16:52:15,930 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:52:15" (1/1) ... [2019-12-18 16:52:15,937 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 16:52:15,996 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 16:52:16,589 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:52:16,602 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 16:52:16,657 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:52:16,727 INFO L208 MainTranslator]: Completed translation [2019-12-18 16:52:16,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:52:16 WrapperNode [2019-12-18 16:52:16,728 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 16:52:16,729 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 16:52:16,729 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 16:52:16,729 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 16:52:16,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:52:16" (1/1) ... [2019-12-18 16:52:16,758 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:52:16" (1/1) ... [2019-12-18 16:52:16,788 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 16:52:16,789 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 16:52:16,789 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 16:52:16,789 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 16:52:16,797 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:52:16" (1/1) ... [2019-12-18 16:52:16,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:52:16" (1/1) ... [2019-12-18 16:52:16,802 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:52:16" (1/1) ... [2019-12-18 16:52:16,803 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:52:16" (1/1) ... [2019-12-18 16:52:16,814 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:52:16" (1/1) ... [2019-12-18 16:52:16,818 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:52:16" (1/1) ... [2019-12-18 16:52:16,822 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:52:16" (1/1) ... [2019-12-18 16:52:16,827 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 16:52:16,828 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 16:52:16,828 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 16:52:16,828 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 16:52:16,829 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:52:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 16:52:16,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 16:52:16,892 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 16:52:16,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 16:52:16,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 16:52:16,892 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 16:52:16,892 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 16:52:16,892 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 16:52:16,892 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 16:52:16,893 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 16:52:16,893 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 16:52:16,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 16:52:16,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 16:52:16,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 16:52:16,895 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 16:52:17,609 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 16:52:17,609 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 16:52:17,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:52:17 BoogieIcfgContainer [2019-12-18 16:52:17,611 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 16:52:17,612 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 16:52:17,612 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 16:52:17,615 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 16:52:17,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 04:52:15" (1/3) ... [2019-12-18 16:52:17,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c158e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:52:17, skipping insertion in model container [2019-12-18 16:52:17,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:52:16" (2/3) ... [2019-12-18 16:52:17,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c158e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:52:17, skipping insertion in model container [2019-12-18 16:52:17,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:52:17" (3/3) ... [2019-12-18 16:52:17,619 INFO L109 eAbstractionObserver]: Analyzing ICFG mix025_rmo.opt.i [2019-12-18 16:52:17,630 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 16:52:17,630 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 16:52:17,643 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 16:52:17,644 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 16:52:17,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,705 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,705 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,746 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,746 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,746 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,746 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,747 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,754 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,754 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,762 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,763 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,763 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,768 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,769 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,772 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,773 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:52:17,792 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 16:52:17,814 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 16:52:17,814 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 16:52:17,814 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 16:52:17,814 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 16:52:17,814 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 16:52:17,814 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 16:52:17,815 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 16:52:17,815 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 16:52:17,835 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-18 16:52:17,837 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 16:52:17,932 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 16:52:17,932 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:52:17,950 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. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 16:52:17,977 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-18 16:52:18,059 INFO L126 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-18 16:52:18,059 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:52:18,071 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. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 16:52:18,092 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 16:52:18,093 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 16:52:23,779 WARN L192 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 16:52:23,969 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 16:52:24,006 INFO L206 etLargeBlockEncoding]: Checked pairs total: 73051 [2019-12-18 16:52:24,007 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-18 16:52:24,014 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 91 transitions [2019-12-18 16:52:35,514 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 83162 states. [2019-12-18 16:52:35,516 INFO L276 IsEmpty]: Start isEmpty. Operand 83162 states. [2019-12-18 16:52:35,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 16:52:35,522 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:35,523 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 16:52:35,523 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:52:35,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:35,530 INFO L82 PathProgramCache]: Analyzing trace with hash 800250999, now seen corresponding path program 1 times [2019-12-18 16:52:35,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:35,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165209686] [2019-12-18 16:52:35,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:35,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:35,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:52:35,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165209686] [2019-12-18 16:52:35,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:35,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:52:35,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613543124] [2019-12-18 16:52:35,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:52:35,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:35,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:52:35,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:52:35,840 INFO L87 Difference]: Start difference. First operand 83162 states. Second operand 3 states. [2019-12-18 16:52:36,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:36,921 INFO L93 Difference]: Finished difference Result 82042 states and 356056 transitions. [2019-12-18 16:52:36,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:52:36,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 16:52:36,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:40,024 INFO L225 Difference]: With dead ends: 82042 [2019-12-18 16:52:40,025 INFO L226 Difference]: Without dead ends: 77338 [2019-12-18 16:52:40,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:52:42,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77338 states. [2019-12-18 16:52:44,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77338 to 77338. [2019-12-18 16:52:44,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77338 states. [2019-12-18 16:52:45,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77338 states to 77338 states and 335168 transitions. [2019-12-18 16:52:45,790 INFO L78 Accepts]: Start accepts. Automaton has 77338 states and 335168 transitions. Word has length 5 [2019-12-18 16:52:45,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:45,790 INFO L462 AbstractCegarLoop]: Abstraction has 77338 states and 335168 transitions. [2019-12-18 16:52:45,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:52:45,791 INFO L276 IsEmpty]: Start isEmpty. Operand 77338 states and 335168 transitions. [2019-12-18 16:52:45,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 16:52:45,807 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:45,807 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:52:45,808 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:52:45,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:45,808 INFO L82 PathProgramCache]: Analyzing trace with hash -463413440, now seen corresponding path program 1 times [2019-12-18 16:52:45,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:45,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639565301] [2019-12-18 16:52:45,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:45,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:52:45,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639565301] [2019-12-18 16:52:45,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:45,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:52:45,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864420413] [2019-12-18 16:52:45,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:52:45,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:45,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:52:45,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:52:45,944 INFO L87 Difference]: Start difference. First operand 77338 states and 335168 transitions. Second operand 4 states. [2019-12-18 16:52:49,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:52:49,583 INFO L93 Difference]: Finished difference Result 119002 states and 493831 transitions. [2019-12-18 16:52:49,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:52:49,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 16:52:49,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:52:50,198 INFO L225 Difference]: With dead ends: 119002 [2019-12-18 16:52:50,198 INFO L226 Difference]: Without dead ends: 118911 [2019-12-18 16:52:50,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:52:56,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118911 states. [2019-12-18 16:52:58,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118911 to 109839. [2019-12-18 16:52:58,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109839 states. [2019-12-18 16:52:59,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109839 states to 109839 states and 460824 transitions. [2019-12-18 16:52:59,298 INFO L78 Accepts]: Start accepts. Automaton has 109839 states and 460824 transitions. Word has length 13 [2019-12-18 16:52:59,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:52:59,299 INFO L462 AbstractCegarLoop]: Abstraction has 109839 states and 460824 transitions. [2019-12-18 16:52:59,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:52:59,300 INFO L276 IsEmpty]: Start isEmpty. Operand 109839 states and 460824 transitions. [2019-12-18 16:52:59,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 16:52:59,303 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:52:59,303 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:52:59,303 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:52:59,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:52:59,303 INFO L82 PathProgramCache]: Analyzing trace with hash 2092378622, now seen corresponding path program 1 times [2019-12-18 16:52:59,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:52:59,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529647331] [2019-12-18 16:52:59,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:52:59,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:52:59,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:52:59,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529647331] [2019-12-18 16:52:59,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:52:59,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:52:59,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351514787] [2019-12-18 16:52:59,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:52:59,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:52:59,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:52:59,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:52:59,381 INFO L87 Difference]: Start difference. First operand 109839 states and 460824 transitions. Second operand 4 states. [2019-12-18 16:53:04,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:53:04,383 INFO L93 Difference]: Finished difference Result 153490 states and 628667 transitions. [2019-12-18 16:53:04,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:53:04,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 16:53:04,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:53:04,913 INFO L225 Difference]: With dead ends: 153490 [2019-12-18 16:53:04,913 INFO L226 Difference]: Without dead ends: 153386 [2019-12-18 16:53:04,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:53:08,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153386 states. [2019-12-18 16:53:11,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153386 to 130549. [2019-12-18 16:53:11,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130549 states. [2019-12-18 16:53:12,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130549 states to 130549 states and 543763 transitions. [2019-12-18 16:53:12,006 INFO L78 Accepts]: Start accepts. Automaton has 130549 states and 543763 transitions. Word has length 13 [2019-12-18 16:53:12,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:53:12,006 INFO L462 AbstractCegarLoop]: Abstraction has 130549 states and 543763 transitions. [2019-12-18 16:53:12,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:53:12,006 INFO L276 IsEmpty]: Start isEmpty. Operand 130549 states and 543763 transitions. [2019-12-18 16:53:12,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 16:53:12,010 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:53:12,010 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:53:12,010 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:53:12,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:53:12,011 INFO L82 PathProgramCache]: Analyzing trace with hash 740124844, now seen corresponding path program 1 times [2019-12-18 16:53:12,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:53:12,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887486678] [2019-12-18 16:53:12,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:53:12,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:53:12,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:53:12,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887486678] [2019-12-18 16:53:12,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:53:12,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:53:12,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829167830] [2019-12-18 16:53:12,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:53:12,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:53:12,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:53:12,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:53:12,091 INFO L87 Difference]: Start difference. First operand 130549 states and 543763 transitions. Second operand 4 states. [2019-12-18 16:53:16,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:53:16,931 INFO L93 Difference]: Finished difference Result 162838 states and 668586 transitions. [2019-12-18 16:53:16,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:53:16,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 16:53:16,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:53:17,406 INFO L225 Difference]: With dead ends: 162838 [2019-12-18 16:53:17,406 INFO L226 Difference]: Without dead ends: 162750 [2019-12-18 16:53:17,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:53:21,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162750 states. [2019-12-18 16:53:25,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162750 to 140790. [2019-12-18 16:53:25,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140790 states. [2019-12-18 16:53:25,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140790 states to 140790 states and 584562 transitions. [2019-12-18 16:53:25,651 INFO L78 Accepts]: Start accepts. Automaton has 140790 states and 584562 transitions. Word has length 14 [2019-12-18 16:53:25,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:53:25,651 INFO L462 AbstractCegarLoop]: Abstraction has 140790 states and 584562 transitions. [2019-12-18 16:53:25,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:53:25,651 INFO L276 IsEmpty]: Start isEmpty. Operand 140790 states and 584562 transitions. [2019-12-18 16:53:25,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 16:53:25,655 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:53:25,656 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:53:25,656 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:53:25,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:53:25,656 INFO L82 PathProgramCache]: Analyzing trace with hash 739988072, now seen corresponding path program 1 times [2019-12-18 16:53:25,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:53:25,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068025819] [2019-12-18 16:53:25,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:53:25,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:53:25,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:53:25,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068025819] [2019-12-18 16:53:25,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:53:25,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:53:25,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266291466] [2019-12-18 16:53:25,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:53:25,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:53:25,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:53:25,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:53:25,720 INFO L87 Difference]: Start difference. First operand 140790 states and 584562 transitions. Second operand 3 states. [2019-12-18 16:53:32,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:53:32,751 INFO L93 Difference]: Finished difference Result 195371 states and 811522 transitions. [2019-12-18 16:53:32,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:53:32,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 16:53:32,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:53:33,355 INFO L225 Difference]: With dead ends: 195371 [2019-12-18 16:53:33,355 INFO L226 Difference]: Without dead ends: 195371 [2019-12-18 16:53:33,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:53:37,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195371 states. [2019-12-18 16:53:40,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195371 to 171215. [2019-12-18 16:53:40,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171215 states. [2019-12-18 16:53:41,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171215 states to 171215 states and 713371 transitions. [2019-12-18 16:53:41,561 INFO L78 Accepts]: Start accepts. Automaton has 171215 states and 713371 transitions. Word has length 14 [2019-12-18 16:53:41,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:53:41,561 INFO L462 AbstractCegarLoop]: Abstraction has 171215 states and 713371 transitions. [2019-12-18 16:53:41,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:53:41,561 INFO L276 IsEmpty]: Start isEmpty. Operand 171215 states and 713371 transitions. [2019-12-18 16:53:41,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 16:53:41,564 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:53:41,564 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:53:41,564 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:53:41,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:53:41,565 INFO L82 PathProgramCache]: Analyzing trace with hash 575422588, now seen corresponding path program 1 times [2019-12-18 16:53:41,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:53:41,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38584634] [2019-12-18 16:53:41,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:53:41,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:53:41,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:53:41,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38584634] [2019-12-18 16:53:41,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:53:41,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:53:41,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643647269] [2019-12-18 16:53:41,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:53:41,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:53:41,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:53:41,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:53:41,623 INFO L87 Difference]: Start difference. First operand 171215 states and 713371 transitions. Second operand 4 states. [2019-12-18 16:53:43,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:53:43,885 INFO L93 Difference]: Finished difference Result 200032 states and 824493 transitions. [2019-12-18 16:53:43,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:53:43,885 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 16:53:43,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:53:51,682 INFO L225 Difference]: With dead ends: 200032 [2019-12-18 16:53:51,682 INFO L226 Difference]: Without dead ends: 199944 [2019-12-18 16:53:51,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:53:55,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199944 states. [2019-12-18 16:53:59,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199944 to 173869. [2019-12-18 16:53:59,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173869 states. [2019-12-18 16:53:59,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173869 states to 173869 states and 724501 transitions. [2019-12-18 16:53:59,721 INFO L78 Accepts]: Start accepts. Automaton has 173869 states and 724501 transitions. Word has length 14 [2019-12-18 16:53:59,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:53:59,721 INFO L462 AbstractCegarLoop]: Abstraction has 173869 states and 724501 transitions. [2019-12-18 16:53:59,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:53:59,721 INFO L276 IsEmpty]: Start isEmpty. Operand 173869 states and 724501 transitions. [2019-12-18 16:53:59,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 16:53:59,741 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:53:59,741 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:53:59,741 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:53:59,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:53:59,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1027045792, now seen corresponding path program 1 times [2019-12-18 16:53:59,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:53:59,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041492895] [2019-12-18 16:53:59,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:53:59,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:53:59,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:53:59,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041492895] [2019-12-18 16:53:59,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:53:59,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:53:59,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655072749] [2019-12-18 16:53:59,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:53:59,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:53:59,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:53:59,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:53:59,792 INFO L87 Difference]: Start difference. First operand 173869 states and 724501 transitions. Second operand 3 states. [2019-12-18 16:54:01,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:54:01,790 INFO L93 Difference]: Finished difference Result 173738 states and 723945 transitions. [2019-12-18 16:54:01,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:54:01,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-18 16:54:01,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:54:02,304 INFO L225 Difference]: With dead ends: 173738 [2019-12-18 16:54:02,305 INFO L226 Difference]: Without dead ends: 173738 [2019-12-18 16:54:02,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:54:13,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173738 states. [2019-12-18 16:54:15,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173738 to 173738. [2019-12-18 16:54:15,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173738 states. [2019-12-18 16:54:16,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173738 states to 173738 states and 723945 transitions. [2019-12-18 16:54:16,869 INFO L78 Accepts]: Start accepts. Automaton has 173738 states and 723945 transitions. Word has length 18 [2019-12-18 16:54:16,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:54:16,870 INFO L462 AbstractCegarLoop]: Abstraction has 173738 states and 723945 transitions. [2019-12-18 16:54:16,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:54:16,870 INFO L276 IsEmpty]: Start isEmpty. Operand 173738 states and 723945 transitions. [2019-12-18 16:54:16,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 16:54:16,891 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:54:16,891 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:54:16,892 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:54:16,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:54:16,892 INFO L82 PathProgramCache]: Analyzing trace with hash 930576187, now seen corresponding path program 1 times [2019-12-18 16:54:16,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:54:16,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327948422] [2019-12-18 16:54:16,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:54:16,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:54:16,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:54:16,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327948422] [2019-12-18 16:54:16,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:54:16,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:54:16,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881333331] [2019-12-18 16:54:16,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:54:16,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:54:16,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:54:16,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:54:16,933 INFO L87 Difference]: Start difference. First operand 173738 states and 723945 transitions. Second operand 3 states. [2019-12-18 16:54:24,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:54:24,204 INFO L93 Difference]: Finished difference Result 286764 states and 1191382 transitions. [2019-12-18 16:54:24,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:54:24,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-18 16:54:24,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:54:24,688 INFO L225 Difference]: With dead ends: 286764 [2019-12-18 16:54:24,688 INFO L226 Difference]: Without dead ends: 162140 [2019-12-18 16:54:24,689 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-18 16:54:33,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162140 states. [2019-12-18 16:54:35,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162140 to 153170. [2019-12-18 16:54:35,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153170 states. [2019-12-18 16:54:37,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153170 states to 153170 states and 628295 transitions. [2019-12-18 16:54:37,300 INFO L78 Accepts]: Start accepts. Automaton has 153170 states and 628295 transitions. Word has length 19 [2019-12-18 16:54:37,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:54:37,300 INFO L462 AbstractCegarLoop]: Abstraction has 153170 states and 628295 transitions. [2019-12-18 16:54:37,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:54:37,300 INFO L276 IsEmpty]: Start isEmpty. Operand 153170 states and 628295 transitions. [2019-12-18 16:54:37,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 16:54:37,320 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:54:37,320 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:54:37,320 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:54:37,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:54:37,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1809324800, now seen corresponding path program 1 times [2019-12-18 16:54:37,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:54:37,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697679413] [2019-12-18 16:54:37,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:54:37,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:54:37,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:54:37,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697679413] [2019-12-18 16:54:37,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:54:37,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:54:37,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954399165] [2019-12-18 16:54:37,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:54:37,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:54:37,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:54:37,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:54:37,374 INFO L87 Difference]: Start difference. First operand 153170 states and 628295 transitions. Second operand 3 states. [2019-12-18 16:54:38,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:54:38,177 INFO L93 Difference]: Finished difference Result 145211 states and 588530 transitions. [2019-12-18 16:54:38,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:54:38,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-18 16:54:38,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:54:38,578 INFO L225 Difference]: With dead ends: 145211 [2019-12-18 16:54:38,579 INFO L226 Difference]: Without dead ends: 145211 [2019-12-18 16:54:38,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:54:49,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145211 states. [2019-12-18 16:54:51,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145211 to 143797. [2019-12-18 16:54:51,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143797 states. [2019-12-18 16:54:51,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143797 states to 143797 states and 583330 transitions. [2019-12-18 16:54:51,928 INFO L78 Accepts]: Start accepts. Automaton has 143797 states and 583330 transitions. Word has length 19 [2019-12-18 16:54:51,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:54:51,929 INFO L462 AbstractCegarLoop]: Abstraction has 143797 states and 583330 transitions. [2019-12-18 16:54:51,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:54:51,929 INFO L276 IsEmpty]: Start isEmpty. Operand 143797 states and 583330 transitions. [2019-12-18 16:54:51,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 16:54:51,943 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:54:51,944 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:54:51,944 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:54:51,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:54:51,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1754353062, now seen corresponding path program 1 times [2019-12-18 16:54:51,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:54:51,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667862552] [2019-12-18 16:54:51,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:54:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:54:52,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:54:52,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667862552] [2019-12-18 16:54:52,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:54:52,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:54:52,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176639628] [2019-12-18 16:54:52,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:54:52,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:54:52,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:54:52,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:54:52,041 INFO L87 Difference]: Start difference. First operand 143797 states and 583330 transitions. Second operand 5 states. [2019-12-18 16:54:54,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:54:54,459 INFO L93 Difference]: Finished difference Result 191486 states and 758167 transitions. [2019-12-18 16:54:54,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 16:54:54,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 16:54:54,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:54:54,968 INFO L225 Difference]: With dead ends: 191486 [2019-12-18 16:54:54,968 INFO L226 Difference]: Without dead ends: 191267 [2019-12-18 16:54:54,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:55:04,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191267 states. [2019-12-18 16:55:07,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191267 to 152009. [2019-12-18 16:55:07,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152009 states. [2019-12-18 16:55:08,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152009 states to 152009 states and 614599 transitions. [2019-12-18 16:55:08,290 INFO L78 Accepts]: Start accepts. Automaton has 152009 states and 614599 transitions. Word has length 19 [2019-12-18 16:55:08,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:55:08,290 INFO L462 AbstractCegarLoop]: Abstraction has 152009 states and 614599 transitions. [2019-12-18 16:55:08,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:55:08,290 INFO L276 IsEmpty]: Start isEmpty. Operand 152009 states and 614599 transitions. [2019-12-18 16:55:08,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 16:55:08,305 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:55:08,306 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:55:08,306 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:55:08,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:55:08,306 INFO L82 PathProgramCache]: Analyzing trace with hash 422869821, now seen corresponding path program 1 times [2019-12-18 16:55:08,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:55:08,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992553350] [2019-12-18 16:55:08,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:55:08,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:55:08,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:55:08,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992553350] [2019-12-18 16:55:08,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:55:08,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:55:08,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565424803] [2019-12-18 16:55:08,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:55:08,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:55:08,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:55:08,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:55:08,370 INFO L87 Difference]: Start difference. First operand 152009 states and 614599 transitions. Second operand 4 states. [2019-12-18 16:55:08,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:55:08,547 INFO L93 Difference]: Finished difference Result 37859 states and 130356 transitions. [2019-12-18 16:55:08,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:55:08,547 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-18 16:55:08,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:55:08,599 INFO L225 Difference]: With dead ends: 37859 [2019-12-18 16:55:08,600 INFO L226 Difference]: Without dead ends: 29780 [2019-12-18 16:55:08,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:55:08,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29780 states. [2019-12-18 16:55:09,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29780 to 29780. [2019-12-18 16:55:09,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29780 states. [2019-12-18 16:55:09,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29780 states to 29780 states and 97851 transitions. [2019-12-18 16:55:09,123 INFO L78 Accepts]: Start accepts. Automaton has 29780 states and 97851 transitions. Word has length 19 [2019-12-18 16:55:09,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:55:09,123 INFO L462 AbstractCegarLoop]: Abstraction has 29780 states and 97851 transitions. [2019-12-18 16:55:09,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:55:09,124 INFO L276 IsEmpty]: Start isEmpty. Operand 29780 states and 97851 transitions. [2019-12-18 16:55:09,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 16:55:09,130 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:55:09,130 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:55:09,130 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:55:09,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:55:09,131 INFO L82 PathProgramCache]: Analyzing trace with hash -532738305, now seen corresponding path program 1 times [2019-12-18 16:55:09,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:55:09,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31044979] [2019-12-18 16:55:09,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:55:09,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:55:09,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-18 16:55:09,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31044979] [2019-12-18 16:55:09,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:55:09,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:55:09,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518362109] [2019-12-18 16:55:09,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:55:09,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:55:09,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:55:09,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:55:09,180 INFO L87 Difference]: Start difference. First operand 29780 states and 97851 transitions. Second operand 5 states. [2019-12-18 16:55:10,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:55:10,630 INFO L93 Difference]: Finished difference Result 39465 states and 127242 transitions. [2019-12-18 16:55:10,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 16:55:10,630 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 16:55:10,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:55:10,697 INFO L225 Difference]: With dead ends: 39465 [2019-12-18 16:55:10,697 INFO L226 Difference]: Without dead ends: 39274 [2019-12-18 16:55:10,697 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-18 16:55:10,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39274 states. [2019-12-18 16:55:11,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39274 to 30971. [2019-12-18 16:55:11,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30971 states. [2019-12-18 16:55:11,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30971 states to 30971 states and 101410 transitions. [2019-12-18 16:55:11,297 INFO L78 Accepts]: Start accepts. Automaton has 30971 states and 101410 transitions. Word has length 22 [2019-12-18 16:55:11,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:55:11,298 INFO L462 AbstractCegarLoop]: Abstraction has 30971 states and 101410 transitions. [2019-12-18 16:55:11,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:55:11,298 INFO L276 IsEmpty]: Start isEmpty. Operand 30971 states and 101410 transitions. [2019-12-18 16:55:11,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 16:55:11,305 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:55:11,305 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:55:11,305 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:55:11,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:55:11,305 INFO L82 PathProgramCache]: Analyzing trace with hash 828372869, now seen corresponding path program 1 times [2019-12-18 16:55:11,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:55:11,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521491863] [2019-12-18 16:55:11,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:55:11,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:55:11,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:55:11,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521491863] [2019-12-18 16:55:11,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:55:11,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:55:11,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762912196] [2019-12-18 16:55:11,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:55:11,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:55:11,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:55:11,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:55:11,370 INFO L87 Difference]: Start difference. First operand 30971 states and 101410 transitions. Second operand 5 states. [2019-12-18 16:55:11,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:55:11,833 INFO L93 Difference]: Finished difference Result 39564 states and 127608 transitions. [2019-12-18 16:55:11,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 16:55:11,833 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 16:55:11,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:55:11,896 INFO L225 Difference]: With dead ends: 39564 [2019-12-18 16:55:11,896 INFO L226 Difference]: Without dead ends: 39295 [2019-12-18 16:55:11,897 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-18 16:55:12,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39295 states. [2019-12-18 16:55:14,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39295 to 29549. [2019-12-18 16:55:14,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29549 states. [2019-12-18 16:55:14,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29549 states to 29549 states and 96955 transitions. [2019-12-18 16:55:14,106 INFO L78 Accepts]: Start accepts. Automaton has 29549 states and 96955 transitions. Word has length 22 [2019-12-18 16:55:14,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:55:14,106 INFO L462 AbstractCegarLoop]: Abstraction has 29549 states and 96955 transitions. [2019-12-18 16:55:14,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:55:14,106 INFO L276 IsEmpty]: Start isEmpty. Operand 29549 states and 96955 transitions. [2019-12-18 16:55:14,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 16:55:14,121 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:55:14,121 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:55:14,121 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:55:14,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:55:14,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1106278827, now seen corresponding path program 1 times [2019-12-18 16:55:14,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:55:14,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788255636] [2019-12-18 16:55:14,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:55:14,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:55:14,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:55:14,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788255636] [2019-12-18 16:55:14,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:55:14,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:55:14,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391132019] [2019-12-18 16:55:14,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:55:14,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:55:14,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:55:14,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:55:14,184 INFO L87 Difference]: Start difference. First operand 29549 states and 96955 transitions. Second operand 5 states. [2019-12-18 16:55:14,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:55:14,587 INFO L93 Difference]: Finished difference Result 40243 states and 130195 transitions. [2019-12-18 16:55:14,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 16:55:14,588 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 16:55:14,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:55:14,653 INFO L225 Difference]: With dead ends: 40243 [2019-12-18 16:55:14,653 INFO L226 Difference]: Without dead ends: 40219 [2019-12-18 16:55:14,654 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-18 16:55:14,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40219 states. [2019-12-18 16:55:15,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40219 to 32671. [2019-12-18 16:55:15,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32671 states. [2019-12-18 16:55:15,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32671 states to 32671 states and 106843 transitions. [2019-12-18 16:55:15,272 INFO L78 Accepts]: Start accepts. Automaton has 32671 states and 106843 transitions. Word has length 28 [2019-12-18 16:55:15,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:55:15,273 INFO L462 AbstractCegarLoop]: Abstraction has 32671 states and 106843 transitions. [2019-12-18 16:55:15,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:55:15,273 INFO L276 IsEmpty]: Start isEmpty. Operand 32671 states and 106843 transitions. [2019-12-18 16:55:15,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 16:55:15,292 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:55:15,292 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-18 16:55:15,292 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:55:15,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:55:15,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1126449648, now seen corresponding path program 1 times [2019-12-18 16:55:15,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:55:15,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346669214] [2019-12-18 16:55:15,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:55:15,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:55:15,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:55:15,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346669214] [2019-12-18 16:55:15,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:55:15,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:55:15,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396791348] [2019-12-18 16:55:15,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:55:15,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:55:15,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:55:15,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:55:15,353 INFO L87 Difference]: Start difference. First operand 32671 states and 106843 transitions. Second operand 5 states. [2019-12-18 16:55:16,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:55:16,076 INFO L93 Difference]: Finished difference Result 41985 states and 135178 transitions. [2019-12-18 16:55:16,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 16:55:16,077 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-18 16:55:16,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:55:16,144 INFO L225 Difference]: With dead ends: 41985 [2019-12-18 16:55:16,144 INFO L226 Difference]: Without dead ends: 41961 [2019-12-18 16:55:16,144 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-18 16:55:16,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41961 states. [2019-12-18 16:55:16,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41961 to 32060. [2019-12-18 16:55:16,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32060 states. [2019-12-18 16:55:16,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32060 states to 32060 states and 104673 transitions. [2019-12-18 16:55:16,752 INFO L78 Accepts]: Start accepts. Automaton has 32060 states and 104673 transitions. Word has length 29 [2019-12-18 16:55:16,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:55:16,753 INFO L462 AbstractCegarLoop]: Abstraction has 32060 states and 104673 transitions. [2019-12-18 16:55:16,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:55:16,753 INFO L276 IsEmpty]: Start isEmpty. Operand 32060 states and 104673 transitions. [2019-12-18 16:55:16,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 16:55:16,771 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:55:16,771 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-18 16:55:16,771 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:55:16,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:55:16,772 INFO L82 PathProgramCache]: Analyzing trace with hash -14540022, now seen corresponding path program 1 times [2019-12-18 16:55:16,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:55:16,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644298698] [2019-12-18 16:55:16,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:55:16,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:55:16,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:55:16,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644298698] [2019-12-18 16:55:16,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:55:16,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:55:16,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124131593] [2019-12-18 16:55:16,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:55:16,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:55:16,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:55:16,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:55:16,853 INFO L87 Difference]: Start difference. First operand 32060 states and 104673 transitions. Second operand 5 states. [2019-12-18 16:55:16,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:55:16,976 INFO L93 Difference]: Finished difference Result 13714 states and 42374 transitions. [2019-12-18 16:55:16,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:55:16,977 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-18 16:55:16,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:55:16,998 INFO L225 Difference]: With dead ends: 13714 [2019-12-18 16:55:16,998 INFO L226 Difference]: Without dead ends: 11900 [2019-12-18 16:55:16,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:55:17,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11900 states. [2019-12-18 16:55:17,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11900 to 11593. [2019-12-18 16:55:17,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11593 states. [2019-12-18 16:55:17,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11593 states to 11593 states and 35673 transitions. [2019-12-18 16:55:17,182 INFO L78 Accepts]: Start accepts. Automaton has 11593 states and 35673 transitions. Word has length 30 [2019-12-18 16:55:17,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:55:17,182 INFO L462 AbstractCegarLoop]: Abstraction has 11593 states and 35673 transitions. [2019-12-18 16:55:17,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:55:17,182 INFO L276 IsEmpty]: Start isEmpty. Operand 11593 states and 35673 transitions. [2019-12-18 16:55:17,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 16:55:17,196 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:55:17,196 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:55:17,196 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:55:17,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:55:17,196 INFO L82 PathProgramCache]: Analyzing trace with hash -761398124, now seen corresponding path program 1 times [2019-12-18 16:55:17,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:55:17,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966242231] [2019-12-18 16:55:17,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:55:17,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:55:17,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:55:17,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966242231] [2019-12-18 16:55:17,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:55:17,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:55:17,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645438982] [2019-12-18 16:55:17,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:55:17,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:55:17,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:55:17,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:55:17,287 INFO L87 Difference]: Start difference. First operand 11593 states and 35673 transitions. Second operand 6 states. [2019-12-18 16:55:17,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:55:17,862 INFO L93 Difference]: Finished difference Result 14689 states and 43755 transitions. [2019-12-18 16:55:17,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 16:55:17,862 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-18 16:55:17,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:55:17,889 INFO L225 Difference]: With dead ends: 14689 [2019-12-18 16:55:17,890 INFO L226 Difference]: Without dead ends: 14687 [2019-12-18 16:55:17,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-12-18 16:55:17,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14687 states. [2019-12-18 16:55:18,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14687 to 11869. [2019-12-18 16:55:18,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11869 states. [2019-12-18 16:55:18,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11869 states to 11869 states and 36412 transitions. [2019-12-18 16:55:18,130 INFO L78 Accepts]: Start accepts. Automaton has 11869 states and 36412 transitions. Word has length 40 [2019-12-18 16:55:18,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:55:18,131 INFO L462 AbstractCegarLoop]: Abstraction has 11869 states and 36412 transitions. [2019-12-18 16:55:18,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:55:18,131 INFO L276 IsEmpty]: Start isEmpty. Operand 11869 states and 36412 transitions. [2019-12-18 16:55:18,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 16:55:18,143 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:55:18,143 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:55:18,144 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:55:18,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:55:18,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1633369453, now seen corresponding path program 1 times [2019-12-18 16:55:18,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:55:18,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500172704] [2019-12-18 16:55:18,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:55:18,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:55:18,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:55:18,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500172704] [2019-12-18 16:55:18,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:55:18,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 16:55:18,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462545956] [2019-12-18 16:55:18,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:55:18,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:55:18,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:55:18,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:55:18,436 INFO L87 Difference]: Start difference. First operand 11869 states and 36412 transitions. Second operand 5 states. [2019-12-18 16:55:18,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:55:18,970 INFO L93 Difference]: Finished difference Result 18223 states and 55480 transitions. [2019-12-18 16:55:18,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 16:55:18,970 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 16:55:18,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:55:18,997 INFO L225 Difference]: With dead ends: 18223 [2019-12-18 16:55:18,997 INFO L226 Difference]: Without dead ends: 18223 [2019-12-18 16:55:18,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:55:19,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18223 states. [2019-12-18 16:55:19,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18223 to 15984. [2019-12-18 16:55:19,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15984 states. [2019-12-18 16:55:19,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15984 states to 15984 states and 49182 transitions. [2019-12-18 16:55:19,257 INFO L78 Accepts]: Start accepts. Automaton has 15984 states and 49182 transitions. Word has length 40 [2019-12-18 16:55:19,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:55:19,258 INFO L462 AbstractCegarLoop]: Abstraction has 15984 states and 49182 transitions. [2019-12-18 16:55:19,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:55:19,258 INFO L276 IsEmpty]: Start isEmpty. Operand 15984 states and 49182 transitions. [2019-12-18 16:55:19,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 16:55:19,281 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:55:19,281 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:55:19,281 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:55:19,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:55:19,282 INFO L82 PathProgramCache]: Analyzing trace with hash -308441065, now seen corresponding path program 2 times [2019-12-18 16:55:19,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:55:19,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784797676] [2019-12-18 16:55:19,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:55:19,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:55:19,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:55:19,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784797676] [2019-12-18 16:55:19,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:55:19,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:55:19,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681707959] [2019-12-18 16:55:19,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:55:19,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:55:19,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:55:19,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:55:19,331 INFO L87 Difference]: Start difference. First operand 15984 states and 49182 transitions. Second operand 3 states. [2019-12-18 16:55:19,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:55:19,402 INFO L93 Difference]: Finished difference Result 15143 states and 45952 transitions. [2019-12-18 16:55:19,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:55:19,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 16:55:19,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:55:19,440 INFO L225 Difference]: With dead ends: 15143 [2019-12-18 16:55:19,440 INFO L226 Difference]: Without dead ends: 15143 [2019-12-18 16:55:19,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:55:19,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15143 states. [2019-12-18 16:55:19,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15143 to 14516. [2019-12-18 16:55:19,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14516 states. [2019-12-18 16:55:19,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14516 states to 14516 states and 44169 transitions. [2019-12-18 16:55:19,860 INFO L78 Accepts]: Start accepts. Automaton has 14516 states and 44169 transitions. Word has length 40 [2019-12-18 16:55:19,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:55:19,861 INFO L462 AbstractCegarLoop]: Abstraction has 14516 states and 44169 transitions. [2019-12-18 16:55:19,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:55:19,861 INFO L276 IsEmpty]: Start isEmpty. Operand 14516 states and 44169 transitions. [2019-12-18 16:55:19,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 16:55:19,892 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:55:19,892 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:55:19,893 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:55:19,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:55:19,893 INFO L82 PathProgramCache]: Analyzing trace with hash 797278347, now seen corresponding path program 1 times [2019-12-18 16:55:19,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:55:19,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946341378] [2019-12-18 16:55:19,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:55:19,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:55:19,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:55:19,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946341378] [2019-12-18 16:55:19,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:55:19,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:55:19,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491475930] [2019-12-18 16:55:19,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:55:19,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:55:19,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:55:19,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:55:19,975 INFO L87 Difference]: Start difference. First operand 14516 states and 44169 transitions. Second operand 6 states. [2019-12-18 16:55:20,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:55:20,451 INFO L93 Difference]: Finished difference Result 17222 states and 51134 transitions. [2019-12-18 16:55:20,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 16:55:20,451 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 16:55:20,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:55:20,476 INFO L225 Difference]: With dead ends: 17222 [2019-12-18 16:55:20,476 INFO L226 Difference]: Without dead ends: 17220 [2019-12-18 16:55:20,476 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-18 16:55:20,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17220 states. [2019-12-18 16:55:20,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17220 to 13885. [2019-12-18 16:55:20,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13885 states. [2019-12-18 16:55:20,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13885 states to 13885 states and 42429 transitions. [2019-12-18 16:55:20,695 INFO L78 Accepts]: Start accepts. Automaton has 13885 states and 42429 transitions. Word has length 41 [2019-12-18 16:55:20,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:55:20,696 INFO L462 AbstractCegarLoop]: Abstraction has 13885 states and 42429 transitions. [2019-12-18 16:55:20,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:55:20,696 INFO L276 IsEmpty]: Start isEmpty. Operand 13885 states and 42429 transitions. [2019-12-18 16:55:20,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 16:55:20,712 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:55:20,713 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:55:20,713 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:55:20,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:55:20,713 INFO L82 PathProgramCache]: Analyzing trace with hash 771947399, now seen corresponding path program 1 times [2019-12-18 16:55:20,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:55:20,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906129606] [2019-12-18 16:55:20,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:55:20,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:55:20,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:55:20,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906129606] [2019-12-18 16:55:20,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:55:20,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 16:55:20,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189056158] [2019-12-18 16:55:20,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:55:20,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:55:20,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:55:20,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:55:20,802 INFO L87 Difference]: Start difference. First operand 13885 states and 42429 transitions. Second operand 6 states. [2019-12-18 16:55:20,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:55:20,908 INFO L93 Difference]: Finished difference Result 12733 states and 39642 transitions. [2019-12-18 16:55:20,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 16:55:20,908 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 16:55:20,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:55:20,927 INFO L225 Difference]: With dead ends: 12733 [2019-12-18 16:55:20,927 INFO L226 Difference]: Without dead ends: 11550 [2019-12-18 16:55:20,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:55:20,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11550 states. [2019-12-18 16:55:21,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11550 to 11130. [2019-12-18 16:55:21,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11130 states. [2019-12-18 16:55:21,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11130 states to 11130 states and 35538 transitions. [2019-12-18 16:55:21,289 INFO L78 Accepts]: Start accepts. Automaton has 11130 states and 35538 transitions. Word has length 41 [2019-12-18 16:55:21,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:55:21,289 INFO L462 AbstractCegarLoop]: Abstraction has 11130 states and 35538 transitions. [2019-12-18 16:55:21,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:55:21,289 INFO L276 IsEmpty]: Start isEmpty. Operand 11130 states and 35538 transitions. [2019-12-18 16:55:21,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 16:55:21,302 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:55:21,302 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:55:21,302 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-18 16:55:21,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:55:21,302 INFO L82 PathProgramCache]: Analyzing trace with hash 852736153, now seen corresponding path program 1 times [2019-12-18 16:55:21,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:55:21,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597998804] [2019-12-18 16:55:21,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:55:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:55:21,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:55:21,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597998804] [2019-12-18 16:55:21,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:55:21,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:55:21,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774427115] [2019-12-18 16:55:21,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:55:21,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:55:21,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:55:21,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:55:21,357 INFO L87 Difference]: Start difference. First operand 11130 states and 35538 transitions. Second operand 3 states. [2019-12-18 16:55:21,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:55:21,439 INFO L93 Difference]: Finished difference Result 12575 states and 38277 transitions. [2019-12-18 16:55:21,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:55:21,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-18 16:55:21,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:55:21,461 INFO L225 Difference]: With dead ends: 12575 [2019-12-18 16:55:21,461 INFO L226 Difference]: Without dead ends: 12575 [2019-12-18 16:55:21,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:55:21,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12575 states. [2019-12-18 16:55:21,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12575 to 9907. [2019-12-18 16:55:21,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9907 states. [2019-12-18 16:55:21,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9907 states to 9907 states and 30647 transitions. [2019-12-18 16:55:21,717 INFO L78 Accepts]: Start accepts. Automaton has 9907 states and 30647 transitions. Word has length 56 [2019-12-18 16:55:21,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:55:21,717 INFO L462 AbstractCegarLoop]: Abstraction has 9907 states and 30647 transitions. [2019-12-18 16:55:21,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:55:21,717 INFO L276 IsEmpty]: Start isEmpty. Operand 9907 states and 30647 transitions. [2019-12-18 16:55:21,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 16:55:21,733 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:55:21,733 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:55:21,733 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-18 16:55:21,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:55:21,734 INFO L82 PathProgramCache]: Analyzing trace with hash -415784116, now seen corresponding path program 1 times [2019-12-18 16:55:21,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:55:21,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925042196] [2019-12-18 16:55:21,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:55:21,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:55:21,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:55:21,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925042196] [2019-12-18 16:55:21,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:55:21,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:55:21,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99760422] [2019-12-18 16:55:21,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:55:21,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:55:21,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:55:21,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:55:21,801 INFO L87 Difference]: Start difference. First operand 9907 states and 30647 transitions. Second operand 4 states. [2019-12-18 16:55:21,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:55:21,882 INFO L93 Difference]: Finished difference Result 16499 states and 51208 transitions. [2019-12-18 16:55:21,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:55:21,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-18 16:55:21,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:55:21,897 INFO L225 Difference]: With dead ends: 16499 [2019-12-18 16:55:21,897 INFO L226 Difference]: Without dead ends: 6904 [2019-12-18 16:55:21,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:55:21,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6904 states. [2019-12-18 16:55:22,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6904 to 6904. [2019-12-18 16:55:22,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6904 states. [2019-12-18 16:55:22,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6904 states to 6904 states and 21383 transitions. [2019-12-18 16:55:22,062 INFO L78 Accepts]: Start accepts. Automaton has 6904 states and 21383 transitions. Word has length 56 [2019-12-18 16:55:22,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:55:22,063 INFO L462 AbstractCegarLoop]: Abstraction has 6904 states and 21383 transitions. [2019-12-18 16:55:22,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:55:22,063 INFO L276 IsEmpty]: Start isEmpty. Operand 6904 states and 21383 transitions. [2019-12-18 16:55:22,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 16:55:22,074 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:55:22,074 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:55:22,074 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-18 16:55:22,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:55:22,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1395977884, now seen corresponding path program 2 times [2019-12-18 16:55:22,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:55:22,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529100227] [2019-12-18 16:55:22,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:55:22,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:55:22,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:55:22,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529100227] [2019-12-18 16:55:22,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:55:22,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 16:55:22,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985915662] [2019-12-18 16:55:22,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 16:55:22,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:55:22,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 16:55:22,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-18 16:55:22,625 INFO L87 Difference]: Start difference. First operand 6904 states and 21383 transitions. Second operand 15 states. [2019-12-18 16:55:26,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:55:26,488 INFO L93 Difference]: Finished difference Result 14113 states and 43068 transitions. [2019-12-18 16:55:26,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-12-18 16:55:26,488 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-18 16:55:26,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:55:26,509 INFO L225 Difference]: With dead ends: 14113 [2019-12-18 16:55:26,509 INFO L226 Difference]: Without dead ends: 13259 [2019-12-18 16:55:26,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1116 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=538, Invalid=3244, Unknown=0, NotChecked=0, Total=3782 [2019-12-18 16:55:26,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13259 states. [2019-12-18 16:55:26,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13259 to 10861. [2019-12-18 16:55:26,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10861 states. [2019-12-18 16:55:26,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10861 states to 10861 states and 33315 transitions. [2019-12-18 16:55:26,847 INFO L78 Accepts]: Start accepts. Automaton has 10861 states and 33315 transitions. Word has length 56 [2019-12-18 16:55:26,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:55:26,847 INFO L462 AbstractCegarLoop]: Abstraction has 10861 states and 33315 transitions. [2019-12-18 16:55:26,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 16:55:26,847 INFO L276 IsEmpty]: Start isEmpty. Operand 10861 states and 33315 transitions. [2019-12-18 16:55:26,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 16:55:26,858 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:55:26,858 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:55:26,858 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:55:26,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:55:26,858 INFO L82 PathProgramCache]: Analyzing trace with hash 2017615148, now seen corresponding path program 3 times [2019-12-18 16:55:26,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:55:26,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957354525] [2019-12-18 16:55:26,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:55:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:55:27,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:55:27,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957354525] [2019-12-18 16:55:27,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:55:27,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 16:55:27,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751332541] [2019-12-18 16:55:27,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 16:55:27,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:55:27,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 16:55:27,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-18 16:55:27,403 INFO L87 Difference]: Start difference. First operand 10861 states and 33315 transitions. Second operand 15 states. Received shutdown request... [2019-12-18 16:55:29,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-18 16:55:29,724 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-18 16:55:29,731 WARN L227 ceAbstractionStarter]: Timeout [2019-12-18 16:55:29,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 04:55:29 BasicIcfg [2019-12-18 16:55:29,731 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 16:55:29,732 INFO L168 Benchmark]: Toolchain (without parser) took 193812.02 ms. Allocated memory was 147.3 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 102.8 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 989.1 MB. Max. memory is 7.1 GB. [2019-12-18 16:55:29,733 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 147.3 MB. Free memory is still 122.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 16:55:29,733 INFO L168 Benchmark]: CACSL2BoogieTranslator took 806.04 ms. Allocated memory was 147.3 MB in the beginning and 203.9 MB in the end (delta: 56.6 MB). Free memory was 102.4 MB in the beginning and 156.9 MB in the end (delta: -54.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-18 16:55:29,734 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.95 ms. Allocated memory is still 203.9 MB. Free memory was 156.0 MB in the beginning and 154.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 16:55:29,734 INFO L168 Benchmark]: Boogie Preprocessor took 38.43 ms. Allocated memory is still 203.9 MB. Free memory was 154.1 MB in the beginning and 151.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 16:55:29,735 INFO L168 Benchmark]: RCFGBuilder took 783.08 ms. Allocated memory is still 203.9 MB. Free memory was 151.3 MB in the beginning and 105.1 MB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. [2019-12-18 16:55:29,736 INFO L168 Benchmark]: TraceAbstraction took 192119.15 ms. Allocated memory was 203.9 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 104.1 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 933.8 MB. Max. memory is 7.1 GB. [2019-12-18 16:55:29,738 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.46 ms. Allocated memory is still 147.3 MB. Free memory is still 122.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 806.04 ms. Allocated memory was 147.3 MB in the beginning and 203.9 MB in the end (delta: 56.6 MB). Free memory was 102.4 MB in the beginning and 156.9 MB in the end (delta: -54.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.95 ms. Allocated memory is still 203.9 MB. Free memory was 156.0 MB in the beginning and 154.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.43 ms. Allocated memory is still 203.9 MB. Free memory was 154.1 MB in the beginning and 151.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 783.08 ms. Allocated memory is still 203.9 MB. Free memory was 151.3 MB in the beginning and 105.1 MB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 192119.15 ms. Allocated memory was 203.9 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 104.1 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 933.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 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 (10861states) and FLOYD_HOARE automaton (currently 38 states, 15 states before enhancement),while ReachableStatesComputation was computing reachable states (2701 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 (10861states) and FLOYD_HOARE automaton (currently 38 states, 15 states before enhancement),while ReachableStatesComputation was computing reachable states (2701 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: TIMEOUT, OverallTime: 191.9s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 63.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3715 SDtfs, 5165 SDslu, 7689 SDs, 0 SdLazy, 7017 SolverSat, 322 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 247 GetRequests, 31 SyntacticMatches, 19 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1695 ImplicationChecksByTransitivity, 4.5s 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: 107.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 204052 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 724 NumberOfCodeBlocks, 724 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 699 ConstructedInterpolants, 0 QuantifiedInterpolants, 103200 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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