./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 30f4e4ab 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.24-30f4e4a [2019-11-28 00:02:17,476 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:02:17,479 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:02:17,493 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:02:17,493 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:02:17,495 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:02:17,496 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:02:17,498 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:02:17,504 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:02:17,505 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:02:17,509 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:02:17,510 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:02:17,510 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:02:17,514 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:02:17,515 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:02:17,518 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:02:17,518 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:02:17,521 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:02:17,523 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:02:17,529 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:02:17,531 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:02:17,532 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:02:17,534 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:02:17,536 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:02:17,540 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:02:17,540 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:02:17,540 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:02:17,543 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:02:17,543 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:02:17,545 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:02:17,545 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:02:17,546 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:02:17,546 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:02:17,547 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:02:17,550 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:02:17,551 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:02:17,552 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:02:17,552 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:02:17,552 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:02:17,556 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:02:17,557 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:02:17,558 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:02:17,579 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:02:17,580 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:02:17,582 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:02:17,582 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:02:17,583 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:02:17,583 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:02:17,583 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:02:17,583 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:02:17,584 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:02:17,584 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:02:17,585 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:02:17,585 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:02:17,586 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:02:17,586 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:02:17,587 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:02:17,587 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:02:17,587 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:02:17,587 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:02:17,588 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:02:17,588 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:02:17,588 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:02:17,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:02:17,589 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:02:17,589 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:02:17,589 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:02:17,590 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:02:17,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:02:17,590 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:02:17,590 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 00:02:17,903 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:02:17,922 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:02:17,925 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:02:17,927 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:02:17,927 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:02:17,928 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 00:02:18,006 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f990d31a/d4ab5db75bc748ed9af3d1f02ebe71b5/FLAGc495c66a1 [2019-11-28 00:02:18,490 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:02:18,491 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/nested6.i [2019-11-28 00:02:18,497 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f990d31a/d4ab5db75bc748ed9af3d1f02ebe71b5/FLAGc495c66a1 [2019-11-28 00:02:18,880 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f990d31a/d4ab5db75bc748ed9af3d1f02ebe71b5 [2019-11-28 00:02:18,884 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:02:18,885 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:02:18,886 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:02:18,887 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:02:18,890 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:02:18,891 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:02:18" (1/1) ... [2019-11-28 00:02:18,894 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22ceee9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:18, skipping insertion in model container [2019-11-28 00:02:18,894 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:02:18" (1/1) ... [2019-11-28 00:02:18,901 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:02:18,918 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:02:19,090 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:02:19,095 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:02:19,110 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:02:19,123 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:02:19,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:19 WrapperNode [2019-11-28 00:02:19,124 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:02:19,125 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:02:19,125 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:02:19,125 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:02:19,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:19" (1/1) ... [2019-11-28 00:02:19,137 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:19" (1/1) ... [2019-11-28 00:02:19,210 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:02:19,211 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:02:19,211 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:02:19,211 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:02:19,221 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:19" (1/1) ... [2019-11-28 00:02:19,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:19" (1/1) ... [2019-11-28 00:02:19,223 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:19" (1/1) ... [2019-11-28 00:02:19,223 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:19" (1/1) ... [2019-11-28 00:02:19,225 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:19" (1/1) ... [2019-11-28 00:02:19,230 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:19" (1/1) ... [2019-11-28 00:02:19,232 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:19" (1/1) ... [2019-11-28 00:02:19,233 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:02:19,234 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:02:19,234 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:02:19,234 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:02:19,235 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:19" (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 00:02:19,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:02:19,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:02:19,530 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:02:19,530 INFO L297 CfgBuilder]: Removed 13 assume(true) statements. [2019-11-28 00:02:19,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:02:19 BoogieIcfgContainer [2019-11-28 00:02:19,532 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:02:19,534 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:02:19,534 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:02:19,538 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:02:19,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:02:18" (1/3) ... [2019-11-28 00:02:19,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7893a065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:02:19, skipping insertion in model container [2019-11-28 00:02:19,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:02:19" (2/3) ... [2019-11-28 00:02:19,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7893a065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:02:19, skipping insertion in model container [2019-11-28 00:02:19,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:02:19" (3/3) ... [2019-11-28 00:02:19,563 INFO L109 eAbstractionObserver]: Analyzing ICFG nested6.i [2019-11-28 00:02:19,586 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:02:19,601 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 00:02:19,620 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 00:02:19,644 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:02:19,644 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:02:19,644 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:02:19,644 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:02:19,644 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:02:19,644 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:02:19,645 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:02:19,645 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:02:19,658 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-11-28 00:02:19,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 00:02:19,662 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:19,663 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:19,664 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:19,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:19,668 INFO L82 PathProgramCache]: Analyzing trace with hash -346948471, now seen corresponding path program 1 times [2019-11-28 00:02:19,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:19,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296190888] [2019-11-28 00:02:19,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:19,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:19,878 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 00:02:19,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296190888] [2019-11-28 00:02:19,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:19,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:02:19,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120944395] [2019-11-28 00:02:19,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:02:19,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:19,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:02:19,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:02:19,912 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 4 states. [2019-11-28 00:02:20,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:20,067 INFO L93 Difference]: Finished difference Result 58 states and 83 transitions. [2019-11-28 00:02:20,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:02:20,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-28 00:02:20,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:20,080 INFO L225 Difference]: With dead ends: 58 [2019-11-28 00:02:20,081 INFO L226 Difference]: Without dead ends: 25 [2019-11-28 00:02:20,084 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 00:02:20,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-28 00:02:20,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2019-11-28 00:02:20,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-28 00:02:20,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2019-11-28 00:02:20,122 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 9 [2019-11-28 00:02:20,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:20,123 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-11-28 00:02:20,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:02:20,124 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2019-11-28 00:02:20,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 00:02:20,124 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:20,125 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:20,125 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:20,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:20,126 INFO L82 PathProgramCache]: Analyzing trace with hash 2128734748, now seen corresponding path program 1 times [2019-11-28 00:02:20,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:20,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213085741] [2019-11-28 00:02:20,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:20,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:20,201 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 00:02:20,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213085741] [2019-11-28 00:02:20,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:20,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:02:20,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977594082] [2019-11-28 00:02:20,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:02:20,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:20,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:02:20,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:02:20,205 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 5 states. [2019-11-28 00:02:20,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:20,470 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2019-11-28 00:02:20,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 00:02:20,472 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-28 00:02:20,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:20,473 INFO L225 Difference]: With dead ends: 37 [2019-11-28 00:02:20,474 INFO L226 Difference]: Without dead ends: 35 [2019-11-28 00:02:20,476 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 00:02:20,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-28 00:02:20,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 17. [2019-11-28 00:02:20,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 00:02:20,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-11-28 00:02:20,491 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 10 [2019-11-28 00:02:20,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:20,492 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-28 00:02:20,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:02:20,492 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2019-11-28 00:02:20,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 00:02:20,494 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:20,494 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:20,494 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:20,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:20,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1590125452, now seen corresponding path program 1 times [2019-11-28 00:02:20,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:20,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268009883] [2019-11-28 00:02:20,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:20,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:20,573 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 00:02:20,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268009883] [2019-11-28 00:02:20,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:20,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:02:20,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683922094] [2019-11-28 00:02:20,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:02:20,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:20,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:02:20,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:02:20,577 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 4 states. [2019-11-28 00:02:20,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:20,663 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2019-11-28 00:02:20,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:02:20,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 00:02:20,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:20,665 INFO L225 Difference]: With dead ends: 37 [2019-11-28 00:02:20,665 INFO L226 Difference]: Without dead ends: 35 [2019-11-28 00:02:20,666 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 00:02:20,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-28 00:02:20,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2019-11-28 00:02:20,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-28 00:02:20,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2019-11-28 00:02:20,676 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 11 [2019-11-28 00:02:20,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:20,676 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2019-11-28 00:02:20,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:02:20,677 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2019-11-28 00:02:20,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 00:02:20,678 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:20,678 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:20,679 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:20,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:20,679 INFO L82 PathProgramCache]: Analyzing trace with hash -520059879, now seen corresponding path program 1 times [2019-11-28 00:02:20,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:20,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648708351] [2019-11-28 00:02:20,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:20,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:20,740 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 00:02:20,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648708351] [2019-11-28 00:02:20,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:02:20,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 00:02:20,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253533490] [2019-11-28 00:02:20,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:02:20,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:20,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:02:20,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:02:20,743 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand 6 states. [2019-11-28 00:02:21,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:21,007 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2019-11-28 00:02:21,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 00:02:21,008 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-28 00:02:21,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:21,012 INFO L225 Difference]: With dead ends: 62 [2019-11-28 00:02:21,013 INFO L226 Difference]: Without dead ends: 60 [2019-11-28 00:02:21,015 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 00:02:21,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-28 00:02:21,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 28. [2019-11-28 00:02:21,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 00:02:21,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-11-28 00:02:21,036 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 15 [2019-11-28 00:02:21,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:21,037 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-11-28 00:02:21,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:02:21,037 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2019-11-28 00:02:21,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 00:02:21,038 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:21,038 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:02:21,038 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:21,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:21,039 INFO L82 PathProgramCache]: Analyzing trace with hash 744235909, now seen corresponding path program 1 times [2019-11-28 00:02:21,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:21,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2573960] [2019-11-28 00:02:21,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:21,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:21,126 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 00:02:21,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2573960] [2019-11-28 00:02:21,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029909904] [2019-11-28 00:02:21,127 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 00:02:21,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:21,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 00:02:21,187 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:02:21,278 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 00:02:21,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 00:02:21,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 10 [2019-11-28 00:02:21,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74975266] [2019-11-28 00:02:21,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:02:21,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:21,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:02:21,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-28 00:02:21,281 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 5 states. [2019-11-28 00:02:21,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:21,451 INFO L93 Difference]: Finished difference Result 88 states and 113 transitions. [2019-11-28 00:02:21,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:02:21,452 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-28 00:02:21,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:21,453 INFO L225 Difference]: With dead ends: 88 [2019-11-28 00:02:21,453 INFO L226 Difference]: Without dead ends: 64 [2019-11-28 00:02:21,455 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 00:02:21,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-28 00:02:21,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 32. [2019-11-28 00:02:21,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-28 00:02:21,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2019-11-28 00:02:21,467 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 18 [2019-11-28 00:02:21,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:21,468 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2019-11-28 00:02:21,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:02:21,468 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2019-11-28 00:02:21,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 00:02:21,469 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:21,470 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 00:02:21,673 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:02:21,676 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:21,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:21,677 INFO L82 PathProgramCache]: Analyzing trace with hash -834677719, now seen corresponding path program 1 times [2019-11-28 00:02:21,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:21,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552619815] [2019-11-28 00:02:21,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:21,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:21,769 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 00:02:21,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552619815] [2019-11-28 00:02:21,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451939999] [2019-11-28 00:02:21,771 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 00:02:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:21,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 00:02:21,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:02:21,836 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 00:02:21,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:02:21,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-11-28 00:02:21,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653162707] [2019-11-28 00:02:21,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 00:02:21,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:21,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 00:02:21,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:02:21,841 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand 8 states. [2019-11-28 00:02:22,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:22,084 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2019-11-28 00:02:22,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 00:02:22,085 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-11-28 00:02:22,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:22,086 INFO L225 Difference]: With dead ends: 65 [2019-11-28 00:02:22,086 INFO L226 Difference]: Without dead ends: 41 [2019-11-28 00:02:22,087 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 00:02:22,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-28 00:02:22,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2019-11-28 00:02:22,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-28 00:02:22,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2019-11-28 00:02:22,101 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 18 [2019-11-28 00:02:22,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:22,101 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2019-11-28 00:02:22,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 00:02:22,102 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2019-11-28 00:02:22,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 00:02:22,103 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:22,103 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 00:02:22,306 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:02:22,307 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:22,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:22,308 INFO L82 PathProgramCache]: Analyzing trace with hash -417195659, now seen corresponding path program 1 times [2019-11-28 00:02:22,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:22,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719696915] [2019-11-28 00:02:22,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:22,401 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 00:02:22,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719696915] [2019-11-28 00:02:22,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427141070] [2019-11-28 00:02:22,402 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 00:02:22,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:22,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 00:02:22,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:02:22,570 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 00:02:22,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:02:22,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-11-28 00:02:22,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753775013] [2019-11-28 00:02:22,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 00:02:22,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:22,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 00:02:22,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-11-28 00:02:22,574 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand 13 states. [2019-11-28 00:02:23,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:23,007 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2019-11-28 00:02:23,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-28 00:02:23,007 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2019-11-28 00:02:23,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:23,008 INFO L225 Difference]: With dead ends: 96 [2019-11-28 00:02:23,009 INFO L226 Difference]: Without dead ends: 73 [2019-11-28 00:02:23,010 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=621, Unknown=0, NotChecked=0, Total=812 [2019-11-28 00:02:23,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-28 00:02:23,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 38. [2019-11-28 00:02:23,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-28 00:02:23,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2019-11-28 00:02:23,021 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 21 [2019-11-28 00:02:23,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:23,022 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2019-11-28 00:02:23,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 00:02:23,022 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2019-11-28 00:02:23,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 00:02:23,023 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:23,023 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 00:02:23,226 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:02:23,227 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:23,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:23,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1996109287, now seen corresponding path program 2 times [2019-11-28 00:02:23,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:23,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442778525] [2019-11-28 00:02:23,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:23,341 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 00:02:23,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442778525] [2019-11-28 00:02:23,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009439165] [2019-11-28 00:02:23,343 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 00:02:23,383 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 00:02:23,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:02:23,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 00:02:23,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:02:23,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 00:02:23,453 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 00:02:23,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 00:02:23,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2019-11-28 00:02:23,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840635317] [2019-11-28 00:02:23,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:02:23,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:23,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:02:23,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-28 00:02:23,456 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 5 states. [2019-11-28 00:02:23,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:23,545 INFO L93 Difference]: Finished difference Result 62 states and 77 transitions. [2019-11-28 00:02:23,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:02:23,546 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-28 00:02:23,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:23,546 INFO L225 Difference]: With dead ends: 62 [2019-11-28 00:02:23,547 INFO L226 Difference]: Without dead ends: 60 [2019-11-28 00:02:23,547 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 00:02:23,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-28 00:02:23,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 40. [2019-11-28 00:02:23,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-28 00:02:23,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2019-11-28 00:02:23,560 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 21 [2019-11-28 00:02:23,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:23,560 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2019-11-28 00:02:23,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:02:23,560 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2019-11-28 00:02:23,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 00:02:23,561 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:02:23,561 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 00:02:23,765 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:02:23,766 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:02:23,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:02:23,766 INFO L82 PathProgramCache]: Analyzing trace with hash 98780674, now seen corresponding path program 1 times [2019-11-28 00:02:23,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:02:23,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119392751] [2019-11-28 00:02:23,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:02:23,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:23,901 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 00:02:23,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119392751] [2019-11-28 00:02:23,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903725989] [2019-11-28 00:02:23,902 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 00:02:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:02:23,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 00:02:23,937 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:02:23,968 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 00:02:23,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 00:02:23,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2019-11-28 00:02:23,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174941299] [2019-11-28 00:02:23,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:02:23,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:02:23,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:02:23,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-11-28 00:02:23,970 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 4 states. [2019-11-28 00:02:24,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:02:24,012 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2019-11-28 00:02:24,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:02:24,012 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-28 00:02:24,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:02:24,012 INFO L225 Difference]: With dead ends: 57 [2019-11-28 00:02:24,013 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 00:02:24,013 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-11-28 00:02:24,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 00:02:24,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 00:02:24,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 00:02:24,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 00:02:24,014 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2019-11-28 00:02:24,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:02:24,014 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 00:02:24,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:02:24,015 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 00:02:24,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 00:02:24,219 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:02:24,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 00:02:24,820 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 26 [2019-11-28 00:02:25,017 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 31 [2019-11-28 00:02:25,302 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 30 [2019-11-28 00:02:25,307 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-28 00:02:25,307 INFO L246 CegarLoopResult]: For program point L19-2(lines 19 31) no Hoare annotation was computed. [2019-11-28 00:02:25,307 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 00:02:25,307 INFO L246 CegarLoopResult]: For program point L15(lines 15 18) no Hoare annotation was computed. [2019-11-28 00:02:25,308 INFO L246 CegarLoopResult]: For program point L15-1(lines 15 18) no Hoare annotation was computed. [2019-11-28 00:02:25,308 INFO L249 CegarLoopResult]: At program point L32(lines 10 34) the Hoare annotation is: true [2019-11-28 00:02:25,308 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 00:02:25,308 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 00:02:25,308 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-28 00:02:25,308 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 00:02:25,308 INFO L246 CegarLoopResult]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-11-28 00:02:25,309 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 00:02:25,309 INFO L246 CegarLoopResult]: For program point L4-3(lines 4 6) no Hoare annotation was computed. [2019-11-28 00:02:25,310 INFO L249 CegarLoopResult]: At program point L33(lines 10 34) the Hoare annotation is: true [2019-11-28 00:02:25,310 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 00:02:25,310 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 00:02:25,310 INFO L246 CegarLoopResult]: For program point L4-6(lines 4 6) no Hoare annotation was computed. [2019-11-28 00:02:25,311 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 00:02:25,311 INFO L246 CegarLoopResult]: For program point L21(lines 21 29) no Hoare annotation was computed. [2019-11-28 00:02:25,311 INFO L246 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2019-11-28 00:02:25,311 INFO L246 CegarLoopResult]: For program point L5-1(line 5) no Hoare annotation was computed. [2019-11-28 00:02:25,312 INFO L246 CegarLoopResult]: For program point L5-2(line 5) no Hoare annotation was computed. [2019-11-28 00:02:25,312 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-28 00:02:25,312 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 00:02:25,312 INFO L246 CegarLoopResult]: For program point L14(line 14) no Hoare annotation was computed. [2019-11-28 00:02:25,351 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] [2019-11-28 00:02:25,353 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] [2019-11-28 00:02:25,354 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] [2019-11-28 00:02:25,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] [2019-11-28 00:02:25,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] [2019-11-28 00:02:25,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] [2019-11-28 00:02:25,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:02:25 BoogieIcfgContainer [2019-11-28 00:02:25,359 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:02:25,360 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:02:25,360 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:02:25,360 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:02:25,361 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:02:19" (3/4) ... [2019-11-28 00:02:25,365 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 00:02:25,380 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-11-28 00:02:25,381 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 00:02:25,435 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 00:02:25,483 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:02:25,483 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:02:25,485 INFO L168 Benchmark]: Toolchain (without parser) took 6599.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 199.2 MB). Free memory was 956.3 MB in the beginning and 992.5 MB in the end (delta: -36.1 MB). Peak memory consumption was 163.1 MB. Max. memory is 11.5 GB. [2019-11-28 00:02:25,485 INFO L168 Benchmark]: CDTParser took 0.19 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 00:02:25,485 INFO L168 Benchmark]: CACSL2BoogieTranslator took 237.92 ms. Allocated memory is still 1.0 GB. Free memory was 956.3 MB in the beginning and 945.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 00:02:25,486 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -187.9 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:02:25,486 INFO L168 Benchmark]: Boogie Preprocessor took 22.89 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: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-28 00:02:25,487 INFO L168 Benchmark]: RCFGBuilder took 298.54 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: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2019-11-28 00:02:25,487 INFO L168 Benchmark]: TraceAbstraction took 5825.46 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.4 MB). Free memory was 1.1 GB in the beginning and 999.7 MB in the end (delta: 103.4 MB). Peak memory consumption was 165.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:02:25,488 INFO L168 Benchmark]: Witness Printer took 123.51 ms. Allocated memory is still 1.2 GB. Free memory was 999.7 MB in the beginning and 992.5 MB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2019-11-28 00:02:25,490 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.19 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 237.92 ms. Allocated memory is still 1.0 GB. Free memory was 956.3 MB in the beginning and 945.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 85.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -187.9 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.89 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: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 298.54 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: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5825.46 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.4 MB). Free memory was 1.1 GB in the beginning and 999.7 MB in the end (delta: 103.4 MB). Peak memory consumption was 165.7 MB. Max. memory is 11.5 GB. * Witness Printer took 123.51 ms. Allocated memory is still 1.2 GB. Free memory was 999.7 MB in the beginning and 992.5 MB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 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 00:02:25,512 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] [2019-11-28 00:02:25,513 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] [2019-11-28 00:02:25,513 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] [2019-11-28 00:02:25,514 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] [2019-11-28 00:02:25,514 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] [2019-11-28 00:02:25,514 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.5s, OverallIterations: 9, TraceHistogramMax: 3, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.0s, HoareTripleCheckerStatistics: 169 SDtfs, 266 SDslu, 249 SDs, 0 SdLazy, 579 SolverSat, 110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s 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.1s 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.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s 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...