./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ldv-regression/test25_false-unreach-call_true-termination.c --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/ldv-regression/test25_false-unreach-call_true-termination.c -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 ef8f82b31b77c43c96cf1b9cfaef9c4e99ae1632 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 04:23:15,585 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 04:23:15,587 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 04:23:15,602 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 04:23:15,603 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 04:23:15,604 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 04:23:15,605 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 04:23:15,606 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 04:23:15,608 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 04:23:15,609 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 04:23:15,610 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 04:23:15,610 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 04:23:15,611 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 04:23:15,612 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 04:23:15,613 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 04:23:15,614 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 04:23:15,615 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 04:23:15,617 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 04:23:15,619 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 04:23:15,620 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 04:23:15,621 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 04:23:15,623 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 04:23:15,625 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 04:23:15,626 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 04:23:15,626 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 04:23:15,627 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 04:23:15,628 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 04:23:15,629 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 04:23:15,630 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 04:23:15,631 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 04:23:15,631 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 04:23:15,632 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 04:23:15,632 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 04:23:15,632 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 04:23:15,633 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 04:23:15,634 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 04:23:15,635 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 04:23:15,650 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 04:23:15,650 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 04:23:15,652 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 04:23:15,652 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 04:23:15,652 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 04:23:15,652 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 04:23:15,653 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 04:23:15,653 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 04:23:15,653 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 04:23:15,653 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 04:23:15,653 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 04:23:15,653 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 04:23:15,654 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 04:23:15,654 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 04:23:15,654 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 04:23:15,654 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 04:23:15,654 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 04:23:15,655 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 04:23:15,655 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 04:23:15,655 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 04:23:15,655 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 04:23:15,655 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 04:23:15,656 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 04:23:15,656 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 04:23:15,656 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 04:23:15,656 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 04:23:15,656 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 04:23:15,657 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 04:23:15,657 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 -> ef8f82b31b77c43c96cf1b9cfaef9c4e99ae1632 [2018-12-31 04:23:15,724 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 04:23:15,742 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 04:23:15,748 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 04:23:15,750 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 04:23:15,750 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 04:23:15,752 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-regression/test25_false-unreach-call_true-termination.c [2018-12-31 04:23:15,816 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/292d52318/be1d85aaa09c45778c133c2c71ceb029/FLAG401361816 [2018-12-31 04:23:16,270 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 04:23:16,270 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-regression/test25_false-unreach-call_true-termination.c [2018-12-31 04:23:16,277 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/292d52318/be1d85aaa09c45778c133c2c71ceb029/FLAG401361816 [2018-12-31 04:23:16,642 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/292d52318/be1d85aaa09c45778c133c2c71ceb029 [2018-12-31 04:23:16,646 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 04:23:16,647 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 04:23:16,649 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 04:23:16,649 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 04:23:16,653 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 04:23:16,654 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 04:23:16" (1/1) ... [2018-12-31 04:23:16,658 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9ea98bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:16, skipping insertion in model container [2018-12-31 04:23:16,658 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 04:23:16" (1/1) ... [2018-12-31 04:23:16,667 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 04:23:16,690 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 04:23:16,959 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 04:23:16,973 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 04:23:17,012 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 04:23:17,038 INFO L195 MainTranslator]: Completed translation [2018-12-31 04:23:17,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:17 WrapperNode [2018-12-31 04:23:17,039 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 04:23:17,040 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 04:23:17,040 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 04:23:17,040 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 04:23:17,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:17" (1/1) ... [2018-12-31 04:23:17,060 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:17" (1/1) ... [2018-12-31 04:23:17,085 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 04:23:17,086 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 04:23:17,086 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 04:23:17,086 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 04:23:17,098 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:17" (1/1) ... [2018-12-31 04:23:17,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:17" (1/1) ... [2018-12-31 04:23:17,102 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:17" (1/1) ... [2018-12-31 04:23:17,102 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:17" (1/1) ... [2018-12-31 04:23:17,172 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:17" (1/1) ... [2018-12-31 04:23:17,187 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:17" (1/1) ... [2018-12-31 04:23:17,189 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:17" (1/1) ... [2018-12-31 04:23:17,196 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 04:23:17,197 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 04:23:17,197 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 04:23:17,197 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 04:23:17,203 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:17" (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 04:23:17,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 04:23:17,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-31 04:23:17,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 04:23:17,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 04:23:17,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-31 04:23:17,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-31 04:23:17,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 04:23:17,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 04:23:17,718 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 04:23:17,719 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-31 04:23:17,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:23:17 BoogieIcfgContainer [2018-12-31 04:23:17,719 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 04:23:17,721 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 04:23:17,721 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 04:23:17,725 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 04:23:17,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 04:23:16" (1/3) ... [2018-12-31 04:23:17,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@450cb27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 04:23:17, skipping insertion in model container [2018-12-31 04:23:17,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:23:17" (2/3) ... [2018-12-31 04:23:17,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@450cb27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 04:23:17, skipping insertion in model container [2018-12-31 04:23:17,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:23:17" (3/3) ... [2018-12-31 04:23:17,730 INFO L112 eAbstractionObserver]: Analyzing ICFG test25_false-unreach-call_true-termination.c [2018-12-31 04:23:17,741 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 04:23:17,752 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 04:23:17,771 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 04:23:17,805 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 04:23:17,806 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 04:23:17,806 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 04:23:17,806 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 04:23:17,807 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 04:23:17,807 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 04:23:17,807 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 04:23:17,807 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 04:23:17,807 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 04:23:17,824 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-12-31 04:23:17,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-31 04:23:17,831 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:23:17,833 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:23:17,835 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:23:17,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:23:17,842 INFO L82 PathProgramCache]: Analyzing trace with hash -631347226, now seen corresponding path program 1 times [2018-12-31 04:23:17,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:23:17,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:23:17,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:17,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:23:17,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:17,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:18,012 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 04:23:18,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:23:18,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 04:23:18,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 04:23:18,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 04:23:18,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 04:23:18,043 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2018-12-31 04:23:18,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:23:18,065 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2018-12-31 04:23:18,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 04:23:18,067 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-12-31 04:23:18,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:23:18,080 INFO L225 Difference]: With dead ends: 30 [2018-12-31 04:23:18,080 INFO L226 Difference]: Without dead ends: 13 [2018-12-31 04:23:18,084 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 04:23:18,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-31 04:23:18,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-31 04:23:18,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-31 04:23:18,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-12-31 04:23:18,128 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-12-31 04:23:18,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:23:18,128 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-12-31 04:23:18,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 04:23:18,129 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-12-31 04:23:18,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-31 04:23:18,129 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:23:18,130 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:23:18,130 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:23:18,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:23:18,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1697064536, now seen corresponding path program 1 times [2018-12-31 04:23:18,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:23:18,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:23:18,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:18,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:23:18,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:18,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:18,259 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 04:23:18,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:23:18,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 04:23:18,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 04:23:18,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 04:23:18,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 04:23:18,262 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2018-12-31 04:23:18,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:23:18,338 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-12-31 04:23:18,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 04:23:18,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-31 04:23:18,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:23:18,340 INFO L225 Difference]: With dead ends: 24 [2018-12-31 04:23:18,340 INFO L226 Difference]: Without dead ends: 15 [2018-12-31 04:23:18,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 04:23:18,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-31 04:23:18,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-12-31 04:23:18,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-31 04:23:18,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-12-31 04:23:18,345 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2018-12-31 04:23:18,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:23:18,346 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-12-31 04:23:18,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 04:23:18,346 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-12-31 04:23:18,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-31 04:23:18,347 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:23:18,347 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:23:18,347 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:23:18,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:23:18,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1434190826, now seen corresponding path program 1 times [2018-12-31 04:23:18,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:23:18,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:23:18,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:18,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:23:18,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:18,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:18,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:18,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:23:18,471 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 04:23:18,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:23:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:18,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:23:18,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:18,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:23:18,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-12-31 04:23:18,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 04:23:18,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 04:23:18,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-31 04:23:18,620 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2018-12-31 04:23:18,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:23:18,745 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-12-31 04:23:18,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 04:23:18,746 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-31 04:23:18,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:23:18,747 INFO L225 Difference]: With dead ends: 26 [2018-12-31 04:23:18,747 INFO L226 Difference]: Without dead ends: 17 [2018-12-31 04:23:18,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-31 04:23:18,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-31 04:23:18,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-12-31 04:23:18,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-31 04:23:18,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-12-31 04:23:18,753 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 13 [2018-12-31 04:23:18,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:23:18,753 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-12-31 04:23:18,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 04:23:18,754 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-12-31 04:23:18,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-31 04:23:18,755 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:23:18,755 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:23:18,756 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:23:18,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:23:18,756 INFO L82 PathProgramCache]: Analyzing trace with hash 201480788, now seen corresponding path program 2 times [2018-12-31 04:23:18,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:23:18,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:23:18,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:18,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:23:18,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:18,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:18,855 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:18,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:23:18,856 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 04:23:18,870 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 04:23:18,916 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-31 04:23:18,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 04:23:18,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:23:19,113 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 17 treesize of output 13 [2018-12-31 04:23:19,129 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-12-31 04:23:19,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:23:19,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:19,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:19,163 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-12-31 04:23:19,212 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-31 04:23:19,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-31 04:23:19,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2018-12-31 04:23:19,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 04:23:19,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 04:23:19,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-31 04:23:19,234 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 8 states. [2018-12-31 04:23:19,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:23:19,557 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-12-31 04:23:19,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 04:23:19,558 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-12-31 04:23:19,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:23:19,558 INFO L225 Difference]: With dead ends: 30 [2018-12-31 04:23:19,559 INFO L226 Difference]: Without dead ends: 21 [2018-12-31 04:23:19,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-31 04:23:19,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-31 04:23:19,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-12-31 04:23:19,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-31 04:23:19,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-12-31 04:23:19,563 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 15 [2018-12-31 04:23:19,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:23:19,564 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-12-31 04:23:19,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 04:23:19,564 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-12-31 04:23:19,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-31 04:23:19,565 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:23:19,565 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:23:19,565 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:23:19,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:23:19,566 INFO L82 PathProgramCache]: Analyzing trace with hash 291228695, now seen corresponding path program 1 times [2018-12-31 04:23:19,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:23:19,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:23:19,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:19,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 04:23:19,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:19,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:19,758 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 04:23:19,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:23:19,759 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 04:23:19,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:23:19,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:19,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:23:19,856 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 04:23:19,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:23:19,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-12-31 04:23:19,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 04:23:19,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 04:23:19,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-31 04:23:19,881 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 7 states. [2018-12-31 04:23:19,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:23:19,944 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-12-31 04:23:19,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 04:23:19,946 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-12-31 04:23:19,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:23:19,948 INFO L225 Difference]: With dead ends: 34 [2018-12-31 04:23:19,948 INFO L226 Difference]: Without dead ends: 23 [2018-12-31 04:23:19,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-31 04:23:19,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-31 04:23:19,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-12-31 04:23:19,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-31 04:23:19,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-12-31 04:23:19,953 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 19 [2018-12-31 04:23:19,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:23:19,954 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-12-31 04:23:19,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 04:23:19,954 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-12-31 04:23:19,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-31 04:23:19,955 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:23:19,955 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:23:19,955 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:23:19,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:23:19,956 INFO L82 PathProgramCache]: Analyzing trace with hash 903742421, now seen corresponding path program 2 times [2018-12-31 04:23:19,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:23:19,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:23:19,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:19,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:23:19,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:20,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:20,200 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 04:23:20,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:23:20,201 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 04:23:20,214 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 04:23:20,269 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 04:23:20,269 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 04:23:20,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:23:20,374 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 04:23:20,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:23:20,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-12-31 04:23:20,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 04:23:20,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 04:23:20,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-31 04:23:20,415 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 8 states. [2018-12-31 04:23:20,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:23:20,617 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-12-31 04:23:20,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 04:23:20,621 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-12-31 04:23:20,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:23:20,621 INFO L225 Difference]: With dead ends: 36 [2018-12-31 04:23:20,622 INFO L226 Difference]: Without dead ends: 25 [2018-12-31 04:23:20,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-31 04:23:20,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-31 04:23:20,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-12-31 04:23:20,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-31 04:23:20,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-12-31 04:23:20,626 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 21 [2018-12-31 04:23:20,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:23:20,627 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-12-31 04:23:20,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 04:23:20,627 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-12-31 04:23:20,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-31 04:23:20,628 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:23:20,628 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:23:20,628 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:23:20,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:23:20,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1118913555, now seen corresponding path program 3 times [2018-12-31 04:23:20,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:23:20,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:23:20,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:20,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 04:23:20,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:20,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:21,359 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 04:23:21,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:23:21,359 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 04:23:21,379 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 04:23:21,431 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-31 04:23:21,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 04:23:21,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:23:21,596 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 17 treesize of output 13 [2018-12-31 04:23:21,599 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-12-31 04:23:21,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:23:21,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:21,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:21,608 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-12-31 04:23:21,642 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-31 04:23:21,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:23:21,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-12-31 04:23:21,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-31 04:23:21,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-31 04:23:21,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-31 04:23:21,670 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 12 states. [2018-12-31 04:23:21,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:23:21,927 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-12-31 04:23:21,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-31 04:23:21,928 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-12-31 04:23:21,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:23:21,929 INFO L225 Difference]: With dead ends: 40 [2018-12-31 04:23:21,929 INFO L226 Difference]: Without dead ends: 29 [2018-12-31 04:23:21,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-12-31 04:23:21,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-31 04:23:21,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-12-31 04:23:21,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-31 04:23:21,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-12-31 04:23:21,935 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 23 [2018-12-31 04:23:21,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:23:21,935 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-12-31 04:23:21,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-31 04:23:21,935 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-12-31 04:23:21,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-31 04:23:21,936 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:23:21,936 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:23:21,937 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:23:21,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:23:21,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1442110442, now seen corresponding path program 4 times [2018-12-31 04:23:21,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:23:21,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:23:21,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:21,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 04:23:21,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:21,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:22,214 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-31 04:23:22,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:23:22,215 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 04:23:22,231 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-31 04:23:22,251 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-31 04:23:22,251 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 04:23:22,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:23:22,367 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 17 treesize of output 13 [2018-12-31 04:23:22,374 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-12-31 04:23:22,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:23:22,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:22,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:22,380 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-12-31 04:23:22,396 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-31 04:23:22,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:23:22,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2018-12-31 04:23:22,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-31 04:23:22,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-31 04:23:22,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-31 04:23:22,416 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 14 states. [2018-12-31 04:23:22,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:23:22,651 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2018-12-31 04:23:22,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-31 04:23:22,652 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2018-12-31 04:23:22,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:23:22,653 INFO L225 Difference]: With dead ends: 46 [2018-12-31 04:23:22,653 INFO L226 Difference]: Without dead ends: 33 [2018-12-31 04:23:22,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2018-12-31 04:23:22,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-31 04:23:22,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-12-31 04:23:22,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-31 04:23:22,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-12-31 04:23:22,660 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 27 [2018-12-31 04:23:22,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:23:22,660 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2018-12-31 04:23:22,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-31 04:23:22,660 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-12-31 04:23:22,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-31 04:23:22,661 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:23:22,661 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:23:22,662 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:23:22,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:23:22,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1005994073, now seen corresponding path program 5 times [2018-12-31 04:23:22,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:23:22,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:23:22,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:22,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 04:23:22,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:22,800 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-31 04:23:22,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:23:22,800 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 04:23:22,816 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-31 04:23:25,388 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-12-31 04:23:25,388 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 04:23:25,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:23:25,419 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-31 04:23:25,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:23:25,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-12-31 04:23:25,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 04:23:25,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 04:23:25,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-31 04:23:25,448 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 11 states. [2018-12-31 04:23:25,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:23:25,515 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-12-31 04:23:25,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 04:23:25,523 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2018-12-31 04:23:25,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:23:25,524 INFO L225 Difference]: With dead ends: 50 [2018-12-31 04:23:25,524 INFO L226 Difference]: Without dead ends: 35 [2018-12-31 04:23:25,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-31 04:23:25,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-31 04:23:25,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-12-31 04:23:25,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-31 04:23:25,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-12-31 04:23:25,541 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 31 [2018-12-31 04:23:25,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:23:25,542 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-12-31 04:23:25,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 04:23:25,542 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-12-31 04:23:25,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-31 04:23:25,546 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:23:25,547 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:23:25,548 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:23:25,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:23:25,548 INFO L82 PathProgramCache]: Analyzing trace with hash -652424425, now seen corresponding path program 6 times [2018-12-31 04:23:25,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:23:25,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:23:25,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:25,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 04:23:25,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:25,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:25,823 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-31 04:23:25,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:23:25,824 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 04:23:25,836 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-31 04:23:27,695 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-12-31 04:23:27,695 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 04:23:27,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:23:27,827 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 17 treesize of output 13 [2018-12-31 04:23:27,829 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-12-31 04:23:27,830 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:23:27,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:27,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:27,856 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-12-31 04:23:27,877 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-31 04:23:27,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:23:27,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2018-12-31 04:23:27,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-31 04:23:27,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-31 04:23:27,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-12-31 04:23:27,900 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 17 states. [2018-12-31 04:23:28,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:23:28,134 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2018-12-31 04:23:28,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-31 04:23:28,135 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 33 [2018-12-31 04:23:28,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:23:28,137 INFO L225 Difference]: With dead ends: 54 [2018-12-31 04:23:28,137 INFO L226 Difference]: Without dead ends: 39 [2018-12-31 04:23:28,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2018-12-31 04:23:28,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-31 04:23:28,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-12-31 04:23:28,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-31 04:23:28,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-12-31 04:23:28,141 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 33 [2018-12-31 04:23:28,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:23:28,142 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-12-31 04:23:28,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-31 04:23:28,142 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-12-31 04:23:28,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-31 04:23:28,143 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:23:28,143 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:23:28,143 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:23:28,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:23:28,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1671756646, now seen corresponding path program 7 times [2018-12-31 04:23:28,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:23:28,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:23:28,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:28,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 04:23:28,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:28,341 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-31 04:23:28,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:23:28,342 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 04:23:28,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:23:28,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:28,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:23:28,448 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-31 04:23:28,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:23:28,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-12-31 04:23:28,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-31 04:23:28,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-31 04:23:28,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-31 04:23:28,470 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 13 states. [2018-12-31 04:23:28,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:23:28,569 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-12-31 04:23:28,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 04:23:28,570 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2018-12-31 04:23:28,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:23:28,571 INFO L225 Difference]: With dead ends: 57 [2018-12-31 04:23:28,571 INFO L226 Difference]: Without dead ends: 40 [2018-12-31 04:23:28,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-31 04:23:28,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-31 04:23:28,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-31 04:23:28,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-31 04:23:28,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-12-31 04:23:28,576 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 37 [2018-12-31 04:23:28,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:23:28,576 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-12-31 04:23:28,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-31 04:23:28,576 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-12-31 04:23:28,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-31 04:23:28,577 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:23:28,577 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:23:28,577 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:23:28,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:23:28,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1546516264, now seen corresponding path program 8 times [2018-12-31 04:23:28,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:23:28,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:23:28,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:28,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:23:28,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:28,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:29,655 WARN L181 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 9 [2018-12-31 04:23:30,002 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 20 [2018-12-31 04:23:30,355 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 9 [2018-12-31 04:23:30,447 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-31 04:23:30,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:23:30,448 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 04:23:30,467 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 04:23:30,524 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 04:23:30,524 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 04:23:30,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:23:31,346 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 25 treesize of output 21 [2018-12-31 04:23:31,348 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-12-31 04:23:31,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:23:31,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:31,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:31,358 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:5 [2018-12-31 04:23:31,364 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 116 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-31 04:23:31,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:23:31,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18] total 27 [2018-12-31 04:23:31,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-31 04:23:31,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-31 04:23:31,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=581, Unknown=0, NotChecked=0, Total=702 [2018-12-31 04:23:31,385 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 27 states. [2018-12-31 04:23:32,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:23:32,448 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2018-12-31 04:23:32,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-31 04:23:32,449 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 39 [2018-12-31 04:23:32,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:23:32,450 INFO L225 Difference]: With dead ends: 47 [2018-12-31 04:23:32,451 INFO L226 Difference]: Without dead ends: 42 [2018-12-31 04:23:32,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=279, Invalid=1127, Unknown=0, NotChecked=0, Total=1406 [2018-12-31 04:23:32,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-31 04:23:32,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-31 04:23:32,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-31 04:23:32,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-12-31 04:23:32,459 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 39 [2018-12-31 04:23:32,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:23:32,459 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-12-31 04:23:32,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-31 04:23:32,460 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-12-31 04:23:32,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-31 04:23:32,460 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:23:32,461 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:23:32,461 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:23:32,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:23:32,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1366350429, now seen corresponding path program 9 times [2018-12-31 04:23:32,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:23:32,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:23:32,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:32,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 04:23:32,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:33,349 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 8 [2018-12-31 04:23:33,620 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 11 [2018-12-31 04:23:33,806 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 20 [2018-12-31 04:23:33,997 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 12 [2018-12-31 04:23:34,151 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-12-31 04:23:34,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 04:23:34,152 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 04:23:34,161 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 04:23:34,715 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-31 04:23:34,715 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 04:23:34,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 04:23:34,734 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 15 treesize of output 12 [2018-12-31 04:23:34,737 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 12 treesize of output 1 [2018-12-31 04:23:34,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:23:34,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:34,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:34,744 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:12 [2018-12-31 04:23:34,859 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 17 treesize of output 13 [2018-12-31 04:23:34,874 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-12-31 04:23:34,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 04:23:34,898 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:34,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 04:23:34,922 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-12-31 04:23:34,968 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-31 04:23:34,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 04:23:34,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 21 [2018-12-31 04:23:34,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-31 04:23:34,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-31 04:23:34,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2018-12-31 04:23:34,992 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 21 states. [2018-12-31 04:23:35,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:23:35,438 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-12-31 04:23:35,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-31 04:23:35,439 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 41 [2018-12-31 04:23:35,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:23:35,440 INFO L225 Difference]: With dead ends: 57 [2018-12-31 04:23:35,441 INFO L226 Difference]: Without dead ends: 52 [2018-12-31 04:23:35,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=493, Invalid=1229, Unknown=0, NotChecked=0, Total=1722 [2018-12-31 04:23:35,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-31 04:23:35,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-31 04:23:35,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-31 04:23:35,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2018-12-31 04:23:35,456 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 41 [2018-12-31 04:23:35,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:23:35,456 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2018-12-31 04:23:35,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-31 04:23:35,457 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2018-12-31 04:23:35,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-31 04:23:35,459 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:23:35,459 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:23:35,459 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:23:35,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:23:35,460 INFO L82 PathProgramCache]: Analyzing trace with hash 562473782, now seen corresponding path program 10 times [2018-12-31 04:23:35,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:23:35,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:23:35,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:35,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 04:23:35,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:23:35,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 04:23:35,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 04:23:35,878 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 04:23:35,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 04:23:35 BoogieIcfgContainer [2018-12-31 04:23:35,931 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 04:23:35,932 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 04:23:35,932 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 04:23:35,932 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 04:23:35,933 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:23:17" (3/4) ... [2018-12-31 04:23:35,935 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 04:23:36,012 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 04:23:36,012 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 04:23:36,013 INFO L168 Benchmark]: Toolchain (without parser) took 19367.24 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 293.6 MB). Free memory was 948.7 MB in the beginning and 946.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 296.2 MB. Max. memory is 11.5 GB. [2018-12-31 04:23:36,014 INFO L168 Benchmark]: CDTParser took 0.49 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 04:23:36,015 INFO L168 Benchmark]: CACSL2BoogieTranslator took 390.71 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-31 04:23:36,015 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.50 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-31 04:23:36,016 INFO L168 Benchmark]: Boogie Preprocessor took 110.79 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -170.5 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2018-12-31 04:23:36,016 INFO L168 Benchmark]: RCFGBuilder took 522.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-31 04:23:36,017 INFO L168 Benchmark]: TraceAbstraction took 18210.49 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 178.8 MB). Free memory was 1.1 GB in the beginning and 955.0 MB in the end (delta: 123.3 MB). Peak memory consumption was 302.1 MB. Max. memory is 11.5 GB. [2018-12-31 04:23:36,017 INFO L168 Benchmark]: Witness Printer took 80.69 ms. Allocated memory is still 1.3 GB. Free memory was 955.0 MB in the beginning and 946.1 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. [2018-12-31 04:23:36,021 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.49 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 390.71 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.50 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 110.79 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -170.5 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 522.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18210.49 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 178.8 MB). Free memory was 1.1 GB in the beginning and 955.0 MB in the end (delta: 123.3 MB). Peak memory consumption was 302.1 MB. Max. memory is 11.5 GB. * Witness Printer took 80.69 ms. Allocated memory is still 1.3 GB. Free memory was 955.0 MB in the beginning and 946.1 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 45]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L19] struct cont cont; [L20] struct dummy array[10]; [L21] int i, *pa; [L22] i = __VERIFIER_nondet_int() [L24] int j = 0; [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ [L24] COND FALSE !(j < 10) [L29] COND TRUE i >= 0 && i < 9 [L30] cont.array = &array[i] [L31] EXPR cont.array [L31] pa = &cont.array[0].b [L32] EXPR cont.array [L32] EXPR cont.array[0].b [L32] COND TRUE cont.array[0].b > 0 [L33] EXPR array[i].b [L33] i = array[i].b - 10 [L34] EXPR \read(*pa) [L34] COND TRUE i < *pa [L35] ++i [L34] EXPR \read(*pa) [L34] COND TRUE i < *pa [L35] ++i [L34] EXPR \read(*pa) [L34] COND TRUE i < *pa [L35] ++i [L34] EXPR \read(*pa) [L34] COND TRUE i < *pa [L35] ++i [L34] EXPR \read(*pa) [L34] COND TRUE i < *pa [L35] ++i [L34] EXPR \read(*pa) [L34] COND TRUE i < *pa [L35] ++i [L34] EXPR \read(*pa) [L34] COND TRUE i < *pa [L35] ++i [L34] EXPR \read(*pa) [L34] COND TRUE i < *pa [L35] ++i [L34] EXPR \read(*pa) [L34] COND TRUE i < *pa [L35] ++i [L34] EXPR \read(*pa) [L34] COND TRUE i < *pa [L35] ++i [L34] EXPR \read(*pa) [L34] COND FALSE !(i < *pa) [L14] EXPR pc->array [L14] EXPR pc->array[1].b [L14] return pc->array[1].b == i; [L37] COND TRUE !check(&cont, i) [L45] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. UNSAFE Result, 18.1s OverallTime, 14 OverallIterations, 11 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 145 SDtfs, 114 SDslu, 702 SDs, 0 SdLazy, 962 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 456 GetRequests, 283 SyntacticMatches, 9 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 929 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=13, 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.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 9 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 6.2s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 670 NumberOfCodeBlocks, 635 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 595 ConstructedInterpolants, 9 QuantifiedInterpolants, 59501 SizeOfPredicates, 71 NumberOfNonLiveVariables, 1416 ConjunctsInSsa, 134 ConjunctsInUnsatCore, 24 InterpolantComputations, 3 PerfectInterpolantSequences, 397/1182 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...