./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/brs2f.c --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/array-fpi/brs2f.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 73252317e8e8ddde1fed282fcf12f7cfbb9f94a9 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 22:28:27,562 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:28:27,565 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:28:27,577 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:28:27,578 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:28:27,579 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:28:27,581 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:28:27,584 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:28:27,589 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:28:27,597 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:28:27,599 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:28:27,600 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:28:27,601 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:28:27,604 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:28:27,607 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:28:27,608 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:28:27,610 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:28:27,614 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:28:27,618 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:28:27,621 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:28:27,623 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:28:27,626 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:28:27,629 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:28:27,630 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:28:27,634 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:28:27,634 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:28:27,635 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:28:27,637 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:28:27,637 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:28:27,640 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:28:27,641 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:28:27,642 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:28:27,643 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:28:27,644 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:28:27,646 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:28:27,647 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:28:27,648 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:28:27,648 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:28:27,648 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:28:27,651 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:28:27,652 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:28:27,654 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 22:28:27,690 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:28:27,694 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:28:27,695 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:28:27,696 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:28:27,696 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:28:27,699 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:28:27,699 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:28:27,699 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 22:28:27,700 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:28:27,700 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:28:27,700 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:28:27,701 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:28:27,701 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:28:27,701 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:28:27,701 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:28:27,703 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:28:27,703 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:28:27,703 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:28:27,704 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:28:27,704 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:28:27,704 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:28:27,704 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:28:27,705 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:28:27,705 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:28:27,706 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:28:27,706 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 22:28:27,706 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 22:28:27,706 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:28:27,707 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 -> 73252317e8e8ddde1fed282fcf12f7cfbb9f94a9 [2019-11-27 22:28:28,045 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:28:28,070 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:28:28,076 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:28:28,078 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:28:28,079 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:28:28,080 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/brs2f.c [2019-11-27 22:28:28,156 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d42a9bce/a59351404461479d9eb61a7810850f26/FLAG54d170161 [2019-11-27 22:28:28,626 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:28:28,626 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/brs2f.c [2019-11-27 22:28:28,632 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d42a9bce/a59351404461479d9eb61a7810850f26/FLAG54d170161 [2019-11-27 22:28:29,004 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d42a9bce/a59351404461479d9eb61a7810850f26 [2019-11-27 22:28:29,008 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:28:29,010 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:28:29,011 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:28:29,011 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:28:29,015 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:28:29,016 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:28:29" (1/1) ... [2019-11-27 22:28:29,019 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f897cab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:28:29, skipping insertion in model container [2019-11-27 22:28:29,020 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:28:29" (1/1) ... [2019-11-27 22:28:29,028 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:28:29,049 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:28:29,256 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:28:29,265 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:28:29,284 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:28:29,301 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:28:29,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:28:29 WrapperNode [2019-11-27 22:28:29,302 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:28:29,303 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:28:29,303 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:28:29,303 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:28:29,312 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:28:29" (1/1) ... [2019-11-27 22:28:29,379 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:28:29" (1/1) ... [2019-11-27 22:28:29,402 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:28:29,403 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:28:29,403 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:28:29,403 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:28:29,413 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:28:29" (1/1) ... [2019-11-27 22:28:29,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:28:29" (1/1) ... [2019-11-27 22:28:29,415 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:28:29" (1/1) ... [2019-11-27 22:28:29,416 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:28:29" (1/1) ... [2019-11-27 22:28:29,422 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:28:29" (1/1) ... [2019-11-27 22:28:29,428 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:28:29" (1/1) ... [2019-11-27 22:28:29,429 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:28:29" (1/1) ... [2019-11-27 22:28:29,432 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:28:29,432 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:28:29,433 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:28:29,433 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:28:29,434 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:28:29" (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-27 22:28:29,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-27 22:28:29,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-27 22:28:29,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-27 22:28:29,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:28:29,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:28:29,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-27 22:28:29,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 22:28:29,743 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:28:29,744 INFO L297 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-27 22:28:29,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:28:29 BoogieIcfgContainer [2019-11-27 22:28:29,746 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:28:29,748 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:28:29,748 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:28:29,751 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:28:29,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:28:29" (1/3) ... [2019-11-27 22:28:29,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@311a498b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:28:29, skipping insertion in model container [2019-11-27 22:28:29,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:28:29" (2/3) ... [2019-11-27 22:28:29,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@311a498b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:28:29, skipping insertion in model container [2019-11-27 22:28:29,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:28:29" (3/3) ... [2019-11-27 22:28:29,756 INFO L109 eAbstractionObserver]: Analyzing ICFG brs2f.c [2019-11-27 22:28:29,768 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:28:29,777 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 22:28:29,792 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 22:28:29,831 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:28:29,832 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:28:29,832 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:28:29,832 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:28:29,833 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:28:29,833 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:28:29,833 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:28:29,833 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:28:29,853 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-11-27 22:28:29,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-27 22:28:29,861 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:28:29,863 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:28:29,863 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:28:29,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:28:29,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1623807605, now seen corresponding path program 1 times [2019-11-27 22:28:29,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:28:29,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499561196] [2019-11-27 22:28:29,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:28:29,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:28:30,027 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-27 22:28:30,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499561196] [2019-11-27 22:28:30,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:28:30,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 22:28:30,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356082454] [2019-11-27 22:28:30,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-27 22:28:30,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:28:30,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-27 22:28:30,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 22:28:30,048 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-11-27 22:28:30,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:28:30,065 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2019-11-27 22:28:30,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-27 22:28:30,067 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-11-27 22:28:30,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:28:30,075 INFO L225 Difference]: With dead ends: 30 [2019-11-27 22:28:30,075 INFO L226 Difference]: Without dead ends: 14 [2019-11-27 22:28:30,080 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 22:28:30,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-11-27 22:28:30,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-27 22:28:30,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-27 22:28:30,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2019-11-27 22:28:30,120 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 9 [2019-11-27 22:28:30,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:28:30,121 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2019-11-27 22:28:30,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-27 22:28:30,121 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2019-11-27 22:28:30,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-27 22:28:30,122 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:28:30,122 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:28:30,123 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:28:30,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:28:30,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1308886944, now seen corresponding path program 1 times [2019-11-27 22:28:30,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:28:30,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042530029] [2019-11-27 22:28:30,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:28:30,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:28:30,244 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-27 22:28:30,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042530029] [2019-11-27 22:28:30,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:28:30,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:28:30,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146422470] [2019-11-27 22:28:30,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:28:30,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:28:30,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:28:30,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:28:30,251 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand 3 states. [2019-11-27 22:28:30,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:28:30,349 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2019-11-27 22:28:30,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:28:30,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-27 22:28:30,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:28:30,351 INFO L225 Difference]: With dead ends: 28 [2019-11-27 22:28:30,351 INFO L226 Difference]: Without dead ends: 17 [2019-11-27 22:28:30,352 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:28:30,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-27 22:28:30,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-11-27 22:28:30,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-27 22:28:30,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2019-11-27 22:28:30,360 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 9 [2019-11-27 22:28:30,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:28:30,361 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-11-27 22:28:30,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:28:30,362 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2019-11-27 22:28:30,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-27 22:28:30,362 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:28:30,362 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:28:30,363 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:28:30,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:28:30,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1738269227, now seen corresponding path program 1 times [2019-11-27 22:28:30,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:28:30,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4771357] [2019-11-27 22:28:30,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:28:30,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:28:30,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-27 22:28:30,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4771357] [2019-11-27 22:28:30,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:28:30,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:28:30,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792339820] [2019-11-27 22:28:30,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:28:30,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:28:30,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:28:30,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:28:30,484 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand 4 states. [2019-11-27 22:28:30,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:28:30,549 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2019-11-27 22:28:30,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:28:30,550 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-27 22:28:30,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:28:30,551 INFO L225 Difference]: With dead ends: 27 [2019-11-27 22:28:30,551 INFO L226 Difference]: Without dead ends: 20 [2019-11-27 22:28:30,553 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:28:30,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-11-27 22:28:30,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2019-11-27 22:28:30,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-27 22:28:30,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2019-11-27 22:28:30,569 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 12 [2019-11-27 22:28:30,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:28:30,570 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-11-27 22:28:30,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:28:30,570 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2019-11-27 22:28:30,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-27 22:28:30,571 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:28:30,571 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:28:30,572 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:28:30,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:28:30,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1896871737, now seen corresponding path program 1 times [2019-11-27 22:28:30,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:28:30,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653162707] [2019-11-27 22:28:30,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:28:30,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:28:30,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-27 22:28:30,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653162707] [2019-11-27 22:28:30,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:28:30,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-27 22:28:30,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214691009] [2019-11-27 22:28:30,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 22:28:30,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:28:30,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 22:28:30,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:28:30,696 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand 5 states. [2019-11-27 22:28:30,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:28:30,774 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2019-11-27 22:28:30,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 22:28:30,775 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-27 22:28:30,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:28:30,776 INFO L225 Difference]: With dead ends: 25 [2019-11-27 22:28:30,776 INFO L226 Difference]: Without dead ends: 21 [2019-11-27 22:28:30,777 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-27 22:28:30,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-27 22:28:30,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-11-27 22:28:30,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-27 22:28:30,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-11-27 22:28:30,783 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 15 [2019-11-27 22:28:30,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:28:30,783 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-11-27 22:28:30,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 22:28:30,784 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2019-11-27 22:28:30,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-27 22:28:30,785 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:28:30,785 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:28:30,785 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:28:30,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:28:30,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1877487447, now seen corresponding path program 1 times [2019-11-27 22:28:30,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:28:30,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685110449] [2019-11-27 22:28:30,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:28:30,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:28:30,881 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:28:30,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685110449] [2019-11-27 22:28:30,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282258415] [2019-11-27 22:28:30,882 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-27 22:28:30,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:28:30,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-27 22:28:30,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:28:31,029 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:28:31,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:28:31,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-11-27 22:28:31,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840635317] [2019-11-27 22:28:31,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 22:28:31,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:28:31,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 22:28:31,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-27 22:28:31,032 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 10 states. [2019-11-27 22:28:31,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:28:31,194 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2019-11-27 22:28:31,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 22:28:31,195 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-11-27 22:28:31,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:28:31,196 INFO L225 Difference]: With dead ends: 41 [2019-11-27 22:28:31,196 INFO L226 Difference]: Without dead ends: 27 [2019-11-27 22:28:31,197 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-27 22:28:31,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-27 22:28:31,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2019-11-27 22:28:31,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-27 22:28:31,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-11-27 22:28:31,204 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 18 [2019-11-27 22:28:31,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:28:31,204 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-11-27 22:28:31,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 22:28:31,205 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2019-11-27 22:28:31,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-27 22:28:31,206 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:28:31,206 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:28:31,415 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:28:31,416 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:28:31,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:28:31,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1112618428, now seen corresponding path program 1 times [2019-11-27 22:28:31,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:28:31,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446220123] [2019-11-27 22:28:31,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:28:31,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:28:31,879 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:28:31,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446220123] [2019-11-27 22:28:31,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507611420] [2019-11-27 22:28:31,880 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-27 22:28:31,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:28:31,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-27 22:28:31,935 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:28:31,985 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-27 22:28:31,986 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 22:28:31,995 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 22:28:31,996 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 22:28:31,996 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-27 22:28:32,094 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-27 22:28:32,094 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 22:28:32,104 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 22:28:32,104 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 22:28:32,105 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-11-27 22:28:32,181 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-27 22:28:32,182 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 22:28:32,196 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 22:28:32,197 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 22:28:32,197 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2019-11-27 22:28:32,301 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 25 [2019-11-27 22:28:32,302 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 22:28:32,320 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 22:28:32,323 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-27 22:28:32,323 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:31 [2019-11-27 22:28:32,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 22:28:32,433 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:28:32,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:28:32,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2019-11-27 22:28:32,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466343139] [2019-11-27 22:28:32,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-27 22:28:32,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:28:32,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-27 22:28:32,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2019-11-27 22:28:32,439 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 23 states. [2019-11-27 22:28:33,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:28:33,104 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2019-11-27 22:28:33,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-27 22:28:33,105 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 21 [2019-11-27 22:28:33,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:28:33,105 INFO L225 Difference]: With dead ends: 49 [2019-11-27 22:28:33,106 INFO L226 Difference]: Without dead ends: 29 [2019-11-27 22:28:33,107 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=194, Invalid=798, Unknown=0, NotChecked=0, Total=992 [2019-11-27 22:28:33,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-27 22:28:33,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2019-11-27 22:28:33,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-27 22:28:33,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-11-27 22:28:33,113 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 21 [2019-11-27 22:28:33,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:28:33,114 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-11-27 22:28:33,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-27 22:28:33,114 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-11-27 22:28:33,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-27 22:28:33,115 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:28:33,116 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:28:33,316 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:28:33,317 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:28:33,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:28:33,318 INFO L82 PathProgramCache]: Analyzing trace with hash -945725626, now seen corresponding path program 2 times [2019-11-27 22:28:33,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:28:33,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313299904] [2019-11-27 22:28:33,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:28:33,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:28:33,549 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:28:33,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313299904] [2019-11-27 22:28:33,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364476768] [2019-11-27 22:28:33,550 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 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-27 22:28:33,595 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-27 22:28:33,595 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 22:28:33,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-27 22:28:33,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:28:33,707 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:28:33,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:28:33,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2019-11-27 22:28:33,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410583645] [2019-11-27 22:28:33,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-27 22:28:33,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:28:33,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-27 22:28:33,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-11-27 22:28:33,710 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 19 states. [2019-11-27 22:28:33,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:28:33,978 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2019-11-27 22:28:33,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-27 22:28:33,979 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2019-11-27 22:28:33,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:28:33,980 INFO L225 Difference]: With dead ends: 48 [2019-11-27 22:28:33,980 INFO L226 Difference]: Without dead ends: 33 [2019-11-27 22:28:33,981 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2019-11-27 22:28:33,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-27 22:28:33,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2019-11-27 22:28:33,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-27 22:28:33,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2019-11-27 22:28:33,986 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 24 [2019-11-27 22:28:33,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:28:33,987 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2019-11-27 22:28:33,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-27 22:28:33,987 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2019-11-27 22:28:33,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-27 22:28:33,988 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:28:33,988 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:28:34,189 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:28:34,189 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:28:34,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:28:34,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1279110679, now seen corresponding path program 3 times [2019-11-27 22:28:34,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:28:34,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805920675] [2019-11-27 22:28:34,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:28:34,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 22:28:34,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 22:28:34,286 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-27 22:28:34,287 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-27 22:28:34,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:28:34 BoogieIcfgContainer [2019-11-27 22:28:34,334 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:28:34,334 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:28:34,334 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:28:34,335 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:28:34,336 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:28:29" (3/4) ... [2019-11-27 22:28:34,339 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-27 22:28:34,404 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 22:28:34,404 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:28:34,409 INFO L168 Benchmark]: Toolchain (without parser) took 5397.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 211.3 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -148.8 MB). Peak memory consumption was 62.5 MB. Max. memory is 11.5 GB. [2019-11-27 22:28:34,410 INFO L168 Benchmark]: CDTParser took 0.75 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-27 22:28:34,410 INFO L168 Benchmark]: CACSL2BoogieTranslator took 291.21 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-27 22:28:34,411 INFO L168 Benchmark]: Boogie Procedure Inliner took 100.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -188.0 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-27 22:28:34,413 INFO L168 Benchmark]: Boogie Preprocessor took 29.15 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:28:34,415 INFO L168 Benchmark]: RCFGBuilder took 314.07 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: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2019-11-27 22:28:34,416 INFO L168 Benchmark]: TraceAbstraction took 4586.23 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 72.0 MB. Max. memory is 11.5 GB. [2019-11-27 22:28:34,417 INFO L168 Benchmark]: Witness Printer took 70.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:28:34,421 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.75 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 291.21 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 100.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -188.0 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.15 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 314.07 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: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4586.23 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 72.0 MB. Max. memory is 11.5 GB. * Witness Printer took 70.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 10]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] int N; VAL [N=0] [L18] N = __VERIFIER_nondet_int() [L19] COND FALSE !(N <= 0) [L22] int i; [L23] long long sum[1]; [L24] int *a = malloc(sizeof(int)*N); [L26] i=0 VAL [N=3] [L26] COND TRUE i