./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 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_6cd3a615-c2d2-4b52-b9ed-24089d0d9852/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6cd3a615-c2d2-4b52-b9ed-24089d0d9852/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6cd3a615-c2d2-4b52-b9ed-24089d0d9852/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6cd3a615-c2d2-4b52-b9ed-24089d0d9852/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-invgen/nested6.i -s /tmp/vcloud-vcloud-master/worker/run_dir_6cd3a615-c2d2-4b52-b9ed-24089d0d9852/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6cd3a615-c2d2-4b52-b9ed-24089d0d9852/bin/uautomizer --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-678e011 [2019-11-20 03:10:54,457 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 03:10:54,459 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 03:10:54,471 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 03:10:54,471 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 03:10:54,473 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 03:10:54,474 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 03:10:54,483 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 03:10:54,488 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 03:10:54,491 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 03:10:54,492 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 03:10:54,493 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 03:10:54,493 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 03:10:54,494 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 03:10:54,495 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 03:10:54,496 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 03:10:54,496 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 03:10:54,497 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 03:10:54,499 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 03:10:54,500 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 03:10:54,504 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 03:10:54,506 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 03:10:54,510 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 03:10:54,510 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 03:10:54,517 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 03:10:54,517 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 03:10:54,517 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 03:10:54,519 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 03:10:54,520 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 03:10:54,521 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 03:10:54,521 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 03:10:54,522 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 03:10:54,523 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 03:10:54,523 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 03:10:54,524 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 03:10:54,524 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 03:10:54,525 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 03:10:54,525 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 03:10:54,525 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 03:10:54,526 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 03:10:54,526 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 03:10:54,527 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6cd3a615-c2d2-4b52-b9ed-24089d0d9852/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 03:10:54,538 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 03:10:54,538 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 03:10:54,539 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 03:10:54,539 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 03:10:54,539 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 03:10:54,540 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 03:10:54,540 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 03:10:54,540 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 03:10:54,540 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 03:10:54,540 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 03:10:54,540 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 03:10:54,541 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 03:10:54,541 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 03:10:54,541 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 03:10:54,541 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 03:10:54,541 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 03:10:54,541 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 03:10:54,542 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 03:10:54,542 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 03:10:54,542 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 03:10:54,542 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 03:10:54,542 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 03:10:54,543 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 03:10:54,543 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 03:10:54,543 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 03:10:54,543 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 03:10:54,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 03:10:54,543 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 03:10:54,544 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_6cd3a615-c2d2-4b52-b9ed-24089d0d9852/bin/uautomizer 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-20 03:10:54,683 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 03:10:54,693 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 03:10:54,695 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 03:10:54,697 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 03:10:54,697 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 03:10:54,703 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6cd3a615-c2d2-4b52-b9ed-24089d0d9852/bin/uautomizer/../../sv-benchmarks/c/loop-invgen/nested6.i [2019-11-20 03:10:54,754 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6cd3a615-c2d2-4b52-b9ed-24089d0d9852/bin/uautomizer/data/9dc842e3e/d1170d2d6a2142b2bee9456c7f6ff910/FLAG95720296c [2019-11-20 03:10:55,157 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 03:10:55,158 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6cd3a615-c2d2-4b52-b9ed-24089d0d9852/sv-benchmarks/c/loop-invgen/nested6.i [2019-11-20 03:10:55,163 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6cd3a615-c2d2-4b52-b9ed-24089d0d9852/bin/uautomizer/data/9dc842e3e/d1170d2d6a2142b2bee9456c7f6ff910/FLAG95720296c [2019-11-20 03:10:55,175 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6cd3a615-c2d2-4b52-b9ed-24089d0d9852/bin/uautomizer/data/9dc842e3e/d1170d2d6a2142b2bee9456c7f6ff910 [2019-11-20 03:10:55,178 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 03:10:55,179 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 03:10:55,180 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 03:10:55,180 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 03:10:55,184 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 03:10:55,184 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:10:55" (1/1) ... [2019-11-20 03:10:55,187 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71587c4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:10:55, skipping insertion in model container [2019-11-20 03:10:55,187 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:10:55" (1/1) ... [2019-11-20 03:10:55,197 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 03:10:55,216 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 03:10:55,395 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:10:55,402 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 03:10:55,501 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:10:55,515 INFO L192 MainTranslator]: Completed translation [2019-11-20 03:10:55,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:10:55 WrapperNode [2019-11-20 03:10:55,515 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 03:10:55,516 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 03:10:55,516 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 03:10:55,517 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 03:10:55,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:10:55" (1/1) ... [2019-11-20 03:10:55,531 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:10:55" (1/1) ... [2019-11-20 03:10:55,548 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 03:10:55,548 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 03:10:55,548 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 03:10:55,548 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 03:10:55,554 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:10:55" (1/1) ... [2019-11-20 03:10:55,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:10:55" (1/1) ... [2019-11-20 03:10:55,555 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:10:55" (1/1) ... [2019-11-20 03:10:55,556 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:10:55" (1/1) ... [2019-11-20 03:10:55,558 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:10:55" (1/1) ... [2019-11-20 03:10:55,562 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:10:55" (1/1) ... [2019-11-20 03:10:55,562 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:10:55" (1/1) ... [2019-11-20 03:10:55,564 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 03:10:55,564 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 03:10:55,564 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 03:10:55,565 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 03:10:55,565 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:10:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6cd3a615-c2d2-4b52-b9ed-24089d0d9852/bin/uautomizer/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-20 03:10:55,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 03:10:55,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 03:10:55,798 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 03:10:55,798 INFO L285 CfgBuilder]: Removed 13 assume(true) statements. [2019-11-20 03:10:55,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:10:55 BoogieIcfgContainer [2019-11-20 03:10:55,800 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 03:10:55,801 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 03:10:55,801 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 03:10:55,803 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 03:10:55,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:10:55" (1/3) ... [2019-11-20 03:10:55,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a72ef28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:10:55, skipping insertion in model container [2019-11-20 03:10:55,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:10:55" (2/3) ... [2019-11-20 03:10:55,805 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a72ef28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:10:55, skipping insertion in model container [2019-11-20 03:10:55,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:10:55" (3/3) ... [2019-11-20 03:10:55,806 INFO L109 eAbstractionObserver]: Analyzing ICFG nested6.i [2019-11-20 03:10:55,815 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 03:10:55,820 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-20 03:10:55,830 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-20 03:10:55,850 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 03:10:55,851 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 03:10:55,851 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 03:10:55,851 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 03:10:55,851 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 03:10:55,851 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 03:10:55,851 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 03:10:55,852 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 03:10:55,865 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-11-20 03:10:55,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 03:10:55,871 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:10:55,871 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:10:55,872 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:10:55,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:10:55,877 INFO L82 PathProgramCache]: Analyzing trace with hash -346948471, now seen corresponding path program 1 times [2019-11-20 03:10:55,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:10:55,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750549408] [2019-11-20 03:10:55,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:10:55,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:10:56,035 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-20 03:10:56,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750549408] [2019-11-20 03:10:56,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:10:56,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:10:56,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470901307] [2019-11-20 03:10:56,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:10:56,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:10:56,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:10:56,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:10:56,054 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 4 states. [2019-11-20 03:10:56,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:10:56,178 INFO L93 Difference]: Finished difference Result 58 states and 83 transitions. [2019-11-20 03:10:56,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 03:10:56,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-20 03:10:56,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:10:56,189 INFO L225 Difference]: With dead ends: 58 [2019-11-20 03:10:56,189 INFO L226 Difference]: Without dead ends: 25 [2019-11-20 03:10:56,192 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-20 03:10:56,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-20 03:10:56,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2019-11-20 03:10:56,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-20 03:10:56,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2019-11-20 03:10:56,223 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 9 [2019-11-20 03:10:56,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:10:56,224 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-11-20 03:10:56,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:10:56,224 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2019-11-20 03:10:56,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 03:10:56,225 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:10:56,225 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:10:56,225 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:10:56,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:10:56,226 INFO L82 PathProgramCache]: Analyzing trace with hash 2128734748, now seen corresponding path program 1 times [2019-11-20 03:10:56,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:10:56,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464961636] [2019-11-20 03:10:56,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:10:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:10:56,274 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-20 03:10:56,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464961636] [2019-11-20 03:10:56,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:10:56,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 03:10:56,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591979612] [2019-11-20 03:10:56,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 03:10:56,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:10:56,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 03:10:56,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:10:56,278 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 5 states. [2019-11-20 03:10:56,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:10:56,432 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2019-11-20 03:10:56,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 03:10:56,433 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-20 03:10:56,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:10:56,434 INFO L225 Difference]: With dead ends: 37 [2019-11-20 03:10:56,434 INFO L226 Difference]: Without dead ends: 35 [2019-11-20 03:10:56,435 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-20 03:10:56,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-20 03:10:56,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 17. [2019-11-20 03:10:56,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-20 03:10:56,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-11-20 03:10:56,445 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 10 [2019-11-20 03:10:56,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:10:56,446 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-11-20 03:10:56,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 03:10:56,446 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2019-11-20 03:10:56,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 03:10:56,447 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:10:56,447 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:10:56,447 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:10:56,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:10:56,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1590125452, now seen corresponding path program 1 times [2019-11-20 03:10:56,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:10:56,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812058358] [2019-11-20 03:10:56,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:10:56,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:10:56,508 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-20 03:10:56,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812058358] [2019-11-20 03:10:56,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:10:56,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:10:56,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923964148] [2019-11-20 03:10:56,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:10:56,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:10:56,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:10:56,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:10:56,510 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 4 states. [2019-11-20 03:10:56,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:10:56,605 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2019-11-20 03:10:56,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 03:10:56,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-20 03:10:56,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:10:56,607 INFO L225 Difference]: With dead ends: 37 [2019-11-20 03:10:56,607 INFO L226 Difference]: Without dead ends: 35 [2019-11-20 03:10:56,607 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-20 03:10:56,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-20 03:10:56,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2019-11-20 03:10:56,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-20 03:10:56,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2019-11-20 03:10:56,619 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 11 [2019-11-20 03:10:56,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:10:56,619 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2019-11-20 03:10:56,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:10:56,619 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2019-11-20 03:10:56,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 03:10:56,629 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:10:56,629 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:10:56,629 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:10:56,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:10:56,630 INFO L82 PathProgramCache]: Analyzing trace with hash -520059879, now seen corresponding path program 1 times [2019-11-20 03:10:56,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:10:56,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420810078] [2019-11-20 03:10:56,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:10:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:10:56,709 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-20 03:10:56,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420810078] [2019-11-20 03:10:56,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:10:56,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 03:10:56,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592903983] [2019-11-20 03:10:56,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 03:10:56,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:10:56,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 03:10:56,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-20 03:10:56,711 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand 6 states. [2019-11-20 03:10:56,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:10:56,909 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2019-11-20 03:10:56,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 03:10:56,910 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-20 03:10:56,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:10:56,912 INFO L225 Difference]: With dead ends: 62 [2019-11-20 03:10:56,912 INFO L226 Difference]: Without dead ends: 60 [2019-11-20 03:10:56,913 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-20 03:10:56,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-20 03:10:56,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 28. [2019-11-20 03:10:56,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-20 03:10:56,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-11-20 03:10:56,921 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 15 [2019-11-20 03:10:56,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:10:56,922 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-11-20 03:10:56,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 03:10:56,922 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2019-11-20 03:10:56,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 03:10:56,923 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:10:56,923 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:10:56,923 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:10:56,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:10:56,924 INFO L82 PathProgramCache]: Analyzing trace with hash 744235909, now seen corresponding path program 1 times [2019-11-20 03:10:56,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:10:56,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876136236] [2019-11-20 03:10:56,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:10:56,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:10:56,998 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-20 03:10:56,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876136236] [2019-11-20 03:10:56,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091053124] [2019-11-20 03:10:56,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6cd3a615-c2d2-4b52-b9ed-24089d0d9852/bin/uautomizer/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-20 03:10:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:10:57,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 03:10:57,041 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:10:57,144 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-20 03:10:57,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 03:10:57,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 10 [2019-11-20 03:10:57,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521551537] [2019-11-20 03:10:57,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 03:10:57,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:10:57,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 03:10:57,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-20 03:10:57,146 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 5 states. [2019-11-20 03:10:57,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:10:57,285 INFO L93 Difference]: Finished difference Result 88 states and 113 transitions. [2019-11-20 03:10:57,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 03:10:57,286 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-20 03:10:57,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:10:57,287 INFO L225 Difference]: With dead ends: 88 [2019-11-20 03:10:57,287 INFO L226 Difference]: Without dead ends: 64 [2019-11-20 03:10:57,287 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-20 03:10:57,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-20 03:10:57,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 32. [2019-11-20 03:10:57,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-20 03:10:57,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2019-11-20 03:10:57,296 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 18 [2019-11-20 03:10:57,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:10:57,296 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2019-11-20 03:10:57,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 03:10:57,296 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2019-11-20 03:10:57,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 03:10:57,297 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:10:57,297 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:10:57,501 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:10:57,506 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:10:57,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:10:57,506 INFO L82 PathProgramCache]: Analyzing trace with hash -834677719, now seen corresponding path program 1 times [2019-11-20 03:10:57,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:10:57,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32864792] [2019-11-20 03:10:57,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:10:57,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:10:57,578 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-20 03:10:57,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32864792] [2019-11-20 03:10:57,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484831815] [2019-11-20 03:10:57,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6cd3a615-c2d2-4b52-b9ed-24089d0d9852/bin/uautomizer/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-20 03:10:57,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:10:57,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 03:10:57,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:10:57,645 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-20 03:10:57,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:10:57,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-11-20 03:10:57,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862309989] [2019-11-20 03:10:57,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 03:10:57,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:10:57,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 03:10:57,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-20 03:10:57,647 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand 8 states. [2019-11-20 03:10:57,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:10:57,882 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2019-11-20 03:10:57,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-20 03:10:57,883 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-11-20 03:10:57,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:10:57,884 INFO L225 Difference]: With dead ends: 65 [2019-11-20 03:10:57,884 INFO L226 Difference]: Without dead ends: 41 [2019-11-20 03:10:57,885 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-20 03:10:57,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-20 03:10:57,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2019-11-20 03:10:57,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-20 03:10:57,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2019-11-20 03:10:57,899 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 18 [2019-11-20 03:10:57,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:10:57,899 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2019-11-20 03:10:57,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 03:10:57,899 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2019-11-20 03:10:57,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 03:10:57,901 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:10:57,901 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-20 03:10:58,104 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:10:58,105 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:10:58,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:10:58,108 INFO L82 PathProgramCache]: Analyzing trace with hash -417195659, now seen corresponding path program 1 times [2019-11-20 03:10:58,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:10:58,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814164141] [2019-11-20 03:10:58,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:10:58,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:10:58,215 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-20 03:10:58,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814164141] [2019-11-20 03:10:58,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766364265] [2019-11-20 03:10:58,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6cd3a615-c2d2-4b52-b9ed-24089d0d9852/bin/uautomizer/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-20 03:10:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:10:58,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 03:10:58,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:10:58,363 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-20 03:10:58,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:10:58,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-11-20 03:10:58,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279021623] [2019-11-20 03:10:58,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 03:10:58,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:10:58,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 03:10:58,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-11-20 03:10:58,365 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand 13 states. [2019-11-20 03:10:58,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:10:58,915 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2019-11-20 03:10:58,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-20 03:10:58,916 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2019-11-20 03:10:58,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:10:58,917 INFO L225 Difference]: With dead ends: 96 [2019-11-20 03:10:58,917 INFO L226 Difference]: Without dead ends: 73 [2019-11-20 03:10:58,918 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-20 03:10:58,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-20 03:10:58,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 38. [2019-11-20 03:10:58,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-20 03:10:58,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2019-11-20 03:10:58,937 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 21 [2019-11-20 03:10:58,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:10:58,938 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2019-11-20 03:10:58,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 03:10:58,938 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2019-11-20 03:10:58,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 03:10:58,939 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:10:58,939 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:10:59,143 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:10:59,144 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:10:59,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:10:59,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1996109287, now seen corresponding path program 2 times [2019-11-20 03:10:59,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:10:59,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460791186] [2019-11-20 03:10:59,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:10:59,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:10:59,213 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-20 03:10:59,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460791186] [2019-11-20 03:10:59,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482321792] [2019-11-20 03:10:59,213 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6cd3a615-c2d2-4b52-b9ed-24089d0d9852/bin/uautomizer/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-20 03:10:59,263 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 03:10:59,263 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 03:10:59,264 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 03:10:59,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:10:59,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:10:59,299 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-20 03:10:59,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 03:10:59,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 11 [2019-11-20 03:10:59,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367798685] [2019-11-20 03:10:59,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 03:10:59,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:10:59,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 03:10:59,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-20 03:10:59,301 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 5 states. [2019-11-20 03:10:59,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:10:59,392 INFO L93 Difference]: Finished difference Result 62 states and 77 transitions. [2019-11-20 03:10:59,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 03:10:59,396 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-20 03:10:59,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:10:59,397 INFO L225 Difference]: With dead ends: 62 [2019-11-20 03:10:59,397 INFO L226 Difference]: Without dead ends: 60 [2019-11-20 03:10:59,397 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-20 03:10:59,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-20 03:10:59,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 40. [2019-11-20 03:10:59,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-20 03:10:59,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2019-11-20 03:10:59,408 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 21 [2019-11-20 03:10:59,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:10:59,408 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2019-11-20 03:10:59,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 03:10:59,409 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2019-11-20 03:10:59,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 03:10:59,410 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:10:59,410 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:10:59,617 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:10:59,617 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:10:59,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:10:59,618 INFO L82 PathProgramCache]: Analyzing trace with hash 98780674, now seen corresponding path program 1 times [2019-11-20 03:10:59,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:10:59,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315749705] [2019-11-20 03:10:59,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:10:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:10:59,740 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-20 03:10:59,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315749705] [2019-11-20 03:10:59,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757536564] [2019-11-20 03:10:59,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6cd3a615-c2d2-4b52-b9ed-24089d0d9852/bin/uautomizer/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-20 03:10:59,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:10:59,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 03:10:59,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:10:59,818 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-20 03:10:59,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 03:10:59,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2019-11-20 03:10:59,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197034157] [2019-11-20 03:10:59,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:10:59,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:10:59,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:10:59,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-11-20 03:10:59,820 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 4 states. [2019-11-20 03:10:59,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:10:59,870 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2019-11-20 03:10:59,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:10:59,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-20 03:10:59,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:10:59,871 INFO L225 Difference]: With dead ends: 57 [2019-11-20 03:10:59,872 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 03:10:59,872 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-20 03:10:59,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 03:10:59,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 03:10:59,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 03:10:59,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 03:10:59,873 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2019-11-20 03:10:59,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:10:59,873 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 03:10:59,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:10:59,873 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 03:10:59,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 03:11:00,076 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:11:00,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 03:11:00,630 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 26 [2019-11-20 03:11:00,776 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 31 [2019-11-20 03:11:02,995 WARN L191 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 60 DAG size of output: 30 [2019-11-20 03:11:02,996 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-20 03:11:02,997 INFO L444 ceAbstractionStarter]: For program point L19-2(lines 19 31) no Hoare annotation was computed. [2019-11-20 03:11:02,997 INFO L440 ceAbstractionStarter]: At program point L19-3(lines 19 31) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~n~0)) (.cse2 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse4 (<= ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~j~0)) (.cse1 (<= ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~k~0))) (or (and (<= ULTIMATE.start_main_~i~0 0) (and .cse0 .cse1)) (let ((.cse3 (div (+ (- ULTIMATE.start_main_~n~0) 1) (- 2)))) (and .cse2 (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~i~0) (<= .cse3 0) .cse4 (<= (+ .cse3 1) ULTIMATE.start_main_~i~0) .cse1)) (and .cse0 .cse2 .cse4 .cse1))) [2019-11-20 03:11:02,997 INFO L444 ceAbstractionStarter]: For program point L15(lines 15 18) no Hoare annotation was computed. [2019-11-20 03:11:02,997 INFO L444 ceAbstractionStarter]: For program point L15-1(lines 15 18) no Hoare annotation was computed. [2019-11-20 03:11:02,997 INFO L447 ceAbstractionStarter]: At program point L32(lines 10 34) the Hoare annotation is: true [2019-11-20 03:11:02,997 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 03:11:02,997 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 03:11:02,997 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-20 03:11:02,997 INFO L440 ceAbstractionStarter]: At program point L20-2(lines 20 30) the Hoare annotation is: (let ((.cse3 (* 2 ULTIMATE.start_main_~i~0))) (let ((.cse1 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse2 (and (<= .cse3 ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~k~0))) (.cse0 (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~n~0))) (or (and .cse0 (and .cse1 .cse2)) (and (<= ULTIMATE.start_main_~i~0 0) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~k~0 (+ .cse3 1)) .cse1 .cse2) (let ((.cse4 (div (- ULTIMATE.start_main_~j~0) (- 2)))) (and (<= (+ .cse4 1) ULTIMATE.start_main_~n~0) .cse2 .cse0 (<= .cse4 0) (<= ULTIMATE.start_main_~j~0 .cse3)))))) [2019-11-20 03:11:02,997 INFO L444 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-11-20 03:11:02,998 INFO L440 ceAbstractionStarter]: 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-20 03:11:02,998 INFO L444 ceAbstractionStarter]: For program point L4-3(lines 4 6) no Hoare annotation was computed. [2019-11-20 03:11:02,998 INFO L447 ceAbstractionStarter]: At program point L33(lines 10 34) the Hoare annotation is: true [2019-11-20 03:11:02,998 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 03:11:02,998 INFO L440 ceAbstractionStarter]: 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-20 03:11:02,998 INFO L444 ceAbstractionStarter]: For program point L4-6(lines 4 6) no Hoare annotation was computed. [2019-11-20 03:11:02,998 INFO L440 ceAbstractionStarter]: At program point L4-8(lines 1 34) the Hoare annotation is: (let ((.cse1 (* 2 ULTIMATE.start_main_~i~0))) (let ((.cse0 (and (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (and (<= .cse1 ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~k~0))))) (or (and (<= ULTIMATE.start_main_~i~0 0) (and .cse0 (<= ULTIMATE.start_main_~k~0 (+ ULTIMATE.start_main_~j~0 1))) (<= ULTIMATE.start_main_~j~0 .cse1)) (and (and .cse0 (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~n~0)) (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0))))) [2019-11-20 03:11:02,998 INFO L444 ceAbstractionStarter]: For program point L21(lines 21 29) no Hoare annotation was computed. [2019-11-20 03:11:02,998 INFO L444 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-11-20 03:11:02,998 INFO L444 ceAbstractionStarter]: For program point L5-1(line 5) no Hoare annotation was computed. [2019-11-20 03:11:02,998 INFO L444 ceAbstractionStarter]: For program point L5-2(line 5) no Hoare annotation was computed. [2019-11-20 03:11:02,999 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-20 03:11:02,999 INFO L440 ceAbstractionStarter]: 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 (and .cse0 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= .cse1 ULTIMATE.start_main_~j~0)) (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~n~0) (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~n~0)) (and (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)))) (and (<= ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~j~0) .cse0) (<= ULTIMATE.start_main_~j~0 .cse1))))) [2019-11-20 03:11:02,999 INFO L444 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2019-11-20 03:11:03,017 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] [2019-11-20 03:11:03,018 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] [2019-11-20 03:11:03,019 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] [2019-11-20 03:11:03,020 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] [2019-11-20 03:11:03,020 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] [2019-11-20 03:11:03,020 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] [2019-11-20 03:11:03,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 03:11:03 BoogieIcfgContainer [2019-11-20 03:11:03,022 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 03:11:03,023 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 03:11:03,023 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 03:11:03,023 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 03:11:03,024 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:10:55" (3/4) ... [2019-11-20 03:11:03,027 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 03:11:03,036 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-11-20 03:11:03,036 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 03:11:03,059 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((2 * i <= k && !(0 == cond)) && 2 * i <= j) && k <= n) && j < n) || (((\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) && k <= j && 2 * i <= k) && j <= 2 * i) [2019-11-20 03:11:03,086 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_6cd3a615-c2d2-4b52-b9ed-24089d0d9852/bin/uautomizer/witness.graphml [2019-11-20 03:11:03,087 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 03:11:03,088 INFO L168 Benchmark]: Toolchain (without parser) took 7909.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 948.8 MB in the beginning and 859.0 MB in the end (delta: 89.8 MB). Peak memory consumption was 206.7 MB. Max. memory is 11.5 GB. [2019-11-20 03:11:03,094 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:11:03,095 INFO L168 Benchmark]: CACSL2BoogieTranslator took 335.80 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 948.8 MB in the beginning and 1.1 GB in the end (delta: -165.6 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-20 03:11:03,095 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.66 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:11:03,095 INFO L168 Benchmark]: Boogie Preprocessor took 16.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-11-20 03:11:03,096 INFO L168 Benchmark]: RCFGBuilder took 235.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-20 03:11:03,096 INFO L168 Benchmark]: TraceAbstraction took 7221.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 865.8 MB in the end (delta: 222.1 MB). Peak memory consumption was 222.1 MB. Max. memory is 11.5 GB. [2019-11-20 03:11:03,097 INFO L168 Benchmark]: Witness Printer took 64.20 ms. Allocated memory is still 1.1 GB. Free memory was 865.8 MB in the beginning and 859.0 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-20 03:11:03,099 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 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 335.80 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 948.8 MB in the beginning and 1.1 GB in the end (delta: -165.6 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.66 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 235.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7221.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 865.8 MB in the end (delta: 222.1 MB). Peak memory consumption was 222.1 MB. Max. memory is 11.5 GB. * Witness Printer took 64.20 ms. Allocated memory is still 1.1 GB. Free memory was 865.8 MB in the beginning and 859.0 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 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: ((i <= 0 && k <= n && n <= k) || (((((!(0 == cond) && k <= i) && (-n + 1) / -2 <= 0) && n <= j) && (-n + 1) / -2 + 1 <= i) && n <= k)) || (((k <= n && !(0 == cond)) && n <= j) && 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 && n <= k) && k <= j + 1) && j <= 2 * i) || (((!(0 == cond) && 2 * i <= j && n <= k) && k <= n) && j < n) - 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: ((k <= n && !(0 == cond) && 2 * i <= j && n <= k) || ((((i <= 0 && k <= j) && k <= 2 * i + 1) && !(0 == cond)) && 2 * i <= j && n <= k)) || ((((-j / -2 + 1 <= n && 2 * i <= j && n <= k) && k <= n) && -j / -2 <= 0) && j <= 2 * i) - InvariantResult [Line: 22]: Loop Invariant [2019-11-20 03:11:03,109 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] [2019-11-20 03:11:03,110 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] [2019-11-20 03:11:03,110 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] [2019-11-20 03:11:03,110 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] [2019-11-20 03:11:03,111 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~j~0,QUANTIFIED] [2019-11-20 03:11:03,111 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 && !(0 == cond)) && 2 * i <= j) && k <= n) && j < n) || (((\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) && k <= j && 2 * i <= k) && j <= 2 * i) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 3 error locations. Result: SAFE, OverallTime: 7.1s, OverallIterations: 9, TraceHistogramMax: 3, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.9s, 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.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 159 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 33 NumberOfFragments, 289 HoareAnnotationTreeSize, 8 FomulaSimplifications, 24769 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 8 FomulaSimplificationsInter, 5148 FormulaSimplificationTreeSizeReductionInter, 2.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s 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...