./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/list-ext3-properties/sll_nondet_insert_false-unreach-call_false-valid-memcleanup.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/list-ext3-properties/sll_nondet_insert_false-unreach-call_false-valid-memcleanup.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 27142e71f3089c5c3b5bf4f358882e993f701ffc .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 05:25:24,944 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 05:25:24,946 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 05:25:24,959 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 05:25:24,959 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 05:25:24,960 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 05:25:24,961 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 05:25:24,964 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 05:25:24,966 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 05:25:24,967 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 05:25:24,967 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 05:25:24,968 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 05:25:24,969 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 05:25:24,970 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 05:25:24,972 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 05:25:24,972 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 05:25:24,973 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 05:25:24,975 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 05:25:24,978 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 05:25:24,980 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 05:25:24,981 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 05:25:24,982 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 05:25:24,984 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 05:25:24,985 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 05:25:24,985 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 05:25:24,986 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 05:25:24,987 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 05:25:24,988 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 05:25:24,989 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 05:25:24,990 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 05:25:24,990 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 05:25:24,991 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 05:25:24,991 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 05:25:24,991 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 05:25:24,992 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 05:25:24,994 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 05:25:24,994 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 05:25:25,015 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 05:25:25,016 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 05:25:25,018 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 05:25:25,018 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 05:25:25,018 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 05:25:25,018 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 05:25:25,018 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 05:25:25,019 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 05:25:25,019 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 05:25:25,019 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 05:25:25,019 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 05:25:25,019 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 05:25:25,019 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 05:25:25,021 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 05:25:25,021 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 05:25:25,021 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 05:25:25,021 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 05:25:25,021 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 05:25:25,022 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 05:25:25,022 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 05:25:25,022 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 05:25:25,022 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 05:25:25,022 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 05:25:25,022 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 05:25:25,023 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 05:25:25,025 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 05:25:25,025 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 05:25:25,025 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 05:25:25,026 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 27142e71f3089c5c3b5bf4f358882e993f701ffc [2018-12-31 05:25:25,086 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 05:25:25,100 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 05:25:25,105 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 05:25:25,106 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 05:25:25,107 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 05:25:25,108 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-ext3-properties/sll_nondet_insert_false-unreach-call_false-valid-memcleanup.i [2018-12-31 05:25:25,171 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b2a7447d/2473baac537d4408819e6c9fe957af7c/FLAG4419c96c8 [2018-12-31 05:25:25,747 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 05:25:25,747 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-ext3-properties/sll_nondet_insert_false-unreach-call_false-valid-memcleanup.i [2018-12-31 05:25:25,770 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b2a7447d/2473baac537d4408819e6c9fe957af7c/FLAG4419c96c8 [2018-12-31 05:25:25,993 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b2a7447d/2473baac537d4408819e6c9fe957af7c [2018-12-31 05:25:25,998 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 05:25:26,000 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 05:25:26,001 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 05:25:26,001 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 05:25:26,006 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 05:25:26,007 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 05:25:25" (1/1) ... [2018-12-31 05:25:26,011 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c966713 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:25:26, skipping insertion in model container [2018-12-31 05:25:26,011 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 05:25:25" (1/1) ... [2018-12-31 05:25:26,020 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 05:25:26,078 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 05:25:26,470 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 05:25:26,481 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 05:25:26,540 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 05:25:26,745 INFO L195 MainTranslator]: Completed translation [2018-12-31 05:25:26,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:25:26 WrapperNode [2018-12-31 05:25:26,746 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 05:25:26,747 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 05:25:26,747 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 05:25:26,748 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 05:25:26,758 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:25:26" (1/1) ... [2018-12-31 05:25:26,780 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:25:26" (1/1) ... [2018-12-31 05:25:26,828 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 05:25:26,830 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 05:25:26,830 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 05:25:26,830 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 05:25:26,842 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:25:26" (1/1) ... [2018-12-31 05:25:26,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:25:26" (1/1) ... [2018-12-31 05:25:26,855 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:25:26" (1/1) ... [2018-12-31 05:25:26,857 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:25:26" (1/1) ... [2018-12-31 05:25:26,876 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:25:26" (1/1) ... [2018-12-31 05:25:26,886 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:25:26" (1/1) ... [2018-12-31 05:25:26,889 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:25:26" (1/1) ... [2018-12-31 05:25:26,894 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 05:25:26,894 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 05:25:26,895 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 05:25:26,897 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 05:25:26,898 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:25:26" (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 [2018-12-31 05:25:26,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2018-12-31 05:25:26,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 05:25:26,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-31 05:25:26,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-31 05:25:26,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 05:25:26,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-31 05:25:26,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 05:25:26,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 05:25:27,668 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 05:25:27,668 INFO L280 CfgBuilder]: Removed 30 assue(true) statements. [2018-12-31 05:25:27,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 05:25:27 BoogieIcfgContainer [2018-12-31 05:25:27,669 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 05:25:27,671 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 05:25:27,671 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 05:25:27,675 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 05:25:27,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 05:25:25" (1/3) ... [2018-12-31 05:25:27,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a3e3922 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 05:25:27, skipping insertion in model container [2018-12-31 05:25:27,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:25:26" (2/3) ... [2018-12-31 05:25:27,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a3e3922 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 05:25:27, skipping insertion in model container [2018-12-31 05:25:27,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 05:25:27" (3/3) ... [2018-12-31 05:25:27,680 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_nondet_insert_false-unreach-call_false-valid-memcleanup.i [2018-12-31 05:25:27,691 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 05:25:27,699 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 05:25:27,717 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 05:25:27,744 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 05:25:27,745 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 05:25:27,745 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 05:25:27,745 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 05:25:27,745 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 05:25:27,745 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 05:25:27,746 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 05:25:27,746 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 05:25:27,746 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 05:25:27,761 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2018-12-31 05:25:27,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-31 05:25:27,769 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:25:27,770 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:25:27,772 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:25:27,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:25:27,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1628314530, now seen corresponding path program 1 times [2018-12-31 05:25:27,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:25:27,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:25:27,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:27,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:25:27,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:27,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:25:27,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:25:27,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 05:25:27,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 05:25:27,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 05:25:27,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 05:25:27,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 05:25:27,927 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2018-12-31 05:25:27,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:25:27,948 INFO L93 Difference]: Finished difference Result 89 states and 132 transitions. [2018-12-31 05:25:27,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 05:25:27,950 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-12-31 05:25:27,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:25:27,960 INFO L225 Difference]: With dead ends: 89 [2018-12-31 05:25:27,961 INFO L226 Difference]: Without dead ends: 40 [2018-12-31 05:25:27,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 05:25:27,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-31 05:25:28,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-31 05:25:28,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-31 05:25:28,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2018-12-31 05:25:28,005 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 18 [2018-12-31 05:25:28,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:25:28,005 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2018-12-31 05:25:28,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 05:25:28,006 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2018-12-31 05:25:28,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-31 05:25:28,007 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:25:28,007 INFO L402 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] [2018-12-31 05:25:28,007 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:25:28,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:25:28,008 INFO L82 PathProgramCache]: Analyzing trace with hash 682388861, now seen corresponding path program 1 times [2018-12-31 05:25:28,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:25:28,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:25:28,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:28,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:25:28,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:25:28,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:25:28,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 05:25:28,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 05:25:28,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 05:25:28,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 05:25:28,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 05:25:28,339 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand 6 states. [2018-12-31 05:25:28,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:25:28,580 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2018-12-31 05:25:28,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 05:25:28,588 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-12-31 05:25:28,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:25:28,590 INFO L225 Difference]: With dead ends: 82 [2018-12-31 05:25:28,590 INFO L226 Difference]: Without dead ends: 53 [2018-12-31 05:25:28,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-12-31 05:25:28,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-31 05:25:28,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2018-12-31 05:25:28,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-31 05:25:28,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2018-12-31 05:25:28,600 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 60 transitions. Word has length 25 [2018-12-31 05:25:28,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:25:28,601 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 60 transitions. [2018-12-31 05:25:28,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 05:25:28,601 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2018-12-31 05:25:28,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-31 05:25:28,602 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:25:28,603 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:25:28,603 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:25:28,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:25:28,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1179494860, now seen corresponding path program 1 times [2018-12-31 05:25:28,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:25:28,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:25:28,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:28,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:25:28,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:28,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:25:28,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:25:28,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:25:28,768 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:25:28,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:25:28,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:25:28,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:25:28,925 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:25:28,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-31 05:25:28,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2018-12-31 05:25:28,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 05:25:28,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 05:25:28,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-31 05:25:28,950 INFO L87 Difference]: Start difference. First operand 47 states and 60 transitions. Second operand 8 states. [2018-12-31 05:25:29,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:25:29,469 INFO L93 Difference]: Finished difference Result 84 states and 107 transitions. [2018-12-31 05:25:29,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 05:25:29,470 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-12-31 05:25:29,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:25:29,472 INFO L225 Difference]: With dead ends: 84 [2018-12-31 05:25:29,472 INFO L226 Difference]: Without dead ends: 55 [2018-12-31 05:25:29,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-12-31 05:25:29,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-31 05:25:29,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2018-12-31 05:25:29,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-31 05:25:29,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2018-12-31 05:25:29,488 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 28 [2018-12-31 05:25:29,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:25:29,489 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2018-12-31 05:25:29,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 05:25:29,489 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2018-12-31 05:25:29,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-31 05:25:29,490 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:25:29,490 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:25:29,490 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:25:29,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:25:29,491 INFO L82 PathProgramCache]: Analyzing trace with hash -526649532, now seen corresponding path program 1 times [2018-12-31 05:25:29,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:25:29,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:25:29,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:29,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:25:29,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:29,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:25:29,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:25:29,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 05:25:29,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 05:25:29,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 05:25:29,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 05:25:29,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-31 05:25:29,745 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand 8 states. [2018-12-31 05:25:30,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:25:30,079 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2018-12-31 05:25:30,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 05:25:30,080 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-12-31 05:25:30,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:25:30,081 INFO L225 Difference]: With dead ends: 70 [2018-12-31 05:25:30,082 INFO L226 Difference]: Without dead ends: 65 [2018-12-31 05:25:30,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-12-31 05:25:30,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-31 05:25:30,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 47. [2018-12-31 05:25:30,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-31 05:25:30,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2018-12-31 05:25:30,093 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 60 transitions. Word has length 29 [2018-12-31 05:25:30,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:25:30,094 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 60 transitions. [2018-12-31 05:25:30,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 05:25:30,094 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2018-12-31 05:25:30,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-31 05:25:30,095 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:25:30,095 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:25:30,096 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:25:30,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:25:30,098 INFO L82 PathProgramCache]: Analyzing trace with hash 905388054, now seen corresponding path program 1 times [2018-12-31 05:25:30,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:25:30,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:25:30,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:30,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:25:30,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:30,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:25:30,223 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 05:25:30,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:25:30,224 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:25:30,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:25:30,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:25:30,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:25:30,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-31 05:25:30,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:25:30,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-12-31 05:25:30,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 05:25:30,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 05:25:30,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-31 05:25:30,468 INFO L87 Difference]: Start difference. First operand 47 states and 60 transitions. Second operand 8 states. [2018-12-31 05:25:30,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:25:30,877 INFO L93 Difference]: Finished difference Result 102 states and 130 transitions. [2018-12-31 05:25:30,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 05:25:30,879 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-12-31 05:25:30,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:25:30,880 INFO L225 Difference]: With dead ends: 102 [2018-12-31 05:25:30,881 INFO L226 Difference]: Without dead ends: 68 [2018-12-31 05:25:30,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2018-12-31 05:25:30,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-31 05:25:30,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 51. [2018-12-31 05:25:30,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-31 05:25:30,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2018-12-31 05:25:30,891 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 30 [2018-12-31 05:25:30,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:25:30,891 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2018-12-31 05:25:30,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 05:25:30,891 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2018-12-31 05:25:30,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-31 05:25:30,892 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:25:30,893 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:25:30,893 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:25:30,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:25:30,893 INFO L82 PathProgramCache]: Analyzing trace with hash 921279151, now seen corresponding path program 2 times [2018-12-31 05:25:30,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:25:30,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:25:30,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:30,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:25:30,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:30,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:25:31,056 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:25:31,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:25:31,056 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:25:31,073 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 05:25:31,125 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 05:25:31,125 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:25:31,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:25:31,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-31 05:25:31,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-31 05:25:31,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:31,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:31,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:31,201 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-12-31 05:25:31,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2018-12-31 05:25:31,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-12-31 05:25:31,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:31,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:31,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-31 05:25:31,257 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:20 [2018-12-31 05:25:31,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2018-12-31 05:25:31,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-12-31 05:25:31,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:31,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:31,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:31,346 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:4 [2018-12-31 05:25:31,353 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:25:31,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:25:31,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2018-12-31 05:25:31,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 05:25:31,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 05:25:31,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-12-31 05:25:31,383 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand 11 states. [2018-12-31 05:25:32,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:25:32,170 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2018-12-31 05:25:32,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 05:25:32,178 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2018-12-31 05:25:32,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:25:32,180 INFO L225 Difference]: With dead ends: 75 [2018-12-31 05:25:32,180 INFO L226 Difference]: Without dead ends: 70 [2018-12-31 05:25:32,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2018-12-31 05:25:32,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-31 05:25:32,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2018-12-31 05:25:32,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-31 05:25:32,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2018-12-31 05:25:32,190 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 34 [2018-12-31 05:25:32,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:25:32,191 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2018-12-31 05:25:32,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 05:25:32,191 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2018-12-31 05:25:32,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-31 05:25:32,192 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:25:32,192 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:25:32,192 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:25:32,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:25:32,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1453463029, now seen corresponding path program 3 times [2018-12-31 05:25:32,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:25:32,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:25:32,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:32,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:25:32,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:32,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:25:32,587 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-31 05:25:32,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:25:32,588 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:25:32,619 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 05:25:32,670 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-31 05:25:32,670 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:25:32,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:25:33,191 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-31 05:25:33,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:25:33,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 17 [2018-12-31 05:25:33,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-31 05:25:33,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-31 05:25:33,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-12-31 05:25:33,212 INFO L87 Difference]: Start difference. First operand 52 states and 65 transitions. Second operand 17 states. [2018-12-31 05:25:34,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:25:34,005 INFO L93 Difference]: Finished difference Result 213 states and 262 transitions. [2018-12-31 05:25:34,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-31 05:25:34,006 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 35 [2018-12-31 05:25:34,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:25:34,008 INFO L225 Difference]: With dead ends: 213 [2018-12-31 05:25:34,008 INFO L226 Difference]: Without dead ends: 205 [2018-12-31 05:25:34,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2018-12-31 05:25:34,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-12-31 05:25:34,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 97. [2018-12-31 05:25:34,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-31 05:25:34,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 125 transitions. [2018-12-31 05:25:34,034 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 125 transitions. Word has length 35 [2018-12-31 05:25:34,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:25:34,034 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 125 transitions. [2018-12-31 05:25:34,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-31 05:25:34,034 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 125 transitions. [2018-12-31 05:25:34,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-31 05:25:34,035 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:25:34,036 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:25:34,036 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:25:34,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:25:34,036 INFO L82 PathProgramCache]: Analyzing trace with hash -2056026577, now seen corresponding path program 4 times [2018-12-31 05:25:34,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:25:34,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:25:34,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:34,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:25:34,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:34,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:25:34,621 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:25:34,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:25:34,622 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:25:34,641 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-31 05:25:34,699 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-31 05:25:34,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:25:34,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:25:34,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-31 05:25:34,773 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:34,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:34,817 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-12-31 05:25:34,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-31 05:25:34,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-31 05:25:34,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:35,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:35,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-31 05:25:35,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-31 05:25:35,043 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:35,048 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:35,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:35,057 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2018-12-31 05:25:35,084 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:25:35,086 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:25:35,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-31 05:25:35,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:35,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:35,098 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:25 [2018-12-31 05:25:35,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-31 05:25:35,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-31 05:25:35,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:35,156 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:35,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-31 05:25:35,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-31 05:25:35,186 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:35,211 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:35,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:35,226 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:41 [2018-12-31 05:25:35,465 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:25:35,466 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 05:25:35,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 119 [2018-12-31 05:25:35,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 73 [2018-12-31 05:25:35,508 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:25:35,732 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 05:25:35,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 60 [2018-12-31 05:25:35,743 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-31 05:25:35,865 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 05:25:35,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 88 [2018-12-31 05:25:35,866 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:35,965 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:25:35,966 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 05:25:35,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 87 [2018-12-31 05:25:35,968 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:25:36,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 70 [2018-12-31 05:25:36,063 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:25:36,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 53 [2018-12-31 05:25:36,160 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-31 05:25:36,275 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 05:25:36,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 82 [2018-12-31 05:25:36,277 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:36,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 68 [2018-12-31 05:25:36,445 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-31 05:25:36,553 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: 8 dim-0 vars, and 5 xjuncts. [2018-12-31 05:25:36,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 44 [2018-12-31 05:25:36,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-12-31 05:25:36,670 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:36,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-12-31 05:25:36,710 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:36,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 15 [2018-12-31 05:25:36,748 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:36,789 INFO L267 ElimStorePlain]: Start of recursive call 11: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:36,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 60 [2018-12-31 05:25:36,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 43 [2018-12-31 05:25:36,820 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:36,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2018-12-31 05:25:36,904 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:36,991 INFO L267 ElimStorePlain]: Start of recursive call 15: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:37,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2018-12-31 05:25:37,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-12-31 05:25:37,021 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:37,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-12-31 05:25:37,066 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:37,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-12-31 05:25:37,135 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:37,146 INFO L267 ElimStorePlain]: Start of recursive call 18: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:37,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 56 [2018-12-31 05:25:37,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 39 [2018-12-31 05:25:37,169 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:37,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2018-12-31 05:25:37,211 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:37,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19 [2018-12-31 05:25:37,250 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:37,421 INFO L267 ElimStorePlain]: Start of recursive call 22: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:37,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 48 [2018-12-31 05:25:37,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2018-12-31 05:25:37,451 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:37,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-12-31 05:25:37,498 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:37,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-12-31 05:25:37,537 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:37,577 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:25:37,578 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 05:25:37,579 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 05:25:37,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2018-12-31 05:25:37,581 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:37,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2018-12-31 05:25:37,616 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-31 05:25:37,632 INFO L267 ElimStorePlain]: Start of recursive call 26: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 05:25:37,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-31 05:25:37,684 INFO L202 ElimStorePlain]: Needed 31 recursive calls to eliminate 4 variables, input treesize:127, output treesize:15 [2018-12-31 05:25:37,704 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:25:37,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:25:37,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2018-12-31 05:25:37,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-31 05:25:37,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-31 05:25:37,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=325, Unknown=8, NotChecked=0, Total=380 [2018-12-31 05:25:37,727 INFO L87 Difference]: Start difference. First operand 97 states and 125 transitions. Second operand 20 states. [2018-12-31 05:25:38,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:25:38,468 INFO L93 Difference]: Finished difference Result 168 states and 212 transitions. [2018-12-31 05:25:38,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-31 05:25:38,476 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-12-31 05:25:38,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:25:38,478 INFO L225 Difference]: With dead ends: 168 [2018-12-31 05:25:38,478 INFO L226 Difference]: Without dead ends: 158 [2018-12-31 05:25:38,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=103, Invalid=539, Unknown=8, NotChecked=0, Total=650 [2018-12-31 05:25:38,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-31 05:25:38,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 129. [2018-12-31 05:25:38,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-31 05:25:38,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 166 transitions. [2018-12-31 05:25:38,532 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 166 transitions. Word has length 36 [2018-12-31 05:25:38,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:25:38,532 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 166 transitions. [2018-12-31 05:25:38,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-31 05:25:38,533 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 166 transitions. [2018-12-31 05:25:38,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-31 05:25:38,539 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:25:38,540 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:25:38,540 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:25:38,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:25:38,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1714610549, now seen corresponding path program 1 times [2018-12-31 05:25:38,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:25:38,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:25:38,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:38,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:25:38,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:38,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:25:38,717 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-31 05:25:38,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:25:38,718 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:25:38,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:25:38,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:25:38,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:25:38,815 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-31 05:25:38,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:25:38,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-12-31 05:25:38,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 05:25:38,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 05:25:38,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-12-31 05:25:38,837 INFO L87 Difference]: Start difference. First operand 129 states and 166 transitions. Second operand 11 states. [2018-12-31 05:25:39,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:25:39,999 INFO L93 Difference]: Finished difference Result 375 states and 494 transitions. [2018-12-31 05:25:40,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-31 05:25:40,000 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-12-31 05:25:40,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:25:40,003 INFO L225 Difference]: With dead ends: 375 [2018-12-31 05:25:40,008 INFO L226 Difference]: Without dead ends: 289 [2018-12-31 05:25:40,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=510, Unknown=0, NotChecked=0, Total=650 [2018-12-31 05:25:40,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-12-31 05:25:40,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 141. [2018-12-31 05:25:40,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-31 05:25:40,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 178 transitions. [2018-12-31 05:25:40,053 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 178 transitions. Word has length 38 [2018-12-31 05:25:40,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:25:40,053 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 178 transitions. [2018-12-31 05:25:40,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 05:25:40,053 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 178 transitions. [2018-12-31 05:25:40,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-31 05:25:40,057 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:25:40,057 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:25:40,057 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:25:40,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:25:40,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1300493069, now seen corresponding path program 1 times [2018-12-31 05:25:40,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:25:40,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:25:40,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:40,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:25:40,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:25:40,212 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-31 05:25:40,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:25:40,213 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:25:40,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:25:40,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:25:40,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:25:40,283 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-31 05:25:40,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-31 05:25:40,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2018-12-31 05:25:40,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 05:25:40,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 05:25:40,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-31 05:25:40,304 INFO L87 Difference]: Start difference. First operand 141 states and 178 transitions. Second operand 9 states. [2018-12-31 05:25:41,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:25:41,055 INFO L93 Difference]: Finished difference Result 273 states and 348 transitions. [2018-12-31 05:25:41,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 05:25:41,056 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2018-12-31 05:25:41,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:25:41,058 INFO L225 Difference]: With dead ends: 273 [2018-12-31 05:25:41,058 INFO L226 Difference]: Without dead ends: 241 [2018-12-31 05:25:41,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-12-31 05:25:41,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-12-31 05:25:41,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 157. [2018-12-31 05:25:41,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-12-31 05:25:41,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 198 transitions. [2018-12-31 05:25:41,097 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 198 transitions. Word has length 38 [2018-12-31 05:25:41,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:25:41,097 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 198 transitions. [2018-12-31 05:25:41,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 05:25:41,097 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 198 transitions. [2018-12-31 05:25:41,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-31 05:25:41,098 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:25:41,098 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 05:25:41,105 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:25:41,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:25:41,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1693520079, now seen corresponding path program 1 times [2018-12-31 05:25:41,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:25:41,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:25:41,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:41,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:25:41,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:25:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 05:25:41,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 05:25:41,188 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 05:25:41,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 05:25:41 BoogieIcfgContainer [2018-12-31 05:25:41,254 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 05:25:41,255 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 05:25:41,255 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 05:25:41,255 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 05:25:41,255 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 05:25:27" (3/4) ... [2018-12-31 05:25:41,258 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 05:25:41,335 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 05:25:41,336 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 05:25:41,337 INFO L168 Benchmark]: Toolchain (without parser) took 15338.48 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 288.9 MB). Free memory was 952.7 MB in the beginning and 922.2 MB in the end (delta: 30.5 MB). Peak memory consumption was 319.4 MB. Max. memory is 11.5 GB. [2018-12-31 05:25:41,339 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 05:25:41,340 INFO L168 Benchmark]: CACSL2BoogieTranslator took 745.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -194.5 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. [2018-12-31 05:25:41,341 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.53 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 05:25:41,341 INFO L168 Benchmark]: Boogie Preprocessor took 63.99 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 05:25:41,342 INFO L168 Benchmark]: RCFGBuilder took 774.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.8 MB). Peak memory consumption was 32.8 MB. Max. memory is 11.5 GB. [2018-12-31 05:25:41,342 INFO L168 Benchmark]: TraceAbstraction took 13583.47 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 120.1 MB). Free memory was 1.1 GB in the beginning and 922.2 MB in the end (delta: 192.2 MB). Peak memory consumption was 312.2 MB. Max. memory is 11.5 GB. [2018-12-31 05:25:41,345 INFO L168 Benchmark]: Witness Printer took 81.50 ms. Allocated memory is still 1.3 GB. Free memory is still 922.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 05:25:41,349 INFO L336 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 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 745.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -194.5 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 82.53 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 63.99 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 774.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.8 MB). Peak memory consumption was 32.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13583.47 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 120.1 MB). Free memory was 1.1 GB in the beginning and 922.2 MB in the end (delta: 192.2 MB). Peak memory consumption was 312.2 MB. Max. memory is 11.5 GB. * Witness Printer took 81.50 ms. Allocated memory is still 1.3 GB. Free memory is still 922.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 630]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L609] int len = from; [L610] len < until && __VERIFIER_nondet_int() [L610] len < until && __VERIFIER_nondet_int() [L610] COND FALSE !(len < until && __VERIFIER_nondet_int()) [L613] return len; [L616] const int len = _get_nondet_int(2, 5); [L617] SLL s = sll_create(len); [L564] SLL head = ((void *)0); [L565] EXPR len-- [L565] COND TRUE len-- > 0 [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); [L567] COND FALSE !(((void *)0) == new_head) [L570] new_head->next = head [L571] head = new_head [L565] EXPR len-- [L565] COND TRUE len-- > 0 [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); [L567] COND FALSE !(((void *)0) == new_head) [L570] new_head->next = head [L571] head = new_head [L565] EXPR len-- [L565] COND FALSE !(len-- > 0) [L573] return head; [L617] SLL s = sll_create(len); [L609] int len = from; [L610] len < until && __VERIFIER_nondet_int() [L610] len < until && __VERIFIER_nondet_int() [L610] COND TRUE len < until && __VERIFIER_nondet_int() [L611] len++ [L610] len < until && __VERIFIER_nondet_int() [L610] COND FALSE !(len < until && __VERIFIER_nondet_int()) [L613] return len; [L618] const int k = _get_nondet_int(0, len - 1); [L619] int i = 0; [L620] i < k && __VERIFIER_nondet_int() [L620] i < k && __VERIFIER_nondet_int() [L620] COND FALSE !(i < k && __VERIFIER_nondet_int()) [L625] EXPR \read(s) [L576] int len = 0; [L577] COND TRUE \read(head) [L578] len++ [L579] EXPR head->next [L579] head = head->next [L577] COND TRUE \read(head) [L578] len++ [L579] EXPR head->next [L579] head = head->next [L577] COND FALSE !(\read(head)) [L581] return len; [L625] COND TRUE k + len != sll_length(s) [L630] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 47 locations, 1 error locations. UNSAFE Result, 13.5s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 5.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 512 SDtfs, 1659 SDslu, 2539 SDs, 0 SdLazy, 1207 SolverSat, 173 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 382 GetRequests, 227 SyntacticMatches, 9 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=157occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 441 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 588 NumberOfCodeBlocks, 584 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 533 ConstructedInterpolants, 3 QuantifiedInterpolants, 123727 SizeOfPredicates, 77 NumberOfNonLiveVariables, 1115 ConjunctsInSsa, 168 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 87/138 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...