/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe005_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 18:05:54,713 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 18:05:54,715 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 18:05:54,729 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 18:05:54,729 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 18:05:54,730 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 18:05:54,732 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 18:05:54,733 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 18:05:54,735 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 18:05:54,736 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 18:05:54,737 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 18:05:54,738 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 18:05:54,738 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 18:05:54,739 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 18:05:54,740 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 18:05:54,741 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 18:05:54,742 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 18:05:54,743 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 18:05:54,745 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 18:05:54,747 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 18:05:54,749 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 18:05:54,750 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 18:05:54,751 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 18:05:54,752 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 18:05:54,754 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 18:05:54,754 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 18:05:54,754 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 18:05:54,755 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 18:05:54,756 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 18:05:54,757 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 18:05:54,757 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 18:05:54,758 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 18:05:54,758 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 18:05:54,759 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 18:05:54,761 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 18:05:54,762 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 18:05:54,762 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 18:05:54,763 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 18:05:54,763 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 18:05:54,766 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 18:05:54,767 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 18:05:54,767 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 18:05:54,793 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 18:05:54,793 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 18:05:54,795 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 18:05:54,795 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 18:05:54,795 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 18:05:54,796 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 18:05:54,796 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 18:05:54,796 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 18:05:54,796 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 18:05:54,796 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 18:05:54,797 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 18:05:54,797 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 18:05:54,797 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 18:05:54,797 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 18:05:54,797 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 18:05:54,798 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 18:05:54,798 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 18:05:54,798 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 18:05:54,798 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 18:05:54,799 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 18:05:54,799 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 18:05:54,799 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:05:54,799 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 18:05:54,799 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 18:05:54,800 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 18:05:54,800 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 18:05:54,800 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 18:05:54,800 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 18:05:54,800 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 18:05:54,801 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 18:05:54,801 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 18:05:55,080 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 18:05:55,096 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 18:05:55,100 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 18:05:55,101 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 18:05:55,102 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 18:05:55,103 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe005_power.opt.i [2019-12-27 18:05:55,156 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cae073661/da8dac2fc358432882603e8adbb26276/FLAGd7f40dd3f [2019-12-27 18:05:55,732 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 18:05:55,732 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe005_power.opt.i [2019-12-27 18:05:55,756 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cae073661/da8dac2fc358432882603e8adbb26276/FLAGd7f40dd3f [2019-12-27 18:05:56,042 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cae073661/da8dac2fc358432882603e8adbb26276 [2019-12-27 18:05:56,050 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 18:05:56,052 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 18:05:56,052 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 18:05:56,053 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 18:05:56,056 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 18:05:56,057 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:05:56" (1/1) ... [2019-12-27 18:05:56,060 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@580b0a8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:05:56, skipping insertion in model container [2019-12-27 18:05:56,060 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:05:56" (1/1) ... [2019-12-27 18:05:56,069 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 18:05:56,138 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 18:05:56,681 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:05:56,699 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 18:05:56,762 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:05:56,833 INFO L208 MainTranslator]: Completed translation [2019-12-27 18:05:56,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:05:56 WrapperNode [2019-12-27 18:05:56,834 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 18:05:56,835 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 18:05:56,835 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 18:05:56,835 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 18:05:56,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:05:56" (1/1) ... [2019-12-27 18:05:56,866 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:05:56" (1/1) ... [2019-12-27 18:05:56,906 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 18:05:56,907 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 18:05:56,907 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 18:05:56,907 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 18:05:56,916 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:05:56" (1/1) ... [2019-12-27 18:05:56,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:05:56" (1/1) ... [2019-12-27 18:05:56,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:05:56" (1/1) ... [2019-12-27 18:05:56,922 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:05:56" (1/1) ... [2019-12-27 18:05:56,932 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:05:56" (1/1) ... [2019-12-27 18:05:56,936 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:05:56" (1/1) ... [2019-12-27 18:05:56,940 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:05:56" (1/1) ... [2019-12-27 18:05:56,946 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 18:05:56,946 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 18:05:56,946 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 18:05:56,947 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 18:05:56,948 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:05:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:05:57,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 18:05:57,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 18:05:57,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 18:05:57,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 18:05:57,042 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 18:05:57,043 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 18:05:57,043 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 18:05:57,044 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 18:05:57,044 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 18:05:57,045 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 18:05:57,045 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 18:05:57,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 18:05:57,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 18:05:57,047 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 18:05:57,856 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 18:05:57,856 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 18:05:57,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:05:57 BoogieIcfgContainer [2019-12-27 18:05:57,858 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 18:05:57,860 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 18:05:57,860 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 18:05:57,863 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 18:05:57,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:05:56" (1/3) ... [2019-12-27 18:05:57,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b0437ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:05:57, skipping insertion in model container [2019-12-27 18:05:57,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:05:56" (2/3) ... [2019-12-27 18:05:57,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b0437ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:05:57, skipping insertion in model container [2019-12-27 18:05:57,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:05:57" (3/3) ... [2019-12-27 18:05:57,867 INFO L109 eAbstractionObserver]: Analyzing ICFG safe005_power.opt.i [2019-12-27 18:05:57,876 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 18:05:57,876 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 18:05:57,883 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 18:05:57,885 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 18:05:57,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,926 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,927 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,976 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,976 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,977 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,977 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,977 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,984 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,984 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,992 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,993 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,993 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,998 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,998 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:57,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:58,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:58,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:58,002 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:58,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:58,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:58,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:58,003 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:58,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:58,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:58,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:58,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:58,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:58,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:58,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:58,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:58,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:58,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:58,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:58,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:58,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:58,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:58,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:58,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:58,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:58,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:58,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:58,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:05:58,021 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 18:05:58,042 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:05:58,042 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:05:58,042 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:05:58,042 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:05:58,042 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:05:58,043 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:05:58,043 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:05:58,043 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:05:58,060 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-27 18:05:58,062 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 18:05:58,159 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 18:05:58,159 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:05:58,177 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 452 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 18:05:58,202 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 18:05:58,279 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 18:05:58,280 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:05:58,293 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 452 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 18:05:58,317 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 18:05:58,318 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:06:03,958 WARN L192 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 18:06:04,073 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 18:06:04,200 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66367 [2019-12-27 18:06:04,201 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-27 18:06:04,205 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-27 18:06:15,440 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 86132 states. [2019-12-27 18:06:15,442 INFO L276 IsEmpty]: Start isEmpty. Operand 86132 states. [2019-12-27 18:06:15,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 18:06:15,449 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:06:15,450 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 18:06:15,450 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:06:15,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:06:15,457 INFO L82 PathProgramCache]: Analyzing trace with hash 795562213, now seen corresponding path program 1 times [2019-12-27 18:06:15,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:06:15,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565330629] [2019-12-27 18:06:15,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:06:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:06:15,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:06:15,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565330629] [2019-12-27 18:06:15,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:06:15,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:06:15,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1259924246] [2019-12-27 18:06:15,710 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:06:15,714 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:06:15,728 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 18:06:15,728 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:06:15,732 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:06:15,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:06:15,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:06:15,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:06:15,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:06:15,751 INFO L87 Difference]: Start difference. First operand 86132 states. Second operand 3 states. [2019-12-27 18:06:18,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:06:18,090 INFO L93 Difference]: Finished difference Result 85012 states and 367904 transitions. [2019-12-27 18:06:18,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:06:18,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 18:06:18,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:06:18,703 INFO L225 Difference]: With dead ends: 85012 [2019-12-27 18:06:18,704 INFO L226 Difference]: Without dead ends: 80140 [2019-12-27 18:06:18,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:06:23,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80140 states. [2019-12-27 18:06:25,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80140 to 80140. [2019-12-27 18:06:25,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80140 states. [2019-12-27 18:06:26,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80140 states to 80140 states and 346330 transitions. [2019-12-27 18:06:26,595 INFO L78 Accepts]: Start accepts. Automaton has 80140 states and 346330 transitions. Word has length 5 [2019-12-27 18:06:26,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:06:26,595 INFO L462 AbstractCegarLoop]: Abstraction has 80140 states and 346330 transitions. [2019-12-27 18:06:26,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:06:26,595 INFO L276 IsEmpty]: Start isEmpty. Operand 80140 states and 346330 transitions. [2019-12-27 18:06:26,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:06:26,604 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:06:26,604 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:06:26,604 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:06:26,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:06:26,605 INFO L82 PathProgramCache]: Analyzing trace with hash -36571135, now seen corresponding path program 1 times [2019-12-27 18:06:26,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:06:26,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705025229] [2019-12-27 18:06:26,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:06:26,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:06:26,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:06:26,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705025229] [2019-12-27 18:06:26,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:06:26,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:06:26,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1466245446] [2019-12-27 18:06:26,713 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:06:26,715 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:06:26,718 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:06:26,718 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:06:26,719 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:06:26,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:06:26,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:06:26,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:06:26,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:06:26,721 INFO L87 Difference]: Start difference. First operand 80140 states and 346330 transitions. Second operand 4 states. [2019-12-27 18:06:31,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:06:31,544 INFO L93 Difference]: Finished difference Result 123388 states and 510822 transitions. [2019-12-27 18:06:31,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:06:31,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 18:06:31,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:06:32,211 INFO L225 Difference]: With dead ends: 123388 [2019-12-27 18:06:32,212 INFO L226 Difference]: Without dead ends: 123290 [2019-12-27 18:06:32,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:06:35,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123290 states. [2019-12-27 18:06:37,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123290 to 114218. [2019-12-27 18:06:37,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114218 states. [2019-12-27 18:06:42,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114218 states to 114218 states and 477794 transitions. [2019-12-27 18:06:42,983 INFO L78 Accepts]: Start accepts. Automaton has 114218 states and 477794 transitions. Word has length 13 [2019-12-27 18:06:42,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:06:42,984 INFO L462 AbstractCegarLoop]: Abstraction has 114218 states and 477794 transitions. [2019-12-27 18:06:42,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:06:42,984 INFO L276 IsEmpty]: Start isEmpty. Operand 114218 states and 477794 transitions. [2019-12-27 18:06:42,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:06:42,988 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:06:42,988 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:06:42,988 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:06:42,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:06:42,989 INFO L82 PathProgramCache]: Analyzing trace with hash 424299118, now seen corresponding path program 1 times [2019-12-27 18:06:42,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:06:42,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245587267] [2019-12-27 18:06:42,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:06:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:06:43,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:06:43,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245587267] [2019-12-27 18:06:43,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:06:43,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:06:43,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1841446622] [2019-12-27 18:06:43,092 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:06:43,094 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:06:43,097 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:06:43,097 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:06:43,097 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:06:43,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:06:43,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:06:43,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:06:43,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:06:43,098 INFO L87 Difference]: Start difference. First operand 114218 states and 477794 transitions. Second operand 4 states. [2019-12-27 18:06:45,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:06:45,183 INFO L93 Difference]: Finished difference Result 159677 states and 652290 transitions. [2019-12-27 18:06:45,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:06:45,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 18:06:45,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:06:45,677 INFO L225 Difference]: With dead ends: 159677 [2019-12-27 18:06:45,678 INFO L226 Difference]: Without dead ends: 159565 [2019-12-27 18:06:45,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:06:53,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159565 states. [2019-12-27 18:06:56,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159565 to 136035. [2019-12-27 18:06:56,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136035 states. [2019-12-27 18:06:57,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136035 states to 136035 states and 564894 transitions. [2019-12-27 18:06:57,370 INFO L78 Accepts]: Start accepts. Automaton has 136035 states and 564894 transitions. Word has length 13 [2019-12-27 18:06:57,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:06:57,370 INFO L462 AbstractCegarLoop]: Abstraction has 136035 states and 564894 transitions. [2019-12-27 18:06:57,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:06:57,371 INFO L276 IsEmpty]: Start isEmpty. Operand 136035 states and 564894 transitions. [2019-12-27 18:06:57,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 18:06:57,375 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:06:57,375 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:06:57,375 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:06:57,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:06:57,376 INFO L82 PathProgramCache]: Analyzing trace with hash -2100241523, now seen corresponding path program 1 times [2019-12-27 18:06:57,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:06:57,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142266113] [2019-12-27 18:06:57,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:06:57,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:06:57,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:06:57,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142266113] [2019-12-27 18:06:57,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:06:57,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:06:57,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1935625663] [2019-12-27 18:06:57,454 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:06:57,456 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:06:57,459 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 18:06:57,460 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:06:57,510 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:06:57,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:06:57,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:06:57,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:06:57,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:06:57,511 INFO L87 Difference]: Start difference. First operand 136035 states and 564894 transitions. Second operand 5 states. [2019-12-27 18:06:58,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:06:58,556 INFO L93 Difference]: Finished difference Result 181618 states and 742473 transitions. [2019-12-27 18:06:58,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:06:58,556 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 18:06:58,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:07:05,005 INFO L225 Difference]: With dead ends: 181618 [2019-12-27 18:07:05,006 INFO L226 Difference]: Without dead ends: 181618 [2019-12-27 18:07:05,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:07:09,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181618 states. [2019-12-27 18:07:11,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181618 to 152081. [2019-12-27 18:07:11,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152081 states. [2019-12-27 18:07:12,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152081 states to 152081 states and 628919 transitions. [2019-12-27 18:07:12,994 INFO L78 Accepts]: Start accepts. Automaton has 152081 states and 628919 transitions. Word has length 14 [2019-12-27 18:07:12,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:07:12,994 INFO L462 AbstractCegarLoop]: Abstraction has 152081 states and 628919 transitions. [2019-12-27 18:07:12,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:07:12,995 INFO L276 IsEmpty]: Start isEmpty. Operand 152081 states and 628919 transitions. [2019-12-27 18:07:12,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 18:07:12,998 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:07:12,998 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:07:12,999 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:07:12,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:07:12,999 INFO L82 PathProgramCache]: Analyzing trace with hash -2100376187, now seen corresponding path program 1 times [2019-12-27 18:07:13,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:07:13,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069164455] [2019-12-27 18:07:13,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:07:13,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:07:13,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:07:13,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069164455] [2019-12-27 18:07:13,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:07:13,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:07:13,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [492561797] [2019-12-27 18:07:13,078 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:07:13,080 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:07:13,084 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 18:07:13,084 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:07:13,101 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:07:13,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:07:13,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:07:13,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:07:13,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:07:13,102 INFO L87 Difference]: Start difference. First operand 152081 states and 628919 transitions. Second operand 5 states. [2019-12-27 18:07:15,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:07:15,555 INFO L93 Difference]: Finished difference Result 179622 states and 732719 transitions. [2019-12-27 18:07:15,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:07:15,555 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 18:07:15,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:07:16,079 INFO L225 Difference]: With dead ends: 179622 [2019-12-27 18:07:16,079 INFO L226 Difference]: Without dead ends: 179542 [2019-12-27 18:07:16,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:07:21,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179542 states. [2019-12-27 18:07:29,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179542 to 157787. [2019-12-27 18:07:29,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157787 states. [2019-12-27 18:07:31,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157787 states to 157787 states and 651479 transitions. [2019-12-27 18:07:31,426 INFO L78 Accepts]: Start accepts. Automaton has 157787 states and 651479 transitions. Word has length 14 [2019-12-27 18:07:31,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:07:31,426 INFO L462 AbstractCegarLoop]: Abstraction has 157787 states and 651479 transitions. [2019-12-27 18:07:31,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:07:31,427 INFO L276 IsEmpty]: Start isEmpty. Operand 157787 states and 651479 transitions. [2019-12-27 18:07:31,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 18:07:31,429 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:07:31,429 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:07:31,430 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:07:31,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:07:31,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1940234062, now seen corresponding path program 1 times [2019-12-27 18:07:31,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:07:31,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645621942] [2019-12-27 18:07:31,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:07:31,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:07:31,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:07:31,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645621942] [2019-12-27 18:07:31,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:07:31,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:07:31,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1700590887] [2019-12-27 18:07:31,524 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:07:31,527 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:07:31,530 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 18:07:31,531 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:07:31,552 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:07:31,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:07:31,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:07:31,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:07:31,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:07:31,553 INFO L87 Difference]: Start difference. First operand 157787 states and 651479 transitions. Second operand 5 states. [2019-12-27 18:07:32,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:07:32,798 INFO L93 Difference]: Finished difference Result 189091 states and 772001 transitions. [2019-12-27 18:07:32,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:07:32,799 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 18:07:32,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:07:39,892 INFO L225 Difference]: With dead ends: 189091 [2019-12-27 18:07:39,892 INFO L226 Difference]: Without dead ends: 188995 [2019-12-27 18:07:39,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:07:43,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188995 states. [2019-12-27 18:07:47,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188995 to 161868. [2019-12-27 18:07:47,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161868 states. [2019-12-27 18:07:47,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161868 states to 161868 states and 668265 transitions. [2019-12-27 18:07:47,703 INFO L78 Accepts]: Start accepts. Automaton has 161868 states and 668265 transitions. Word has length 14 [2019-12-27 18:07:47,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:07:47,704 INFO L462 AbstractCegarLoop]: Abstraction has 161868 states and 668265 transitions. [2019-12-27 18:07:47,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:07:47,704 INFO L276 IsEmpty]: Start isEmpty. Operand 161868 states and 668265 transitions. [2019-12-27 18:07:47,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 18:07:47,723 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:07:47,723 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:07:47,723 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:07:47,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:07:47,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1828891691, now seen corresponding path program 1 times [2019-12-27 18:07:47,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:07:47,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140970620] [2019-12-27 18:07:47,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:07:47,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:07:47,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:07:47,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140970620] [2019-12-27 18:07:47,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:07:47,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:07:47,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [184830441] [2019-12-27 18:07:47,801 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:07:47,802 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:07:47,804 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 24 transitions. [2019-12-27 18:07:47,805 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:07:47,805 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:07:47,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:07:47,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:07:47,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:07:47,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:07:47,806 INFO L87 Difference]: Start difference. First operand 161868 states and 668265 transitions. Second operand 3 states. [2019-12-27 18:07:49,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:07:49,758 INFO L93 Difference]: Finished difference Result 160940 states and 664422 transitions. [2019-12-27 18:07:49,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:07:49,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 18:07:49,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:07:50,225 INFO L225 Difference]: With dead ends: 160940 [2019-12-27 18:07:50,225 INFO L226 Difference]: Without dead ends: 160940 [2019-12-27 18:07:50,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:08:00,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160940 states. [2019-12-27 18:08:02,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160940 to 160940. [2019-12-27 18:08:02,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160940 states. [2019-12-27 18:08:03,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160940 states to 160940 states and 664422 transitions. [2019-12-27 18:08:03,994 INFO L78 Accepts]: Start accepts. Automaton has 160940 states and 664422 transitions. Word has length 18 [2019-12-27 18:08:03,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:03,994 INFO L462 AbstractCegarLoop]: Abstraction has 160940 states and 664422 transitions. [2019-12-27 18:08:03,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:08:03,994 INFO L276 IsEmpty]: Start isEmpty. Operand 160940 states and 664422 transitions. [2019-12-27 18:08:04,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:08:04,014 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:04,014 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:08:04,014 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:08:04,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:04,015 INFO L82 PathProgramCache]: Analyzing trace with hash 2025528817, now seen corresponding path program 1 times [2019-12-27 18:08:04,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:04,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231014064] [2019-12-27 18:08:04,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:04,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:04,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:08:04,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231014064] [2019-12-27 18:08:04,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:04,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:08:04,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [113505222] [2019-12-27 18:08:04,059 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:04,061 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:04,066 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 50 transitions. [2019-12-27 18:08:04,066 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:04,078 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:08:04,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:08:04,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:04,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:08:04,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:08:04,079 INFO L87 Difference]: Start difference. First operand 160940 states and 664422 transitions. Second operand 5 states. [2019-12-27 18:08:12,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:12,386 INFO L93 Difference]: Finished difference Result 383501 states and 1595297 transitions. [2019-12-27 18:08:12,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:08:12,386 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 18:08:12,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:13,938 INFO L225 Difference]: With dead ends: 383501 [2019-12-27 18:08:13,939 INFO L226 Difference]: Without dead ends: 256533 [2019-12-27 18:08:13,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:08:23,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256533 states. [2019-12-27 18:08:26,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256533 to 171713. [2019-12-27 18:08:26,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171713 states. [2019-12-27 18:08:28,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171713 states to 171713 states and 702115 transitions. [2019-12-27 18:08:28,329 INFO L78 Accepts]: Start accepts. Automaton has 171713 states and 702115 transitions. Word has length 19 [2019-12-27 18:08:28,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:28,329 INFO L462 AbstractCegarLoop]: Abstraction has 171713 states and 702115 transitions. [2019-12-27 18:08:28,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:08:28,329 INFO L276 IsEmpty]: Start isEmpty. Operand 171713 states and 702115 transitions. [2019-12-27 18:08:28,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:08:28,348 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:28,348 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:08:28,349 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:08:28,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:28,349 INFO L82 PathProgramCache]: Analyzing trace with hash 550104482, now seen corresponding path program 1 times [2019-12-27 18:08:28,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:28,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759731440] [2019-12-27 18:08:28,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:28,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:08:28,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759731440] [2019-12-27 18:08:28,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:28,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:08:28,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1936744048] [2019-12-27 18:08:28,438 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:28,440 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:28,443 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 31 transitions. [2019-12-27 18:08:28,443 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:28,473 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 18:08:28,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:08:28,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:28,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:08:28,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:08:28,475 INFO L87 Difference]: Start difference. First operand 171713 states and 702115 transitions. Second operand 5 states. [2019-12-27 18:08:28,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:28,894 INFO L93 Difference]: Finished difference Result 52005 states and 178102 transitions. [2019-12-27 18:08:28,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:08:28,894 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 18:08:28,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:28,972 INFO L225 Difference]: With dead ends: 52005 [2019-12-27 18:08:28,972 INFO L226 Difference]: Without dead ends: 41010 [2019-12-27 18:08:28,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:08:29,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41010 states. [2019-12-27 18:08:29,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41010 to 37941. [2019-12-27 18:08:29,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37941 states. [2019-12-27 18:08:35,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37941 states to 37941 states and 125252 transitions. [2019-12-27 18:08:35,263 INFO L78 Accepts]: Start accepts. Automaton has 37941 states and 125252 transitions. Word has length 19 [2019-12-27 18:08:35,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:35,263 INFO L462 AbstractCegarLoop]: Abstraction has 37941 states and 125252 transitions. [2019-12-27 18:08:35,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:08:35,263 INFO L276 IsEmpty]: Start isEmpty. Operand 37941 states and 125252 transitions. [2019-12-27 18:08:35,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:08:35,269 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:35,270 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:08:35,270 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:08:35,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:35,270 INFO L82 PathProgramCache]: Analyzing trace with hash -70181007, now seen corresponding path program 1 times [2019-12-27 18:08:35,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:35,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656240141] [2019-12-27 18:08:35,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:35,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:35,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:08:35,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656240141] [2019-12-27 18:08:35,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:35,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:08:35,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [987846126] [2019-12-27 18:08:35,339 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:35,342 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:35,354 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 63 states and 102 transitions. [2019-12-27 18:08:35,354 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:35,355 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:08:35,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:08:35,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:35,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:08:35,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:08:35,357 INFO L87 Difference]: Start difference. First operand 37941 states and 125252 transitions. Second operand 5 states. [2019-12-27 18:08:35,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:35,959 INFO L93 Difference]: Finished difference Result 50773 states and 164800 transitions. [2019-12-27 18:08:35,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 18:08:35,960 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 18:08:35,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:36,047 INFO L225 Difference]: With dead ends: 50773 [2019-12-27 18:08:36,047 INFO L226 Difference]: Without dead ends: 50471 [2019-12-27 18:08:36,048 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-27 18:08:36,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50471 states. [2019-12-27 18:08:36,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50471 to 38659. [2019-12-27 18:08:36,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38659 states. [2019-12-27 18:08:36,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38659 states to 38659 states and 127563 transitions. [2019-12-27 18:08:36,786 INFO L78 Accepts]: Start accepts. Automaton has 38659 states and 127563 transitions. Word has length 22 [2019-12-27 18:08:36,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:36,786 INFO L462 AbstractCegarLoop]: Abstraction has 38659 states and 127563 transitions. [2019-12-27 18:08:36,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:08:36,786 INFO L276 IsEmpty]: Start isEmpty. Operand 38659 states and 127563 transitions. [2019-12-27 18:08:36,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:08:36,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:36,793 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:08:36,794 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:08:36,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:36,794 INFO L82 PathProgramCache]: Analyzing trace with hash -633645132, now seen corresponding path program 1 times [2019-12-27 18:08:36,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:36,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40021210] [2019-12-27 18:08:36,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:36,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:36,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:08:36,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40021210] [2019-12-27 18:08:36,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:36,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:08:36,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [626885629] [2019-12-27 18:08:36,875 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:36,878 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:36,890 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 92 transitions. [2019-12-27 18:08:36,890 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:36,953 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:08:36,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:08:36,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:36,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:08:36,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:08:36,954 INFO L87 Difference]: Start difference. First operand 38659 states and 127563 transitions. Second operand 6 states. [2019-12-27 18:08:38,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:38,136 INFO L93 Difference]: Finished difference Result 75469 states and 247696 transitions. [2019-12-27 18:08:38,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 18:08:38,137 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 18:08:38,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:38,280 INFO L225 Difference]: With dead ends: 75469 [2019-12-27 18:08:38,280 INFO L226 Difference]: Without dead ends: 75049 [2019-12-27 18:08:38,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:08:38,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75049 states. [2019-12-27 18:08:39,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75049 to 36650. [2019-12-27 18:08:39,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36650 states. [2019-12-27 18:08:39,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36650 states to 36650 states and 120885 transitions. [2019-12-27 18:08:39,182 INFO L78 Accepts]: Start accepts. Automaton has 36650 states and 120885 transitions. Word has length 22 [2019-12-27 18:08:39,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:39,183 INFO L462 AbstractCegarLoop]: Abstraction has 36650 states and 120885 transitions. [2019-12-27 18:08:39,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:08:39,183 INFO L276 IsEmpty]: Start isEmpty. Operand 36650 states and 120885 transitions. [2019-12-27 18:08:39,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:08:39,194 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:39,194 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:08:39,194 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:08:39,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:39,195 INFO L82 PathProgramCache]: Analyzing trace with hash 400071569, now seen corresponding path program 1 times [2019-12-27 18:08:39,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:39,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479094511] [2019-12-27 18:08:39,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:39,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:39,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:08:39,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479094511] [2019-12-27 18:08:39,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:39,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:08:39,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [28210548] [2019-12-27 18:08:39,259 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:39,262 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:39,267 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 18:08:39,267 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:39,268 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:08:39,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:08:39,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:39,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:08:39,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:08:39,269 INFO L87 Difference]: Start difference. First operand 36650 states and 120885 transitions. Second operand 5 states. [2019-12-27 18:08:39,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:39,968 INFO L93 Difference]: Finished difference Result 50791 states and 163979 transitions. [2019-12-27 18:08:39,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:08:39,969 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 18:08:39,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:40,055 INFO L225 Difference]: With dead ends: 50791 [2019-12-27 18:08:40,055 INFO L226 Difference]: Without dead ends: 50351 [2019-12-27 18:08:40,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:08:40,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50351 states. [2019-12-27 18:08:40,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50351 to 41268. [2019-12-27 18:08:40,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41268 states. [2019-12-27 18:08:40,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41268 states to 41268 states and 135281 transitions. [2019-12-27 18:08:40,807 INFO L78 Accepts]: Start accepts. Automaton has 41268 states and 135281 transitions. Word has length 25 [2019-12-27 18:08:40,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:40,807 INFO L462 AbstractCegarLoop]: Abstraction has 41268 states and 135281 transitions. [2019-12-27 18:08:40,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:08:40,807 INFO L276 IsEmpty]: Start isEmpty. Operand 41268 states and 135281 transitions. [2019-12-27 18:08:40,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 18:08:40,826 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:40,826 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:08:40,826 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:08:40,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:40,827 INFO L82 PathProgramCache]: Analyzing trace with hash -819070516, now seen corresponding path program 1 times [2019-12-27 18:08:40,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:40,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435863628] [2019-12-27 18:08:40,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:40,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:08:40,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435863628] [2019-12-27 18:08:40,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:40,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:08:40,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [625512498] [2019-12-27 18:08:40,888 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:40,892 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:40,914 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 148 transitions. [2019-12-27 18:08:40,914 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:40,959 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:08:40,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:08:40,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:40,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:08:40,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:08:40,961 INFO L87 Difference]: Start difference. First operand 41268 states and 135281 transitions. Second operand 7 states. [2019-12-27 18:08:41,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:41,416 INFO L93 Difference]: Finished difference Result 51734 states and 167995 transitions. [2019-12-27 18:08:41,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:08:41,416 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-12-27 18:08:41,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:41,825 INFO L225 Difference]: With dead ends: 51734 [2019-12-27 18:08:41,825 INFO L226 Difference]: Without dead ends: 51360 [2019-12-27 18:08:41,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:08:42,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51360 states. [2019-12-27 18:08:42,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51360 to 43047. [2019-12-27 18:08:42,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43047 states. [2019-12-27 18:08:42,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43047 states to 43047 states and 141093 transitions. [2019-12-27 18:08:42,538 INFO L78 Accepts]: Start accepts. Automaton has 43047 states and 141093 transitions. Word has length 28 [2019-12-27 18:08:42,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:42,538 INFO L462 AbstractCegarLoop]: Abstraction has 43047 states and 141093 transitions. [2019-12-27 18:08:42,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:08:42,538 INFO L276 IsEmpty]: Start isEmpty. Operand 43047 states and 141093 transitions. [2019-12-27 18:08:42,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 18:08:42,563 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:42,563 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:08:42,563 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:08:42,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:42,564 INFO L82 PathProgramCache]: Analyzing trace with hash 377940687, now seen corresponding path program 1 times [2019-12-27 18:08:42,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:42,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696369548] [2019-12-27 18:08:42,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:42,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:42,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:08:42,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696369548] [2019-12-27 18:08:42,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:42,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:08:42,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1057866059] [2019-12-27 18:08:42,609 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:42,614 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:42,639 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 148 transitions. [2019-12-27 18:08:42,639 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:42,721 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 18:08:42,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:08:42,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:42,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:08:42,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:08:42,722 INFO L87 Difference]: Start difference. First operand 43047 states and 141093 transitions. Second operand 7 states. [2019-12-27 18:08:42,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:42,963 INFO L93 Difference]: Finished difference Result 54015 states and 175600 transitions. [2019-12-27 18:08:42,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:08:42,964 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-12-27 18:08:42,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:43,055 INFO L225 Difference]: With dead ends: 54015 [2019-12-27 18:08:43,055 INFO L226 Difference]: Without dead ends: 54015 [2019-12-27 18:08:43,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:08:43,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54015 states. [2019-12-27 18:08:44,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54015 to 44513. [2019-12-27 18:08:44,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44513 states. [2019-12-27 18:08:44,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44513 states to 44513 states and 143418 transitions. [2019-12-27 18:08:44,152 INFO L78 Accepts]: Start accepts. Automaton has 44513 states and 143418 transitions. Word has length 28 [2019-12-27 18:08:44,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:44,152 INFO L462 AbstractCegarLoop]: Abstraction has 44513 states and 143418 transitions. [2019-12-27 18:08:44,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:08:44,152 INFO L276 IsEmpty]: Start isEmpty. Operand 44513 states and 143418 transitions. [2019-12-27 18:08:44,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 18:08:44,171 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:44,171 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:08:44,171 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:08:44,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:44,171 INFO L82 PathProgramCache]: Analyzing trace with hash -589973380, now seen corresponding path program 1 times [2019-12-27 18:08:44,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:44,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388068446] [2019-12-27 18:08:44,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:44,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:44,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:08:44,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388068446] [2019-12-27 18:08:44,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:44,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:08:44,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1552293999] [2019-12-27 18:08:44,230 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:44,235 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:44,263 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 157 transitions. [2019-12-27 18:08:44,263 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:44,300 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:08:44,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:08:44,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:44,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:08:44,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:08:44,301 INFO L87 Difference]: Start difference. First operand 44513 states and 143418 transitions. Second operand 7 states. [2019-12-27 18:08:44,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:44,892 INFO L93 Difference]: Finished difference Result 55187 states and 176165 transitions. [2019-12-27 18:08:44,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:08:44,893 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2019-12-27 18:08:44,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:44,985 INFO L225 Difference]: With dead ends: 55187 [2019-12-27 18:08:44,986 INFO L226 Difference]: Without dead ends: 54793 [2019-12-27 18:08:44,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:08:45,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54793 states. [2019-12-27 18:08:46,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54793 to 43795. [2019-12-27 18:08:46,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43795 states. [2019-12-27 18:08:46,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43795 states to 43795 states and 140903 transitions. [2019-12-27 18:08:46,158 INFO L78 Accepts]: Start accepts. Automaton has 43795 states and 140903 transitions. Word has length 29 [2019-12-27 18:08:46,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:46,158 INFO L462 AbstractCegarLoop]: Abstraction has 43795 states and 140903 transitions. [2019-12-27 18:08:46,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:08:46,158 INFO L276 IsEmpty]: Start isEmpty. Operand 43795 states and 140903 transitions. [2019-12-27 18:08:46,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 18:08:46,176 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:46,176 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:08:46,176 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:08:46,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:46,177 INFO L82 PathProgramCache]: Analyzing trace with hash -934002539, now seen corresponding path program 1 times [2019-12-27 18:08:46,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:46,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834250040] [2019-12-27 18:08:46,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:46,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:46,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:08:46,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834250040] [2019-12-27 18:08:46,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:46,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:08:46,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2095654857] [2019-12-27 18:08:46,218 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:46,223 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:46,236 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 71 states and 111 transitions. [2019-12-27 18:08:46,237 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:46,247 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:08:46,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:08:46,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:46,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:08:46,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:08:46,248 INFO L87 Difference]: Start difference. First operand 43795 states and 140903 transitions. Second operand 4 states. [2019-12-27 18:08:46,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:46,630 INFO L93 Difference]: Finished difference Result 67942 states and 220761 transitions. [2019-12-27 18:08:46,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:08:46,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-12-27 18:08:46,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:46,715 INFO L225 Difference]: With dead ends: 67942 [2019-12-27 18:08:46,716 INFO L226 Difference]: Without dead ends: 32397 [2019-12-27 18:08:46,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:08:46,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32397 states. [2019-12-27 18:08:47,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32397 to 31522. [2019-12-27 18:08:47,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31522 states. [2019-12-27 18:08:47,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31522 states to 31522 states and 100287 transitions. [2019-12-27 18:08:47,351 INFO L78 Accepts]: Start accepts. Automaton has 31522 states and 100287 transitions. Word has length 29 [2019-12-27 18:08:47,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:47,351 INFO L462 AbstractCegarLoop]: Abstraction has 31522 states and 100287 transitions. [2019-12-27 18:08:47,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:08:47,352 INFO L276 IsEmpty]: Start isEmpty. Operand 31522 states and 100287 transitions. [2019-12-27 18:08:47,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 18:08:47,363 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:47,363 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:08:47,364 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:08:47,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:47,364 INFO L82 PathProgramCache]: Analyzing trace with hash -2124026772, now seen corresponding path program 1 times [2019-12-27 18:08:47,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:47,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941063526] [2019-12-27 18:08:47,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:47,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:47,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:08:47,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941063526] [2019-12-27 18:08:47,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:47,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:08:47,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [785533695] [2019-12-27 18:08:47,408 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:47,413 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:47,421 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 41 states and 52 transitions. [2019-12-27 18:08:47,421 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:47,431 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:08:47,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:08:47,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:47,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:08:47,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:08:47,433 INFO L87 Difference]: Start difference. First operand 31522 states and 100287 transitions. Second operand 5 states. [2019-12-27 18:08:48,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:48,168 INFO L93 Difference]: Finished difference Result 70384 states and 230715 transitions. [2019-12-27 18:08:48,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:08:48,168 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-27 18:08:48,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:48,634 INFO L225 Difference]: With dead ends: 70384 [2019-12-27 18:08:48,634 INFO L226 Difference]: Without dead ends: 42005 [2019-12-27 18:08:48,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:08:48,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42005 states. [2019-12-27 18:08:49,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42005 to 24904. [2019-12-27 18:08:49,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24904 states. [2019-12-27 18:08:49,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24904 states to 24904 states and 81632 transitions. [2019-12-27 18:08:49,185 INFO L78 Accepts]: Start accepts. Automaton has 24904 states and 81632 transitions. Word has length 30 [2019-12-27 18:08:49,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:49,185 INFO L462 AbstractCegarLoop]: Abstraction has 24904 states and 81632 transitions. [2019-12-27 18:08:49,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:08:49,185 INFO L276 IsEmpty]: Start isEmpty. Operand 24904 states and 81632 transitions. [2019-12-27 18:08:49,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 18:08:49,199 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:49,199 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:08:49,201 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:08:49,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:49,201 INFO L82 PathProgramCache]: Analyzing trace with hash -936488553, now seen corresponding path program 1 times [2019-12-27 18:08:49,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:49,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582629125] [2019-12-27 18:08:49,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:49,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:49,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:08:49,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582629125] [2019-12-27 18:08:49,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:49,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:08:49,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [590044539] [2019-12-27 18:08:49,275 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:49,280 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:49,298 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 73 states and 114 transitions. [2019-12-27 18:08:49,298 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:49,371 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 18:08:49,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 18:08:49,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:49,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 18:08:49,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 18:08:49,372 INFO L87 Difference]: Start difference. First operand 24904 states and 81632 transitions. Second operand 8 states. [2019-12-27 18:08:50,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:50,085 INFO L93 Difference]: Finished difference Result 40035 states and 129044 transitions. [2019-12-27 18:08:50,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:08:50,086 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-12-27 18:08:50,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:50,152 INFO L225 Difference]: With dead ends: 40035 [2019-12-27 18:08:50,152 INFO L226 Difference]: Without dead ends: 40035 [2019-12-27 18:08:50,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:08:50,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40035 states. [2019-12-27 18:08:50,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40035 to 32700. [2019-12-27 18:08:50,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32700 states. [2019-12-27 18:08:50,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32700 states to 32700 states and 106238 transitions. [2019-12-27 18:08:50,751 INFO L78 Accepts]: Start accepts. Automaton has 32700 states and 106238 transitions. Word has length 30 [2019-12-27 18:08:50,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:50,752 INFO L462 AbstractCegarLoop]: Abstraction has 32700 states and 106238 transitions. [2019-12-27 18:08:50,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 18:08:50,752 INFO L276 IsEmpty]: Start isEmpty. Operand 32700 states and 106238 transitions. [2019-12-27 18:08:50,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 18:08:50,950 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:50,950 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] [2019-12-27 18:08:50,950 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:08:50,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:50,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1151300207, now seen corresponding path program 1 times [2019-12-27 18:08:50,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:50,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037905003] [2019-12-27 18:08:50,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:50,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:51,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:08:51,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037905003] [2019-12-27 18:08:51,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:51,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:08:51,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [241601302] [2019-12-27 18:08:51,021 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:51,026 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:51,046 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 76 states and 119 transitions. [2019-12-27 18:08:51,046 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:51,060 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 18:08:51,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:08:51,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:51,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:08:51,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:08:51,061 INFO L87 Difference]: Start difference. First operand 32700 states and 106238 transitions. Second operand 6 states. [2019-12-27 18:08:51,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:51,181 INFO L93 Difference]: Finished difference Result 15040 states and 45214 transitions. [2019-12-27 18:08:51,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:08:51,181 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-12-27 18:08:51,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:51,204 INFO L225 Difference]: With dead ends: 15040 [2019-12-27 18:08:51,204 INFO L226 Difference]: Without dead ends: 12648 [2019-12-27 18:08:51,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 18:08:51,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12648 states. [2019-12-27 18:08:51,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12648 to 12434. [2019-12-27 18:08:51,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12434 states. [2019-12-27 18:08:51,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12434 states to 12434 states and 37089 transitions. [2019-12-27 18:08:51,388 INFO L78 Accepts]: Start accepts. Automaton has 12434 states and 37089 transitions. Word has length 31 [2019-12-27 18:08:51,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:51,388 INFO L462 AbstractCegarLoop]: Abstraction has 12434 states and 37089 transitions. [2019-12-27 18:08:51,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:08:51,389 INFO L276 IsEmpty]: Start isEmpty. Operand 12434 states and 37089 transitions. [2019-12-27 18:08:51,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 18:08:51,400 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:51,400 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-27 18:08:51,400 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:08:51,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:51,400 INFO L82 PathProgramCache]: Analyzing trace with hash -134226549, now seen corresponding path program 1 times [2019-12-27 18:08:51,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:51,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357875488] [2019-12-27 18:08:51,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:51,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:51,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:08:51,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357875488] [2019-12-27 18:08:51,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:51,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:08:51,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [604230057] [2019-12-27 18:08:51,480 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:51,491 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:51,538 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 97 states and 152 transitions. [2019-12-27 18:08:51,538 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:51,559 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:08:51,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:08:51,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:51,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:08:51,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:08:51,560 INFO L87 Difference]: Start difference. First operand 12434 states and 37089 transitions. Second operand 6 states. [2019-12-27 18:08:51,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:51,784 INFO L93 Difference]: Finished difference Result 12560 states and 37323 transitions. [2019-12-27 18:08:51,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:08:51,785 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 18:08:51,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:51,802 INFO L225 Difference]: With dead ends: 12560 [2019-12-27 18:08:51,802 INFO L226 Difference]: Without dead ends: 12333 [2019-12-27 18:08:51,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:08:51,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12333 states. [2019-12-27 18:08:51,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12333 to 12333. [2019-12-27 18:08:51,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12333 states. [2019-12-27 18:08:51,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12333 states to 12333 states and 36878 transitions. [2019-12-27 18:08:51,977 INFO L78 Accepts]: Start accepts. Automaton has 12333 states and 36878 transitions. Word has length 40 [2019-12-27 18:08:51,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:51,977 INFO L462 AbstractCegarLoop]: Abstraction has 12333 states and 36878 transitions. [2019-12-27 18:08:51,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:08:51,978 INFO L276 IsEmpty]: Start isEmpty. Operand 12333 states and 36878 transitions. [2019-12-27 18:08:51,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 18:08:51,989 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:51,990 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-27 18:08:51,990 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:08:51,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:51,990 INFO L82 PathProgramCache]: Analyzing trace with hash 809189858, now seen corresponding path program 1 times [2019-12-27 18:08:51,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:51,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435321790] [2019-12-27 18:08:51,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:52,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:52,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:08:52,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435321790] [2019-12-27 18:08:52,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:52,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:08:52,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1292688629] [2019-12-27 18:08:52,063 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:52,071 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:52,113 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 99 states and 162 transitions. [2019-12-27 18:08:52,113 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:52,181 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 18:08:52,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 18:08:52,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:52,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 18:08:52,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:08:52,183 INFO L87 Difference]: Start difference. First operand 12333 states and 36878 transitions. Second operand 9 states. [2019-12-27 18:08:53,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:53,799 INFO L93 Difference]: Finished difference Result 42008 states and 123572 transitions. [2019-12-27 18:08:53,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 18:08:53,800 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2019-12-27 18:08:53,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:53,859 INFO L225 Difference]: With dead ends: 42008 [2019-12-27 18:08:53,859 INFO L226 Difference]: Without dead ends: 42008 [2019-12-27 18:08:53,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2019-12-27 18:08:53,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42008 states. [2019-12-27 18:08:54,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42008 to 14381. [2019-12-27 18:08:54,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14381 states. [2019-12-27 18:08:54,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14381 states to 14381 states and 43273 transitions. [2019-12-27 18:08:54,436 INFO L78 Accepts]: Start accepts. Automaton has 14381 states and 43273 transitions. Word has length 40 [2019-12-27 18:08:54,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:54,437 INFO L462 AbstractCegarLoop]: Abstraction has 14381 states and 43273 transitions. [2019-12-27 18:08:54,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 18:08:54,437 INFO L276 IsEmpty]: Start isEmpty. Operand 14381 states and 43273 transitions. [2019-12-27 18:08:54,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 18:08:54,454 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:54,455 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-27 18:08:54,455 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:08:54,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:54,455 INFO L82 PathProgramCache]: Analyzing trace with hash -2114152388, now seen corresponding path program 2 times [2019-12-27 18:08:54,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:54,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367162339] [2019-12-27 18:08:54,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:54,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:54,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:08:54,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367162339] [2019-12-27 18:08:54,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:54,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 18:08:54,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [285802264] [2019-12-27 18:08:54,580 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:54,588 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:54,635 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 114 states and 199 transitions. [2019-12-27 18:08:54,636 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:54,714 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 18:08:54,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 18:08:54,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:54,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 18:08:54,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:08:54,715 INFO L87 Difference]: Start difference. First operand 14381 states and 43273 transitions. Second operand 10 states. [2019-12-27 18:08:56,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:08:56,854 INFO L93 Difference]: Finished difference Result 42381 states and 124298 transitions. [2019-12-27 18:08:56,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 18:08:56,854 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-12-27 18:08:56,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:08:56,914 INFO L225 Difference]: With dead ends: 42381 [2019-12-27 18:08:56,914 INFO L226 Difference]: Without dead ends: 42381 [2019-12-27 18:08:56,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2019-12-27 18:08:57,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42381 states. [2019-12-27 18:08:57,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42381 to 15043. [2019-12-27 18:08:57,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15043 states. [2019-12-27 18:08:57,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15043 states to 15043 states and 45227 transitions. [2019-12-27 18:08:57,304 INFO L78 Accepts]: Start accepts. Automaton has 15043 states and 45227 transitions. Word has length 40 [2019-12-27 18:08:57,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:08:57,304 INFO L462 AbstractCegarLoop]: Abstraction has 15043 states and 45227 transitions. [2019-12-27 18:08:57,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 18:08:57,304 INFO L276 IsEmpty]: Start isEmpty. Operand 15043 states and 45227 transitions. [2019-12-27 18:08:57,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 18:08:57,319 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:08:57,319 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-27 18:08:57,319 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:08:57,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:08:57,320 INFO L82 PathProgramCache]: Analyzing trace with hash -582218170, now seen corresponding path program 3 times [2019-12-27 18:08:57,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:08:57,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705426003] [2019-12-27 18:08:57,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:08:57,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:08:57,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:08:57,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705426003] [2019-12-27 18:08:57,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:08:57,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 18:08:57,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [847805270] [2019-12-27 18:08:57,439 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:08:57,454 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:08:57,512 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 107 states and 182 transitions. [2019-12-27 18:08:57,512 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:08:57,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:08:57,658 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 18:08:57,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:08:57,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:08:57,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:08:57,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:08:57,660 INFO L87 Difference]: Start difference. First operand 15043 states and 45227 transitions. Second operand 11 states. [2019-12-27 18:09:00,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:09:00,331 INFO L93 Difference]: Finished difference Result 22964 states and 68018 transitions. [2019-12-27 18:09:00,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 18:09:00,332 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 40 [2019-12-27 18:09:00,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:09:00,362 INFO L225 Difference]: With dead ends: 22964 [2019-12-27 18:09:00,362 INFO L226 Difference]: Without dead ends: 22964 [2019-12-27 18:09:00,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2019-12-27 18:09:00,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22964 states. [2019-12-27 18:09:00,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22964 to 15103. [2019-12-27 18:09:00,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15103 states. [2019-12-27 18:09:00,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15103 states to 15103 states and 45397 transitions. [2019-12-27 18:09:00,630 INFO L78 Accepts]: Start accepts. Automaton has 15103 states and 45397 transitions. Word has length 40 [2019-12-27 18:09:00,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:09:00,631 INFO L462 AbstractCegarLoop]: Abstraction has 15103 states and 45397 transitions. [2019-12-27 18:09:00,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:09:00,631 INFO L276 IsEmpty]: Start isEmpty. Operand 15103 states and 45397 transitions. [2019-12-27 18:09:00,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 18:09:00,646 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:09:00,646 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:09:00,646 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-27 18:09:00,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:09:00,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1136448647, now seen corresponding path program 1 times [2019-12-27 18:09:00,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:09:00,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392575551] [2019-12-27 18:09:00,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:09:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:09:00,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:09:00,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392575551] [2019-12-27 18:09:00,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:09:00,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:09:00,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [462580084] [2019-12-27 18:09:00,721 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:09:00,731 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:09:00,786 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 102 states and 161 transitions. [2019-12-27 18:09:00,786 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:09:00,858 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 18:09:00,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:09:00,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:09:00,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:09:00,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:09:00,859 INFO L87 Difference]: Start difference. First operand 15103 states and 45397 transitions. Second operand 7 states. [2019-12-27 18:09:01,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:09:01,734 INFO L93 Difference]: Finished difference Result 25246 states and 75283 transitions. [2019-12-27 18:09:01,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 18:09:01,734 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-27 18:09:01,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:09:01,771 INFO L225 Difference]: With dead ends: 25246 [2019-12-27 18:09:01,772 INFO L226 Difference]: Without dead ends: 24905 [2019-12-27 18:09:01,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-27 18:09:01,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24905 states. [2019-12-27 18:09:02,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24905 to 15558. [2019-12-27 18:09:02,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15558 states. [2019-12-27 18:09:02,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15558 states to 15558 states and 46963 transitions. [2019-12-27 18:09:02,070 INFO L78 Accepts]: Start accepts. Automaton has 15558 states and 46963 transitions. Word has length 41 [2019-12-27 18:09:02,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:09:02,070 INFO L462 AbstractCegarLoop]: Abstraction has 15558 states and 46963 transitions. [2019-12-27 18:09:02,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:09:02,071 INFO L276 IsEmpty]: Start isEmpty. Operand 15558 states and 46963 transitions. [2019-12-27 18:09:02,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 18:09:02,086 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:09:02,087 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:09:02,087 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-27 18:09:02,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:09:02,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1425122982, now seen corresponding path program 1 times [2019-12-27 18:09:02,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:09:02,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446745243] [2019-12-27 18:09:02,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:09:02,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:09:02,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:09:02,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446745243] [2019-12-27 18:09:02,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:09:02,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:09:02,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [406936079] [2019-12-27 18:09:02,171 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:09:02,180 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:09:02,226 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 101 states and 163 transitions. [2019-12-27 18:09:02,226 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:09:02,229 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:09:02,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:09:02,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:09:02,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:09:02,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:09:02,231 INFO L87 Difference]: Start difference. First operand 15558 states and 46963 transitions. Second operand 6 states. [2019-12-27 18:09:02,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:09:02,375 INFO L93 Difference]: Finished difference Result 14363 states and 43913 transitions. [2019-12-27 18:09:02,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:09:02,375 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 18:09:02,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:09:02,404 INFO L225 Difference]: With dead ends: 14363 [2019-12-27 18:09:02,404 INFO L226 Difference]: Without dead ends: 14163 [2019-12-27 18:09:02,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 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-27 18:09:02,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14163 states. [2019-12-27 18:09:02,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14163 to 12460. [2019-12-27 18:09:02,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12460 states. [2019-12-27 18:09:02,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12460 states to 12460 states and 38613 transitions. [2019-12-27 18:09:02,664 INFO L78 Accepts]: Start accepts. Automaton has 12460 states and 38613 transitions. Word has length 41 [2019-12-27 18:09:02,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:09:02,664 INFO L462 AbstractCegarLoop]: Abstraction has 12460 states and 38613 transitions. [2019-12-27 18:09:02,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:09:02,664 INFO L276 IsEmpty]: Start isEmpty. Operand 12460 states and 38613 transitions. [2019-12-27 18:09:02,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:09:02,678 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:09:02,678 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:09:02,678 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:09:02,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:09:02,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1638387748, now seen corresponding path program 1 times [2019-12-27 18:09:02,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:09:02,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121634710] [2019-12-27 18:09:02,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:09:02,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:09:02,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:09:02,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121634710] [2019-12-27 18:09:02,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:09:02,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:09:02,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1861018539] [2019-12-27 18:09:02,744 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:09:02,759 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:09:03,052 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 215 states and 404 transitions. [2019-12-27 18:09:03,053 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:09:03,102 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 18:09:03,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 18:09:03,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:09:03,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 18:09:03,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:09:03,103 INFO L87 Difference]: Start difference. First operand 12460 states and 38613 transitions. Second operand 10 states. [2019-12-27 18:09:05,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:09:05,645 INFO L93 Difference]: Finished difference Result 41398 states and 124792 transitions. [2019-12-27 18:09:05,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 18:09:05,646 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-12-27 18:09:05,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:09:05,692 INFO L225 Difference]: With dead ends: 41398 [2019-12-27 18:09:05,692 INFO L226 Difference]: Without dead ends: 31510 [2019-12-27 18:09:05,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=387, Invalid=1683, Unknown=0, NotChecked=0, Total=2070 [2019-12-27 18:09:05,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31510 states. [2019-12-27 18:09:06,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31510 to 14476. [2019-12-27 18:09:06,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14476 states. [2019-12-27 18:09:06,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14476 states to 14476 states and 44317 transitions. [2019-12-27 18:09:06,033 INFO L78 Accepts]: Start accepts. Automaton has 14476 states and 44317 transitions. Word has length 54 [2019-12-27 18:09:06,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:09:06,033 INFO L462 AbstractCegarLoop]: Abstraction has 14476 states and 44317 transitions. [2019-12-27 18:09:06,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 18:09:06,033 INFO L276 IsEmpty]: Start isEmpty. Operand 14476 states and 44317 transitions. [2019-12-27 18:09:06,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:09:06,048 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:09:06,048 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:09:06,049 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:09:06,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:09:06,049 INFO L82 PathProgramCache]: Analyzing trace with hash 341327716, now seen corresponding path program 2 times [2019-12-27 18:09:06,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:09:06,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51041341] [2019-12-27 18:09:06,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:09:06,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:09:06,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:09:06,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51041341] [2019-12-27 18:09:06,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:09:06,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:09:06,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2119532000] [2019-12-27 18:09:06,107 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:09:06,122 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:09:06,266 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 215 states and 404 transitions. [2019-12-27 18:09:06,267 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:09:06,325 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 18:09:06,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 18:09:06,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:09:06,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 18:09:06,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:09:06,326 INFO L87 Difference]: Start difference. First operand 14476 states and 44317 transitions. Second operand 10 states. [2019-12-27 18:09:07,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:09:07,568 INFO L93 Difference]: Finished difference Result 28816 states and 87103 transitions. [2019-12-27 18:09:07,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 18:09:07,569 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-12-27 18:09:07,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:09:07,600 INFO L225 Difference]: With dead ends: 28816 [2019-12-27 18:09:07,601 INFO L226 Difference]: Without dead ends: 21612 [2019-12-27 18:09:07,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2019-12-27 18:09:07,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21612 states. [2019-12-27 18:09:07,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21612 to 16545. [2019-12-27 18:09:07,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16545 states. [2019-12-27 18:09:07,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16545 states to 16545 states and 49992 transitions. [2019-12-27 18:09:07,879 INFO L78 Accepts]: Start accepts. Automaton has 16545 states and 49992 transitions. Word has length 54 [2019-12-27 18:09:07,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:09:07,880 INFO L462 AbstractCegarLoop]: Abstraction has 16545 states and 49992 transitions. [2019-12-27 18:09:07,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 18:09:07,880 INFO L276 IsEmpty]: Start isEmpty. Operand 16545 states and 49992 transitions. [2019-12-27 18:09:07,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:09:07,896 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:09:07,896 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:09:07,896 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:09:07,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:09:07,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1312613832, now seen corresponding path program 3 times [2019-12-27 18:09:07,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:09:07,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615121134] [2019-12-27 18:09:07,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:09:07,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:09:07,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:09:07,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615121134] [2019-12-27 18:09:07,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:09:07,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 18:09:07,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [672637071] [2019-12-27 18:09:07,988 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:09:08,003 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:09:08,130 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 168 states and 307 transitions. [2019-12-27 18:09:08,130 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:09:08,152 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:09:08,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 18:09:08,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:09:08,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 18:09:08,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:09:08,154 INFO L87 Difference]: Start difference. First operand 16545 states and 49992 transitions. Second operand 10 states. [2019-12-27 18:09:09,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:09:09,552 INFO L93 Difference]: Finished difference Result 40567 states and 120908 transitions. [2019-12-27 18:09:09,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 18:09:09,553 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-12-27 18:09:09,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:09:09,606 INFO L225 Difference]: With dead ends: 40567 [2019-12-27 18:09:09,606 INFO L226 Difference]: Without dead ends: 38155 [2019-12-27 18:09:09,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=347, Invalid=1213, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 18:09:09,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38155 states. [2019-12-27 18:09:09,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38155 to 16360. [2019-12-27 18:09:09,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16360 states. [2019-12-27 18:09:10,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16360 states to 16360 states and 49426 transitions. [2019-12-27 18:09:10,004 INFO L78 Accepts]: Start accepts. Automaton has 16360 states and 49426 transitions. Word has length 54 [2019-12-27 18:09:10,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:09:10,005 INFO L462 AbstractCegarLoop]: Abstraction has 16360 states and 49426 transitions. [2019-12-27 18:09:10,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 18:09:10,005 INFO L276 IsEmpty]: Start isEmpty. Operand 16360 states and 49426 transitions. Received shutdown request... [2019-12-27 18:09:10,109 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 18:09:10,112 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 18:09:10,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:09:10 BasicIcfg [2019-12-27 18:09:10,113 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 18:09:10,115 INFO L168 Benchmark]: Toolchain (without parser) took 194062.96 ms. Allocated memory was 140.0 MB in the beginning and 4.1 GB in the end (delta: 3.9 GB). Free memory was 102.8 MB in the beginning and 2.9 GB in the end (delta: -2.8 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-27 18:09:10,115 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 140.0 MB. Free memory was 123.2 MB in the beginning and 122.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 18:09:10,116 INFO L168 Benchmark]: CACSL2BoogieTranslator took 781.94 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 102.4 MB in the beginning and 157.8 MB in the end (delta: -55.4 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2019-12-27 18:09:10,116 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.41 ms. Allocated memory is still 203.9 MB. Free memory was 157.8 MB in the beginning and 155.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 18:09:10,117 INFO L168 Benchmark]: Boogie Preprocessor took 39.37 ms. Allocated memory is still 203.9 MB. Free memory was 155.3 MB in the beginning and 152.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 18:09:10,117 INFO L168 Benchmark]: RCFGBuilder took 912.18 ms. Allocated memory is still 203.9 MB. Free memory was 152.7 MB in the beginning and 106.7 MB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 7.1 GB. [2019-12-27 18:09:10,118 INFO L168 Benchmark]: TraceAbstraction took 192253.41 ms. Allocated memory was 203.9 MB in the beginning and 4.1 GB in the end (delta: 3.9 GB). Free memory was 106.1 MB in the beginning and 2.9 GB in the end (delta: -2.8 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-27 18:09:10,120 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.18 ms. Allocated memory is still 140.0 MB. Free memory was 123.2 MB in the beginning and 122.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 781.94 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 102.4 MB in the beginning and 157.8 MB in the end (delta: -55.4 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.41 ms. Allocated memory is still 203.9 MB. Free memory was 157.8 MB in the beginning and 155.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.37 ms. Allocated memory is still 203.9 MB. Free memory was 155.3 MB in the beginning and 152.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 912.18 ms. Allocated memory is still 203.9 MB. Free memory was 152.7 MB in the beginning and 106.7 MB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 192253.41 ms. Allocated memory was 203.9 MB in the beginning and 4.1 GB in the end (delta: 3.9 GB). Free memory was 106.1 MB in the beginning and 2.9 GB in the end (delta: -2.8 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 163 ProgramPointsBefore, 83 ProgramPointsAfterwards, 194 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 26 ChoiceCompositions, 6760 VarBasedMoverChecksPositive, 302 VarBasedMoverChecksNegative, 126 SemBasedMoverChecksPositive, 261 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 66367 CheckedPairsTotal, 113 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while IsEmpty was searching accepting run (input had 16360 states). - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while IsEmpty was searching accepting run (input had 16360 states). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: TIMEOUT, OverallTime: 192.0s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 63.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5361 SDtfs, 9442 SDslu, 12894 SDs, 0 SdLazy, 11094 SolverSat, 596 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 454 GetRequests, 152 SyntacticMatches, 31 SemanticMatches, 271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1367 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=171713occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 106.2s AutomataMinimizationTime, 28 MinimizatonAttempts, 430314 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 807 NumberOfCodeBlocks, 807 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 779 ConstructedInterpolants, 0 QuantifiedInterpolants, 81599 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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