./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/loops/sum03_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/loops/sum03_false-unreach-call_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a5bec83c84f47b7653d49cdbe6bc7857a2bc0080 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 05:38:25,012 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 05:38:25,014 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 05:38:25,026 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 05:38:25,027 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 05:38:25,028 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 05:38:25,029 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 05:38:25,031 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 05:38:25,033 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 05:38:25,034 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 05:38:25,035 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 05:38:25,036 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 05:38:25,037 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 05:38:25,038 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 05:38:25,039 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 05:38:25,040 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 05:38:25,041 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 05:38:25,043 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 05:38:25,045 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 05:38:25,047 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 05:38:25,048 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 05:38:25,049 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 05:38:25,052 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 05:38:25,052 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 05:38:25,053 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 05:38:25,054 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 05:38:25,055 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 05:38:25,056 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 05:38:25,057 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 05:38:25,058 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 05:38:25,058 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 05:38:25,059 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 05:38:25,059 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 05:38:25,060 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 05:38:25,061 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 05:38:25,062 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 05:38:25,063 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 05:38:25,078 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 05:38:25,079 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 05:38:25,080 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 05:38:25,080 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 05:38:25,080 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 05:38:25,080 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 05:38:25,081 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 05:38:25,082 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 05:38:25,082 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 05:38:25,082 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 05:38:25,082 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 05:38:25,082 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 05:38:25,082 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 05:38:25,083 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 05:38:25,083 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 05:38:25,084 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 05:38:25,084 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 05:38:25,084 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 05:38:25,084 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 05:38:25,084 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 05:38:25,085 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 05:38:25,086 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 05:38:25,086 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 05:38:25,086 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 05:38:25,086 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 05:38:25,086 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 05:38:25,087 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 05:38:25,087 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 05:38:25,087 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 -> a5bec83c84f47b7653d49cdbe6bc7857a2bc0080 [2018-12-31 05:38:25,150 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 05:38:25,166 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 05:38:25,174 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 05:38:25,176 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 05:38:25,176 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 05:38:25,178 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loops/sum03_false-unreach-call_true-termination.i [2018-12-31 05:38:25,238 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c8570d05/da4ac74fd0e84ad690a52656ff8c9325/FLAG9ce5dcdd6 [2018-12-31 05:38:25,693 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 05:38:25,694 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loops/sum03_false-unreach-call_true-termination.i [2018-12-31 05:38:25,703 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c8570d05/da4ac74fd0e84ad690a52656ff8c9325/FLAG9ce5dcdd6 [2018-12-31 05:38:26,049 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c8570d05/da4ac74fd0e84ad690a52656ff8c9325 [2018-12-31 05:38:26,052 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 05:38:26,053 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 05:38:26,054 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 05:38:26,054 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 05:38:26,058 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 05:38:26,059 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 05:38:26" (1/1) ... [2018-12-31 05:38:26,062 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fee0a95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:38:26, skipping insertion in model container [2018-12-31 05:38:26,062 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 05:38:26" (1/1) ... [2018-12-31 05:38:26,070 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 05:38:26,088 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 05:38:26,298 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 05:38:26,303 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 05:38:26,318 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 05:38:26,331 INFO L195 MainTranslator]: Completed translation [2018-12-31 05:38:26,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:38:26 WrapperNode [2018-12-31 05:38:26,332 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 05:38:26,333 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 05:38:26,333 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 05:38:26,333 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 05:38:26,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:38:26" (1/1) ... [2018-12-31 05:38:26,347 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:38:26" (1/1) ... [2018-12-31 05:38:26,365 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 05:38:26,366 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 05:38:26,366 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 05:38:26,366 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 05:38:26,374 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:38:26" (1/1) ... [2018-12-31 05:38:26,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:38:26" (1/1) ... [2018-12-31 05:38:26,374 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:38:26" (1/1) ... [2018-12-31 05:38:26,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:38:26" (1/1) ... [2018-12-31 05:38:26,377 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:38:26" (1/1) ... [2018-12-31 05:38:26,382 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:38:26" (1/1) ... [2018-12-31 05:38:26,383 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:38:26" (1/1) ... [2018-12-31 05:38:26,384 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 05:38:26,384 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 05:38:26,384 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 05:38:26,385 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 05:38:26,385 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:38:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 05:38:26,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 05:38:26,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 05:38:26,682 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 05:38:26,682 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-31 05:38:26,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 05:38:26 BoogieIcfgContainer [2018-12-31 05:38:26,683 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 05:38:26,683 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 05:38:26,683 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 05:38:26,686 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 05:38:26,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 05:38:26" (1/3) ... [2018-12-31 05:38:26,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35391780 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 05:38:26, skipping insertion in model container [2018-12-31 05:38:26,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:38:26" (2/3) ... [2018-12-31 05:38:26,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35391780 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 05:38:26, skipping insertion in model container [2018-12-31 05:38:26,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 05:38:26" (3/3) ... [2018-12-31 05:38:26,690 INFO L112 eAbstractionObserver]: Analyzing ICFG sum03_false-unreach-call_true-termination.i [2018-12-31 05:38:26,698 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 05:38:26,705 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 05:38:26,723 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 05:38:26,756 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 05:38:26,757 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 05:38:26,757 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 05:38:26,757 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 05:38:26,757 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 05:38:26,757 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 05:38:26,757 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 05:38:26,757 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 05:38:26,758 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 05:38:26,773 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2018-12-31 05:38:26,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-31 05:38:26,780 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:38:26,781 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-31 05:38:26,783 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:38:26,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:38:26,790 INFO L82 PathProgramCache]: Analyzing trace with hash 925772304, now seen corresponding path program 1 times [2018-12-31 05:38:26,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:38:26,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:38:26,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:38:26,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:38:26,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:38:26,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:38:27,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:38:27,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 05:38:27,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 05:38:27,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 05:38:27,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 05:38:27,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 05:38:27,241 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 5 states. [2018-12-31 05:38:27,541 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-12-31 05:38:29,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:38:29,810 INFO L93 Difference]: Finished difference Result 25 states and 39 transitions. [2018-12-31 05:38:29,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 05:38:29,812 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2018-12-31 05:38:29,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:38:29,824 INFO L225 Difference]: With dead ends: 25 [2018-12-31 05:38:29,824 INFO L226 Difference]: Without dead ends: 16 [2018-12-31 05:38:29,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 05:38:29,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-31 05:38:29,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2018-12-31 05:38:29,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-31 05:38:29,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-12-31 05:38:29,865 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 6 [2018-12-31 05:38:29,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:38:29,865 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-12-31 05:38:29,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 05:38:29,865 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2018-12-31 05:38:29,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-31 05:38:29,866 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:38:29,866 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-31 05:38:29,866 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:38:29,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:38:29,867 INFO L82 PathProgramCache]: Analyzing trace with hash 925831886, now seen corresponding path program 1 times [2018-12-31 05:38:29,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:38:29,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:38:29,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:38:29,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:38:29,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:38:29,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:38:29,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:38:29,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 05:38:29,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 05:38:29,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 05:38:29,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 05:38:29,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 05:38:29,920 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 4 states. [2018-12-31 05:38:30,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:38:30,097 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2018-12-31 05:38:30,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 05:38:30,098 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-12-31 05:38:30,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:38:30,098 INFO L225 Difference]: With dead ends: 21 [2018-12-31 05:38:30,099 INFO L226 Difference]: Without dead ends: 19 [2018-12-31 05:38:30,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 05:38:30,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-31 05:38:30,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-12-31 05:38:30,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-31 05:38:30,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2018-12-31 05:38:30,105 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 6 [2018-12-31 05:38:30,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:38:30,105 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-12-31 05:38:30,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 05:38:30,105 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2018-12-31 05:38:30,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-31 05:38:30,106 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:38:30,106 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-12-31 05:38:30,106 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:38:30,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:38:30,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1221646083, now seen corresponding path program 1 times [2018-12-31 05:38:30,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:38:30,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:38:30,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:38:30,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:38:30,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:38:30,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:38:30,413 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-12-31 05:38:30,421 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:38:30,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:38:30,421 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:38:30,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:38:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:38:30,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:38:30,532 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:38:30,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:38:30,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2018-12-31 05:38:30,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 05:38:30,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 05:38:30,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 05:38:30,554 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 5 states. [2018-12-31 05:38:30,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:38:30,594 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2018-12-31 05:38:30,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 05:38:30,596 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-12-31 05:38:30,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:38:30,598 INFO L225 Difference]: With dead ends: 28 [2018-12-31 05:38:30,598 INFO L226 Difference]: Without dead ends: 18 [2018-12-31 05:38:30,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 05:38:30,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-31 05:38:30,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-12-31 05:38:30,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-31 05:38:30,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-12-31 05:38:30,603 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 10 [2018-12-31 05:38:30,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:38:30,604 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-12-31 05:38:30,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 05:38:30,604 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-12-31 05:38:30,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-31 05:38:30,605 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:38:30,605 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1] [2018-12-31 05:38:30,605 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:38:30,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:38:30,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1859877048, now seen corresponding path program 2 times [2018-12-31 05:38:30,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:38:30,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:38:30,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:38:30,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:38:30,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:38:30,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:38:30,758 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:38:30,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:38:30,758 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:38:30,774 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 05:38:30,806 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 05:38:30,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:38:30,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:38:30,929 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:38:30,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:38:30,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-12-31 05:38:30,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 05:38:30,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 05:38:30,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 05:38:30,950 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 6 states. [2018-12-31 05:38:31,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:38:31,106 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-12-31 05:38:31,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 05:38:31,107 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-12-31 05:38:31,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:38:31,107 INFO L225 Difference]: With dead ends: 28 [2018-12-31 05:38:31,107 INFO L226 Difference]: Without dead ends: 22 [2018-12-31 05:38:31,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-31 05:38:31,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-31 05:38:31,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-12-31 05:38:31,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-31 05:38:31,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-12-31 05:38:31,114 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 14 [2018-12-31 05:38:31,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:38:31,114 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-12-31 05:38:31,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 05:38:31,115 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-12-31 05:38:31,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-31 05:38:31,115 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:38:31,115 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1] [2018-12-31 05:38:31,116 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:38:31,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:38:31,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1722038253, now seen corresponding path program 3 times [2018-12-31 05:38:31,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:38:31,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:38:31,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:38:31,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:38:31,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:38:31,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:38:31,368 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:38:31,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:38:31,369 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:38:31,378 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 05:38:43,537 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-31 05:38:43,537 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:38:43,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:38:43,578 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:38:43,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:38:43,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-12-31 05:38:43,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 05:38:43,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 05:38:43,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 05:38:43,608 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 7 states. [2018-12-31 05:38:43,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:38:43,851 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-12-31 05:38:43,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 05:38:43,852 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-12-31 05:38:43,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:38:43,853 INFO L225 Difference]: With dead ends: 32 [2018-12-31 05:38:43,854 INFO L226 Difference]: Without dead ends: 26 [2018-12-31 05:38:43,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 05:38:43,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-31 05:38:43,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-12-31 05:38:43,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-31 05:38:43,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-12-31 05:38:43,868 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 18 [2018-12-31 05:38:43,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:38:43,869 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-12-31 05:38:43,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 05:38:43,869 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-12-31 05:38:43,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-31 05:38:43,873 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:38:43,873 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1] [2018-12-31 05:38:43,874 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:38:43,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:38:43,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1059040094, now seen corresponding path program 4 times [2018-12-31 05:38:43,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:38:43,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:38:43,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:38:43,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:38:43,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:38:43,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:38:44,176 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:38:44,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:38:44,177 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:38:44,196 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-31 05:38:44,245 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-31 05:38:44,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:38:44,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:38:44,347 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:38:44,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:38:44,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-12-31 05:38:44,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 05:38:44,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 05:38:44,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-31 05:38:44,367 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 8 states. [2018-12-31 05:38:44,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:38:44,553 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-12-31 05:38:44,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 05:38:44,555 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-12-31 05:38:44,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:38:44,556 INFO L225 Difference]: With dead ends: 36 [2018-12-31 05:38:44,556 INFO L226 Difference]: Without dead ends: 30 [2018-12-31 05:38:44,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-31 05:38:44,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-31 05:38:44,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-12-31 05:38:44,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-31 05:38:44,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-12-31 05:38:44,563 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 22 [2018-12-31 05:38:44,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:38:44,563 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-12-31 05:38:44,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 05:38:44,564 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-12-31 05:38:44,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-31 05:38:44,564 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:38:44,565 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1] [2018-12-31 05:38:44,565 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:38:44,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:38:44,565 INFO L82 PathProgramCache]: Analyzing trace with hash 832900823, now seen corresponding path program 5 times [2018-12-31 05:38:44,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:38:44,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:38:44,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:38:44,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:38:44,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:38:44,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:38:44,763 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:38:44,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:38:44,764 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:38:44,776 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-31 05:39:07,557 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-12-31 05:39:07,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:39:07,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:39:07,641 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:39:07,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:39:07,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-12-31 05:39:07,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 05:39:07,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 05:39:07,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-31 05:39:07,664 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 9 states. [2018-12-31 05:39:07,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:39:07,808 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-12-31 05:39:07,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 05:39:07,809 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-12-31 05:39:07,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:39:07,810 INFO L225 Difference]: With dead ends: 40 [2018-12-31 05:39:07,810 INFO L226 Difference]: Without dead ends: 34 [2018-12-31 05:39:07,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-31 05:39:07,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-31 05:39:07,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-12-31 05:39:07,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-31 05:39:07,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-12-31 05:39:07,817 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 26 [2018-12-31 05:39:07,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:39:07,817 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-12-31 05:39:07,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 05:39:07,818 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-12-31 05:39:07,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-31 05:39:07,819 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:39:07,819 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1, 1, 1] [2018-12-31 05:39:07,819 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:39:07,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:39:07,820 INFO L82 PathProgramCache]: Analyzing trace with hash -530078068, now seen corresponding path program 6 times [2018-12-31 05:39:07,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:39:07,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:39:07,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:39:07,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:39:07,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:39:07,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:39:08,223 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:39:08,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:39:08,224 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:39:08,234 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-31 05:39:44,812 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-12-31 05:39:44,812 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:39:44,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:39:45,195 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:39:45,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:39:45,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12] total 16 [2018-12-31 05:39:45,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-31 05:39:45,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-31 05:39:45,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-12-31 05:39:45,217 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 17 states. [2018-12-31 05:39:45,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:39:45,444 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-12-31 05:39:45,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 05:39:45,446 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2018-12-31 05:39:45,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:39:45,447 INFO L225 Difference]: With dead ends: 44 [2018-12-31 05:39:45,447 INFO L226 Difference]: Without dead ends: 38 [2018-12-31 05:39:45,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-12-31 05:39:45,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-31 05:39:45,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-12-31 05:39:45,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-31 05:39:45,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-12-31 05:39:45,455 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 30 [2018-12-31 05:39:45,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:39:45,455 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-12-31 05:39:45,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-31 05:39:45,456 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-12-31 05:39:45,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-31 05:39:45,457 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:39:45,457 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1, 1, 1] [2018-12-31 05:39:45,457 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:39:45,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:39:45,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1208132671, now seen corresponding path program 7 times [2018-12-31 05:39:45,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:39:45,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:39:45,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:39:45,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:39:45,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:39:45,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:39:45,682 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 14 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:39:45,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:39:45,682 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-31 05:39:45,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:39:45,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:39:45,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:39:45,874 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 14 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:39:45,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:39:45,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-12-31 05:39:45,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-31 05:39:45,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-31 05:39:45,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-12-31 05:39:45,895 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 11 states. [2018-12-31 05:39:46,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:39:46,397 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-12-31 05:39:46,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 05:39:46,400 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2018-12-31 05:39:46,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:39:46,401 INFO L225 Difference]: With dead ends: 48 [2018-12-31 05:39:46,401 INFO L226 Difference]: Without dead ends: 42 [2018-12-31 05:39:46,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-12-31 05:39:46,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-31 05:39:46,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-12-31 05:39:46,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-31 05:39:46,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-12-31 05:39:46,410 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 34 [2018-12-31 05:39:46,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:39:46,411 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-12-31 05:39:46,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-31 05:39:46,411 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-12-31 05:39:46,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-31 05:39:46,412 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:39:46,412 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1, 1, 1] [2018-12-31 05:39:46,413 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:39:46,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:39:46,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1231327626, now seen corresponding path program 8 times [2018-12-31 05:39:46,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:39:46,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:39:46,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:39:46,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 05:39:46,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:39:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:39:46,843 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:39:46,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:39:46,843 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 05:39:46,854 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-31 05:39:46,892 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-31 05:39:46,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:39:46,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:39:47,262 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:39:47,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:39:47,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-12-31 05:39:47,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-31 05:39:47,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-31 05:39:47,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-12-31 05:39:47,302 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 12 states. [2018-12-31 05:39:48,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:39:48,360 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-12-31 05:39:48,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-31 05:39:48,361 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2018-12-31 05:39:48,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:39:48,362 INFO L225 Difference]: With dead ends: 52 [2018-12-31 05:39:48,362 INFO L226 Difference]: Without dead ends: 46 [2018-12-31 05:39:48,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-12-31 05:39:48,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-31 05:39:48,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-12-31 05:39:48,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-31 05:39:48,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-12-31 05:39:48,369 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 38 [2018-12-31 05:39:48,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:39:48,369 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-12-31 05:39:48,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-31 05:39:48,369 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-12-31 05:39:48,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-31 05:39:48,370 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:39:48,370 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1, 1, 1] [2018-12-31 05:39:48,371 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:39:48,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:39:48,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1037508267, now seen corresponding path program 9 times [2018-12-31 05:39:48,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:39:48,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:39:48,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:39:48,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:39:48,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:39:48,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 05:39:48,736 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:39:48,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-31 05:39:48,737 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 05:39:48,751 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-31 05:41:16,083 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-31 05:41:16,083 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-31 05:41:16,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 05:41:16,189 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 05:41:16,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-31 05:41:16,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-12-31 05:41:16,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-31 05:41:16,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-31 05:41:16,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-12-31 05:41:16,210 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 13 states. [2018-12-31 05:41:16,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 05:41:16,496 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2018-12-31 05:41:16,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 05:41:16,497 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 42 [2018-12-31 05:41:16,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 05:41:16,498 INFO L225 Difference]: With dead ends: 56 [2018-12-31 05:41:16,498 INFO L226 Difference]: Without dead ends: 50 [2018-12-31 05:41:16,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-12-31 05:41:16,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-31 05:41:16,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-12-31 05:41:16,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-31 05:41:16,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2018-12-31 05:41:16,507 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 42 [2018-12-31 05:41:16,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 05:41:16,508 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2018-12-31 05:41:16,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-31 05:41:16,508 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2018-12-31 05:41:16,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-31 05:41:16,509 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 05:41:16,509 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1, 1, 1] [2018-12-31 05:41:16,510 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 05:41:16,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 05:41:16,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1655024736, now seen corresponding path program 10 times [2018-12-31 05:41:16,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 05:41:16,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 05:41:16,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:41:16,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 05:41:16,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 05:41:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 05:41:16,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 05:41:16,612 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 05:41:16,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 05:41:16 BoogieIcfgContainer [2018-12-31 05:41:16,662 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 05:41:16,662 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 05:41:16,662 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 05:41:16,663 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 05:41:16,665 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 05:38:26" (3/4) ... [2018-12-31 05:41:16,669 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-31 05:41:16,786 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 05:41:16,789 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 05:41:16,791 INFO L168 Benchmark]: Toolchain (without parser) took 170737.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 196.1 MB). Free memory was 946.0 MB in the beginning and 1.0 GB in the end (delta: -95.4 MB). Peak memory consumption was 100.7 MB. Max. memory is 11.5 GB. [2018-12-31 05:41:16,794 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 05:41:16,795 INFO L168 Benchmark]: CACSL2BoogieTranslator took 278.34 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-31 05:41:16,795 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.41 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 05:41:16,795 INFO L168 Benchmark]: Boogie Preprocessor took 18.25 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 05:41:16,797 INFO L168 Benchmark]: RCFGBuilder took 298.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -176.6 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-12-31 05:41:16,798 INFO L168 Benchmark]: TraceAbstraction took 169978.46 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 60.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 70.5 MB). Peak memory consumption was 130.8 MB. Max. memory is 11.5 GB. [2018-12-31 05:41:16,798 INFO L168 Benchmark]: Witness Printer took 126.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 05:41:16,806 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.21 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 278.34 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 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 32.41 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.25 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 298.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -176.6 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 169978.46 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 60.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 70.5 MB). Peak memory consumption was 130.8 MB. Max. memory is 11.5 GB. * Witness Printer took 126.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] int sn=0; [L11] unsigned int loop1=__VERIFIER_nondet_uint(), n1=__VERIFIER_nondet_uint(); [L11] unsigned int loop1=__VERIFIER_nondet_uint(), n1=__VERIFIER_nondet_uint(); [L12] unsigned int x=0; [L13] COND TRUE 1 [L14] COND TRUE x<10 [L15] sn = sn + (2) [L17] x++ [L3] COND FALSE !(!(cond)) [L13] COND TRUE 1 [L14] COND TRUE x<10 [L15] sn = sn + (2) [L17] x++ [L3] COND FALSE !(!(cond)) [L13] COND TRUE 1 [L14] COND TRUE x<10 [L15] sn = sn + (2) [L17] x++ [L3] COND FALSE !(!(cond)) [L13] COND TRUE 1 [L14] COND TRUE x<10 [L15] sn = sn + (2) [L17] x++ [L3] COND FALSE !(!(cond)) [L13] COND TRUE 1 [L14] COND TRUE x<10 [L15] sn = sn + (2) [L17] x++ [L3] COND FALSE !(!(cond)) [L13] COND TRUE 1 [L14] COND TRUE x<10 [L15] sn = sn + (2) [L17] x++ [L3] COND FALSE !(!(cond)) [L13] COND TRUE 1 [L14] COND TRUE x<10 [L15] sn = sn + (2) [L17] x++ [L3] COND FALSE !(!(cond)) [L13] COND TRUE 1 [L14] COND TRUE x<10 [L15] sn = sn + (2) [L17] x++ [L3] COND FALSE !(!(cond)) [L13] COND TRUE 1 [L14] COND TRUE x<10 [L15] sn = sn + (2) [L17] x++ [L3] COND FALSE !(!(cond)) [L13] COND TRUE 1 [L14] COND TRUE x<10 [L15] sn = sn + (2) [L17] x++ [L3] COND FALSE !(!(cond)) [L13] COND TRUE 1 [L14] COND FALSE !(x<10) [L17] x++ [L3] COND TRUE !(cond) [L4] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. UNSAFE Result, 169.9s OverallTime, 12 OverallIterations, 11 TraceHistogramMax, 5.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 149 SDtfs, 69 SDslu, 811 SDs, 0 SdLazy, 1014 SolverSat, 51 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 307 GetRequests, 211 SyntacticMatches, 18 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=11, 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, 11 MinimizatonAttempts, 16 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 159.2s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 526 NumberOfCodeBlocks, 526 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 460 ConstructedInterpolants, 0 QuantifiedInterpolants, 87060 SizeOfPredicates, 12 NumberOfNonLiveVariables, 684 ConjunctsInSsa, 130 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 180/1320 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...