./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/nested6.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/loop-invgen/nested6.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 934ee9c856a834ce808d29dea79c6912619f897f ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 17:06:24,980 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:06:24,983 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:06:24,995 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:06:24,996 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:06:24,997 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:06:24,999 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:06:25,001 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:06:25,003 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:06:25,004 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:06:25,006 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:06:25,007 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:06:25,007 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:06:25,009 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:06:25,010 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:06:25,011 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:06:25,012 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:06:25,013 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:06:25,015 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:06:25,017 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:06:25,019 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:06:25,020 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:06:25,022 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:06:25,023 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:06:25,025 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:06:25,026 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:06:25,026 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:06:25,027 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:06:25,028 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:06:25,029 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:06:25,029 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:06:25,030 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:06:25,031 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:06:25,032 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:06:25,033 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:06:25,033 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:06:25,034 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:06:25,034 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:06:25,035 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:06:25,036 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:06:25,037 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:06:25,038 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 17:06:25,060 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:06:25,060 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:06:25,062 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:06:25,062 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:06:25,063 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:06:25,063 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:06:25,063 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:06:25,063 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:06:25,064 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:06:25,064 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:06:25,065 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:06:25,065 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:06:25,065 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:06:25,066 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:06:25,066 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:06:25,066 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:06:25,066 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:06:25,067 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:06:25,067 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:06:25,067 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:06:25,067 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:06:25,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:06:25,068 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:06:25,068 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:06:25,068 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:06:25,069 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:06:25,069 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:06:25,069 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:06:25,069 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:06:25,069 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 934ee9c856a834ce808d29dea79c6912619f897f [2019-11-28 17:06:25,427 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:06:25,448 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:06:25,452 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:06:25,454 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:06:25,455 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:06:25,456 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/nested6.i [2019-11-28 17:06:25,522 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88c94eafb/e2ff6a11019144fcab1a909d3af4b103/FLAG7bf89174c [2019-11-28 17:06:25,940 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:06:25,941 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/nested6.i [2019-11-28 17:06:25,948 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88c94eafb/e2ff6a11019144fcab1a909d3af4b103/FLAG7bf89174c [2019-11-28 17:06:26,277 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88c94eafb/e2ff6a11019144fcab1a909d3af4b103 [2019-11-28 17:06:26,283 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:06:26,285 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:06:26,287 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:06:26,287 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:06:26,291 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:06:26,292 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:06:26" (1/1) ... [2019-11-28 17:06:26,295 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63b88ab0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:26, skipping insertion in model container [2019-11-28 17:06:26,296 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:06:26" (1/1) ... [2019-11-28 17:06:26,304 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:06:26,328 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:06:26,571 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:06:26,576 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:06:26,595 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:06:26,611 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:06:26,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:26 WrapperNode [2019-11-28 17:06:26,612 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:06:26,613 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:06:26,613 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:06:26,613 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:06:26,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:26" (1/1) ... [2019-11-28 17:06:26,631 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:26" (1/1) ... [2019-11-28 17:06:26,658 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:06:26,659 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:06:26,659 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:06:26,659 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:06:26,727 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:26" (1/1) ... [2019-11-28 17:06:26,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:26" (1/1) ... [2019-11-28 17:06:26,735 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:26" (1/1) ... [2019-11-28 17:06:26,735 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:26" (1/1) ... [2019-11-28 17:06:26,740 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:26" (1/1) ... [2019-11-28 17:06:26,748 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:26" (1/1) ... [2019-11-28 17:06:26,757 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:26" (1/1) ... [2019-11-28 17:06:26,761 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:06:26,761 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:06:26,761 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:06:26,762 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:06:26,763 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06: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 [2019-11-28 17:06:26,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:06:26,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:06:27,110 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:06:27,113 INFO L287 CfgBuilder]: Removed 13 assume(true) statements. [2019-11-28 17:06:27,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:06:27 BoogieIcfgContainer [2019-11-28 17:06:27,119 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:06:27,120 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:06:27,122 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:06:27,129 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:06:27,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:06:26" (1/3) ... [2019-11-28 17:06:27,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c0713db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:06:27, skipping insertion in model container [2019-11-28 17:06:27,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:06:26" (2/3) ... [2019-11-28 17:06:27,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c0713db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:06:27, skipping insertion in model container [2019-11-28 17:06:27,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:06:27" (3/3) ... [2019-11-28 17:06:27,143 INFO L109 eAbstractionObserver]: Analyzing ICFG nested6.i [2019-11-28 17:06:27,167 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:06:27,174 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 17:06:27,197 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 17:06:27,237 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:06:27,238 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:06:27,238 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:06:27,238 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:06:27,238 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:06:27,238 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:06:27,239 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:06:27,239 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:06:27,254 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-11-28 17:06:27,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 17:06:27,260 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:27,261 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:27,261 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:27,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:27,266 INFO L82 PathProgramCache]: Analyzing trace with hash -346948471, now seen corresponding path program 1 times [2019-11-28 17:06:27,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:27,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389150286] [2019-11-28 17:06:27,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:27,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:27,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:27,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389150286] [2019-11-28 17:06:27,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:27,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:06:27,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550333317] [2019-11-28 17:06:27,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:06:27,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:27,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:06:27,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:06:27,475 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 4 states. [2019-11-28 17:06:27,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:27,619 INFO L93 Difference]: Finished difference Result 58 states and 83 transitions. [2019-11-28 17:06:27,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:06:27,622 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-28 17:06:27,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:27,631 INFO L225 Difference]: With dead ends: 58 [2019-11-28 17:06:27,631 INFO L226 Difference]: Without dead ends: 25 [2019-11-28 17:06:27,635 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:06:27,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-28 17:06:27,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2019-11-28 17:06:27,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-28 17:06:27,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2019-11-28 17:06:27,672 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 9 [2019-11-28 17:06:27,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:27,673 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-11-28 17:06:27,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:06:27,673 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2019-11-28 17:06:27,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 17:06:27,674 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:27,675 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:27,675 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:27,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:27,675 INFO L82 PathProgramCache]: Analyzing trace with hash 2128734748, now seen corresponding path program 1 times [2019-11-28 17:06:27,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:27,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411045744] [2019-11-28 17:06:27,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:27,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:27,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:27,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411045744] [2019-11-28 17:06:27,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:27,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:06:27,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463451305] [2019-11-28 17:06:27,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:06:27,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:27,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:06:27,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:06:27,734 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 5 states. [2019-11-28 17:06:27,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:27,880 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2019-11-28 17:06:27,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 17:06:27,881 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-28 17:06:27,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:27,882 INFO L225 Difference]: With dead ends: 37 [2019-11-28 17:06:27,882 INFO L226 Difference]: Without dead ends: 35 [2019-11-28 17:06:27,883 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:06:27,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-28 17:06:27,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 17. [2019-11-28 17:06:27,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 17:06:27,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-11-28 17:06:27,890 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 10 [2019-11-28 17:06:27,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:27,891 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-28 17:06:27,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:06:27,891 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2019-11-28 17:06:27,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 17:06:27,892 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:27,892 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:27,893 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:27,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:27,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1590125452, now seen corresponding path program 1 times [2019-11-28 17:06:27,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:27,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589436759] [2019-11-28 17:06:27,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:27,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:27,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:27,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589436759] [2019-11-28 17:06:27,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:27,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 17:06:27,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859995559] [2019-11-28 17:06:27,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:06:27,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:27,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:06:27,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:06:27,980 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 4 states. [2019-11-28 17:06:28,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:28,067 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2019-11-28 17:06:28,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:06:28,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 17:06:28,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:28,069 INFO L225 Difference]: With dead ends: 37 [2019-11-28 17:06:28,069 INFO L226 Difference]: Without dead ends: 35 [2019-11-28 17:06:28,070 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:06:28,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-28 17:06:28,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2019-11-28 17:06:28,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-28 17:06:28,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2019-11-28 17:06:28,080 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 11 [2019-11-28 17:06:28,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:28,080 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2019-11-28 17:06:28,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:06:28,081 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2019-11-28 17:06:28,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 17:06:28,082 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:28,082 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:28,082 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:28,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:28,083 INFO L82 PathProgramCache]: Analyzing trace with hash -520059879, now seen corresponding path program 1 times [2019-11-28 17:06:28,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:28,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799810191] [2019-11-28 17:06:28,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:28,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:28,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:28,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799810191] [2019-11-28 17:06:28,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:06:28,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 17:06:28,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141020685] [2019-11-28 17:06:28,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 17:06:28,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:28,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 17:06:28,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 17:06:28,147 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand 6 states. [2019-11-28 17:06:28,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:28,372 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2019-11-28 17:06:28,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 17:06:28,372 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-28 17:06:28,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:28,375 INFO L225 Difference]: With dead ends: 62 [2019-11-28 17:06:28,375 INFO L226 Difference]: Without dead ends: 60 [2019-11-28 17:06:28,376 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-28 17:06:28,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-28 17:06:28,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 28. [2019-11-28 17:06:28,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 17:06:28,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-11-28 17:06:28,386 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 15 [2019-11-28 17:06:28,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:28,387 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-11-28 17:06:28,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 17:06:28,387 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2019-11-28 17:06:28,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 17:06:28,388 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:28,388 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:28,388 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:28,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:28,389 INFO L82 PathProgramCache]: Analyzing trace with hash 744235909, now seen corresponding path program 1 times [2019-11-28 17:06:28,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:28,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48197204] [2019-11-28 17:06:28,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:28,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:28,476 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:28,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48197204] [2019-11-28 17:06:28,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134244584] [2019-11-28 17:06:28,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:06:28,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:28,524 INFO L264 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 17:06:28,530 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:06:28,620 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 17:06:28,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 17:06:28,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 10 [2019-11-28 17:06:28,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058403400] [2019-11-28 17:06:28,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:06:28,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:28,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:06:28,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-28 17:06:28,623 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 5 states. [2019-11-28 17:06:28,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:28,771 INFO L93 Difference]: Finished difference Result 88 states and 113 transitions. [2019-11-28 17:06:28,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:06:28,773 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-28 17:06:28,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:28,774 INFO L225 Difference]: With dead ends: 88 [2019-11-28 17:06:28,774 INFO L226 Difference]: Without dead ends: 64 [2019-11-28 17:06:28,775 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-28 17:06:28,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-28 17:06:28,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 32. [2019-11-28 17:06:28,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-28 17:06:28,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2019-11-28 17:06:28,786 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 18 [2019-11-28 17:06:28,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:28,787 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2019-11-28 17:06:28,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:06:28,787 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2019-11-28 17:06:28,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 17:06:28,790 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:28,790 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:28,996 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:06:28,997 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:28,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:28,997 INFO L82 PathProgramCache]: Analyzing trace with hash -834677719, now seen corresponding path program 1 times [2019-11-28 17:06:28,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:28,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418724459] [2019-11-28 17:06:28,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:29,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:29,101 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:29,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418724459] [2019-11-28 17:06:29,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709355925] [2019-11-28 17:06:29,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:06:29,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:29,152 INFO L264 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 17:06:29,154 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:06:29,185 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:29,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:06:29,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-11-28 17:06:29,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083462203] [2019-11-28 17:06:29,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 17:06:29,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:29,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 17:06:29,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:06:29,190 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand 8 states. [2019-11-28 17:06:29,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:29,433 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2019-11-28 17:06:29,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 17:06:29,438 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-11-28 17:06:29,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:29,439 INFO L225 Difference]: With dead ends: 65 [2019-11-28 17:06:29,439 INFO L226 Difference]: Without dead ends: 41 [2019-11-28 17:06:29,439 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-11-28 17:06:29,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-28 17:06:29,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2019-11-28 17:06:29,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-28 17:06:29,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2019-11-28 17:06:29,449 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 18 [2019-11-28 17:06:29,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:29,449 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2019-11-28 17:06:29,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 17:06:29,450 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2019-11-28 17:06:29,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 17:06:29,451 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:29,453 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:29,656 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:06:29,657 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:29,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:29,657 INFO L82 PathProgramCache]: Analyzing trace with hash -417195659, now seen corresponding path program 1 times [2019-11-28 17:06:29,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:29,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461432592] [2019-11-28 17:06:29,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:29,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:29,744 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:29,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461432592] [2019-11-28 17:06:29,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678660734] [2019-11-28 17:06:29,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:06:29,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:29,788 INFO L264 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 17:06:29,790 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:06:29,886 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:29,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:06:29,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-11-28 17:06:29,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593142731] [2019-11-28 17:06:29,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 17:06:29,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:29,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 17:06:29,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-11-28 17:06:29,889 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand 13 states. [2019-11-28 17:06:30,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:30,343 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2019-11-28 17:06:30,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-28 17:06:30,344 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2019-11-28 17:06:30,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:30,345 INFO L225 Difference]: With dead ends: 96 [2019-11-28 17:06:30,345 INFO L226 Difference]: Without dead ends: 73 [2019-11-28 17:06:30,346 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=621, Unknown=0, NotChecked=0, Total=812 [2019-11-28 17:06:30,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-28 17:06:30,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 38. [2019-11-28 17:06:30,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-28 17:06:30,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2019-11-28 17:06:30,357 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 21 [2019-11-28 17:06:30,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:30,358 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2019-11-28 17:06:30,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 17:06:30,358 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2019-11-28 17:06:30,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 17:06:30,359 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:30,359 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:30,562 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:06:30,563 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:30,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:30,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1996109287, now seen corresponding path program 2 times [2019-11-28 17:06:30,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:30,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198338349] [2019-11-28 17:06:30,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:30,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:30,669 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:30,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198338349] [2019-11-28 17:06:30,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748460684] [2019-11-28 17:06:30,670 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:06:30,714 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 17:06:30,715 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:06:30,716 INFO L264 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 17:06:30,720 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:06:30,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:06:30,749 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 17:06:30,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 17:06:30,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2019-11-28 17:06:30,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424912940] [2019-11-28 17:06:30,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:06:30,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:30,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:06:30,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-28 17:06:30,751 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 5 states. [2019-11-28 17:06:30,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:30,863 INFO L93 Difference]: Finished difference Result 62 states and 77 transitions. [2019-11-28 17:06:30,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:06:30,864 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-28 17:06:30,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:30,864 INFO L225 Difference]: With dead ends: 62 [2019-11-28 17:06:30,865 INFO L226 Difference]: Without dead ends: 60 [2019-11-28 17:06:30,866 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-28 17:06:30,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-28 17:06:30,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 40. [2019-11-28 17:06:30,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-28 17:06:30,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2019-11-28 17:06:30,887 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 21 [2019-11-28 17:06:30,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:30,887 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2019-11-28 17:06:30,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:06:30,887 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2019-11-28 17:06:30,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 17:06:30,889 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:06:30,889 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:06:31,092 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:06:31,093 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:06:31,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:06:31,093 INFO L82 PathProgramCache]: Analyzing trace with hash 98780674, now seen corresponding path program 1 times [2019-11-28 17:06:31,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:06:31,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594562591] [2019-11-28 17:06:31,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:06:31,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:31,189 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:06:31,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594562591] [2019-11-28 17:06:31,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593245008] [2019-11-28 17:06:31,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:06:31,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:06:31,215 INFO L264 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 17:06:31,216 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:06:31,257 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 17:06:31,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 17:06:31,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2019-11-28 17:06:31,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518926136] [2019-11-28 17:06:31,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:06:31,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:06:31,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:06:31,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-11-28 17:06:31,259 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 4 states. [2019-11-28 17:06:31,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:06:31,291 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2019-11-28 17:06:31,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 17:06:31,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-28 17:06:31,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:06:31,292 INFO L225 Difference]: With dead ends: 57 [2019-11-28 17:06:31,292 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 17:06:31,292 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-11-28 17:06:31,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 17:06:31,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 17:06:31,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 17:06:31,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 17:06:31,293 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2019-11-28 17:06:31,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:06:31,293 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 17:06:31,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:06:31,294 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 17:06:31,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 17:06:31,499 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:06:31,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 17:06:31,926 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 27 [2019-11-28 17:06:32,212 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 26 [2019-11-28 17:06:32,426 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 31 [2019-11-28 17:06:32,671 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 30 [2019-11-28 17:06:32,676 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-28 17:06:32,676 INFO L246 CegarLoopResult]: For program point L19-2(lines 19 31) no Hoare annotation was computed. [2019-11-28 17:06:32,676 INFO L242 CegarLoopResult]: At program point L19-3(lines 19 31) the Hoare annotation is: (let ((.cse1 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse2 (<= ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~j~0)) (.cse0 (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~n~0)) (.cse3 (<= ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~k~0))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (div (+ (* ULTIMATE.start_main_~n~0 (- 1)) 1) (- 2)))) (and .cse1 (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~i~0) (<= (+ .cse4 1) ULTIMATE.start_main_~i~0) (<= .cse4 0) .cse2 .cse3)) (and (<= ULTIMATE.start_main_~i~0 0) .cse0 .cse3))) [2019-11-28 17:06:32,676 INFO L246 CegarLoopResult]: For program point L15(lines 15 18) no Hoare annotation was computed. [2019-11-28 17:06:32,677 INFO L246 CegarLoopResult]: For program point L15-1(lines 15 18) no Hoare annotation was computed. [2019-11-28 17:06:32,677 INFO L249 CegarLoopResult]: At program point L32(lines 10 34) the Hoare annotation is: true [2019-11-28 17:06:32,677 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 17:06:32,677 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 17:06:32,677 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-28 17:06:32,677 INFO L242 CegarLoopResult]: At program point L20-2(lines 20 30) the Hoare annotation is: (let ((.cse0 (* 2 ULTIMATE.start_main_~i~0))) (let ((.cse5 (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~n~0)) (.cse1 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse2 (<= .cse0 ULTIMATE.start_main_~j~0)) (.cse3 (<= ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~k~0))) (or (and (<= ULTIMATE.start_main_~i~0 0) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~k~0 (+ .cse0 1)) .cse1 .cse2 .cse3) (let ((.cse4 (div (- ULTIMATE.start_main_~j~0) (- 2)))) (and (<= (+ .cse4 1) ULTIMATE.start_main_~n~0) .cse5 .cse2 (<= .cse4 0) .cse3 (<= ULTIMATE.start_main_~j~0 .cse0))) (and .cse5 .cse1 .cse2 .cse3)))) [2019-11-28 17:06:32,677 INFO L246 CegarLoopResult]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-11-28 17:06:32,678 INFO L242 CegarLoopResult]: At program point L4-2(lines 1 34) the Hoare annotation is: (let ((.cse0 (* 2 ULTIMATE.start_main_~i~0))) (and (<= .cse0 ULTIMATE.start_main_~k~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= .cse0 ULTIMATE.start_main_~j~0) (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0) (< ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~n~0))) [2019-11-28 17:06:32,678 INFO L246 CegarLoopResult]: For program point L4-3(lines 4 6) no Hoare annotation was computed. [2019-11-28 17:06:32,678 INFO L249 CegarLoopResult]: At program point L33(lines 10 34) the Hoare annotation is: true [2019-11-28 17:06:32,678 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 17:06:32,678 INFO L242 CegarLoopResult]: At program point L4-5(lines 3 8) the Hoare annotation is: (and (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~n~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= (* 2 ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~j~0) (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0) (<= ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~k~0)) [2019-11-28 17:06:32,678 INFO L246 CegarLoopResult]: For program point L4-6(lines 4 6) no Hoare annotation was computed. [2019-11-28 17:06:32,678 INFO L242 CegarLoopResult]: At program point L4-8(lines 1 34) the Hoare annotation is: (let ((.cse3 (* 2 ULTIMATE.start_main_~i~0))) (let ((.cse0 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse1 (<= .cse3 ULTIMATE.start_main_~j~0)) (.cse2 (<= ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~k~0))) (or (and (<= ULTIMATE.start_main_~i~0 0) .cse0 .cse1 (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~j~0 1)) .cse2 (<= ULTIMATE.start_main_~j~0 .cse3)) (and (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~n~0) .cse0 (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0) .cse1 .cse2)))) [2019-11-28 17:06:32,679 INFO L246 CegarLoopResult]: For program point L21(lines 21 29) no Hoare annotation was computed. [2019-11-28 17:06:32,679 INFO L246 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2019-11-28 17:06:32,679 INFO L246 CegarLoopResult]: For program point L5-1(line 5) no Hoare annotation was computed. [2019-11-28 17:06:32,679 INFO L246 CegarLoopResult]: For program point L5-2(line 5) no Hoare annotation was computed. [2019-11-28 17:06:32,679 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-28 17:06:32,679 INFO L242 CegarLoopResult]: At program point L22-2(lines 22 24) the Hoare annotation is: (let ((.cse1 (* 2 ULTIMATE.start_main_~i~0))) (let ((.cse0 (<= .cse1 ULTIMATE.start_main_~k~0))) (or (and .cse0 (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~n~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= .cse1 ULTIMATE.start_main_~j~0) (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0)) (and (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0) (exists ((ULTIMATE.start_main_~j~0 Int)) (let ((.cse2 (div (- ULTIMATE.start_main_~j~0) (- 2)))) (and (<= (+ .cse2 1) ULTIMATE.start_main_~n~0) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0) (<= .cse2 0)))) .cse0 (<= ULTIMATE.start_main_~j~0 .cse1))))) [2019-11-28 17:06:32,680 INFO L246 CegarLoopResult]: For program point L14(line 14) no Hoare annotation was computed. [2019-11-28 17:06:32,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] [2019-11-28 17:06:32,726 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] [2019-11-28 17:06:32,729 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] [2019-11-28 17:06:32,730 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] [2019-11-28 17:06:32,730 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] [2019-11-28 17:06:32,730 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] [2019-11-28 17:06:32,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:06:32 BoogieIcfgContainer [2019-11-28 17:06:32,734 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:06:32,735 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:06:32,735 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:06:32,735 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:06:32,736 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:06:27" (3/4) ... [2019-11-28 17:06:32,740 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 17:06:32,755 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-11-28 17:06:32,755 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 17:06:32,804 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((2 * i <= k && k <= n) && !(0 == cond)) && 2 * i <= j) && j < n) || (((k <= j && (\exists ULTIMATE.start_main_~j~0 : int :: (-ULTIMATE.start_main_~j~0 / -2 + 1 <= n && k <= ULTIMATE.start_main_~j~0) && -ULTIMATE.start_main_~j~0 / -2 <= 0)) && 2 * i <= k) && j <= 2 * i) [2019-11-28 17:06:32,856 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 17:06:32,856 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:06:32,858 INFO L168 Benchmark]: Toolchain (without parser) took 6573.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 212.3 MB). Free memory was 960.3 MB in the beginning and 997.2 MB in the end (delta: -36.8 MB). Peak memory consumption was 175.5 MB. Max. memory is 11.5 GB. [2019-11-28 17:06:32,858 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:06:32,858 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.85 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:06:32,859 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.80 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:06:32,859 INFO L168 Benchmark]: Boogie Preprocessor took 102.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -190.0 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:06:32,860 INFO L168 Benchmark]: RCFGBuilder took 357.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-11-28 17:06:32,860 INFO L168 Benchmark]: TraceAbstraction took 5613.72 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 121.8 MB). Peak memory consumption was 184.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:06:32,861 INFO L168 Benchmark]: Witness Printer took 121.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 997.2 MB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. [2019-11-28 17:06:32,863 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.39 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 325.85 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 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.80 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 102.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -190.0 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 357.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5613.72 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 121.8 MB). Peak memory consumption was 184.7 MB. Max. memory is 11.5 GB. * Witness Printer took 121.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 997.2 MB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((k <= n && !(0 == cond)) && 2 * i <= j) && j < n) && n <= k - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: ((((k <= n && !(0 == cond)) && n <= j) && n <= k) || (((((!(0 == cond) && k <= i) && (n * -1 + 1) / -2 + 1 <= i) && (n * -1 + 1) / -2 <= 0) && n <= j) && n <= k)) || ((i <= 0 && k <= n) && n <= k) - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((i <= 0 && !(0 == cond)) && 2 * i <= j) && k <= j + 1) && n <= k) && j <= 2 * i) || ((((k <= n && !(0 == cond)) && j < n) && 2 * i <= j) && n <= k) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((2 * i <= k && !(0 == cond)) && 2 * i <= j) && j < n) && k < n - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((((((i <= 0 && k <= j) && k <= 2 * i + 1) && !(0 == cond)) && 2 * i <= j) && n <= k) || (((((-j / -2 + 1 <= n && k <= n) && 2 * i <= j) && -j / -2 <= 0) && n <= k) && j <= 2 * i)) || (((k <= n && !(0 == cond)) && 2 * i <= j) && n <= k) - InvariantResult [Line: 22]: Loop Invariant [2019-11-28 17:06:32,887 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] [2019-11-28 17:06:32,887 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] [2019-11-28 17:06:32,887 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] [2019-11-28 17:06:32,888 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] [2019-11-28 17:06:32,890 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] [2019-11-28 17:06:32,890 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] Derived loop invariant: ((((2 * i <= k && k <= n) && !(0 == cond)) && 2 * i <= j) && j < n) || (((k <= j && (\exists ULTIMATE.start_main_~j~0 : int :: (-ULTIMATE.start_main_~j~0 / -2 + 1 <= n && k <= ULTIMATE.start_main_~j~0) && -ULTIMATE.start_main_~j~0 / -2 <= 0)) && 2 * i <= k) && j <= 2 * i) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 3 error locations. Result: SAFE, OverallTime: 4.2s, OverallIterations: 9, TraceHistogramMax: 3, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, HoareTripleCheckerStatistics: 169 SDtfs, 266 SDslu, 249 SDs, 0 SdLazy, 579 SolverSat, 110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 203 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 159 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 33 NumberOfFragments, 276 HoareAnnotationTreeSize, 8 FomulaSimplifications, 25722 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 8 FomulaSimplificationsInter, 5163 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 249 NumberOfCodeBlocks, 249 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 235 ConstructedInterpolants, 1 QuantifiedInterpolants, 14081 SizeOfPredicates, 18 NumberOfNonLiveVariables, 287 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 14 InterpolantComputations, 7 PerfectInterpolantSequences, 38/72 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...