./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/heap-manipulation/merge_sort_false-unreach-call_false-valid-memcleanup.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/heap-manipulation/merge_sort_false-unreach-call_false-valid-memcleanup.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 534681b11e8e68e6058985d885b01f2cbfa43e5b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-0ed9222-m [2019-01-12 09:17:48,626 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:17:48,628 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:17:48,640 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:17:48,640 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:17:48,642 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:17:48,643 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:17:48,646 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:17:48,648 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:17:48,649 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:17:48,650 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:17:48,651 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:17:48,652 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:17:48,653 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:17:48,654 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:17:48,655 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:17:48,657 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:17:48,658 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:17:48,661 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:17:48,663 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:17:48,664 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:17:48,665 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:17:48,668 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:17:48,669 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:17:48,669 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:17:48,670 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:17:48,672 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:17:48,673 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:17:48,673 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:17:48,675 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:17:48,675 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:17:48,676 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:17:48,676 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:17:48,677 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:17:48,678 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:17:48,679 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:17:48,680 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 09:17:48,696 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:17:48,696 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:17:48,697 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:17:48,698 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:17:48,698 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:17:48,698 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:17:48,699 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:17:48,699 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 09:17:48,699 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:17:48,699 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:17:48,699 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:17:48,699 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:17:48,700 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:17:48,700 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:17:48,700 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:17:48,700 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:17:48,700 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:17:48,701 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:17:48,702 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:17:48,703 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:17:48,703 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:17:48,703 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:17:48,703 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:17:48,703 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:17:48,703 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:17:48,705 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 09:17:48,705 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:17:48,705 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 09:17:48,705 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 534681b11e8e68e6058985d885b01f2cbfa43e5b [2019-01-12 09:17:48,743 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:17:48,756 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:17:48,760 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:17:48,761 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:17:48,762 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:17:48,763 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/heap-manipulation/merge_sort_false-unreach-call_false-valid-memcleanup.i [2019-01-12 09:17:48,825 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cea34e5e5/f55c445995cd42809edfd4668b10a1ee/FLAG76cf50ddb [2019-01-12 09:17:49,379 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:17:49,380 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/heap-manipulation/merge_sort_false-unreach-call_false-valid-memcleanup.i [2019-01-12 09:17:49,394 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cea34e5e5/f55c445995cd42809edfd4668b10a1ee/FLAG76cf50ddb [2019-01-12 09:17:49,678 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cea34e5e5/f55c445995cd42809edfd4668b10a1ee [2019-01-12 09:17:49,682 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:17:49,683 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:17:49,685 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:17:49,685 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:17:49,689 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:17:49,690 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:17:49" (1/1) ... [2019-01-12 09:17:49,693 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5524172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:17:49, skipping insertion in model container [2019-01-12 09:17:49,693 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:17:49" (1/1) ... [2019-01-12 09:17:49,701 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:17:49,760 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:17:50,145 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:17:50,162 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:17:50,301 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:17:50,362 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:17:50,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:17:50 WrapperNode [2019-01-12 09:17:50,363 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:17:50,364 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:17:50,364 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:17:50,364 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:17:50,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:17:50" (1/1) ... [2019-01-12 09:17:50,394 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:17:50" (1/1) ... [2019-01-12 09:17:50,442 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:17:50,442 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:17:50,442 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:17:50,443 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:17:50,457 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:17:50" (1/1) ... [2019-01-12 09:17:50,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:17:50" (1/1) ... [2019-01-12 09:17:50,464 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:17:50" (1/1) ... [2019-01-12 09:17:50,464 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:17:50" (1/1) ... [2019-01-12 09:17:50,479 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:17:50" (1/1) ... [2019-01-12 09:17:50,490 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:17:50" (1/1) ... [2019-01-12 09:17:50,493 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:17:50" (1/1) ... [2019-01-12 09:17:50,498 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:17:50,499 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:17:50,499 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:17:50,499 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:17:50,500 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:17:50" (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-01-12 09:17:50,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-12 09:17:50,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-12 09:17:50,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-12 09:17:50,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 09:17:50,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-12 09:17:50,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-12 09:17:50,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 09:17:50,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:17:50,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:17:51,689 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:17:51,690 INFO L286 CfgBuilder]: Removed 75 assue(true) statements. [2019-01-12 09:17:51,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:17:51 BoogieIcfgContainer [2019-01-12 09:17:51,691 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:17:51,692 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:17:51,692 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:17:51,696 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:17:51,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:17:49" (1/3) ... [2019-01-12 09:17:51,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@720e42e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:17:51, skipping insertion in model container [2019-01-12 09:17:51,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:17:50" (2/3) ... [2019-01-12 09:17:51,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@720e42e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:17:51, skipping insertion in model container [2019-01-12 09:17:51,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:17:51" (3/3) ... [2019-01-12 09:17:51,699 INFO L112 eAbstractionObserver]: Analyzing ICFG merge_sort_false-unreach-call_false-valid-memcleanup.i [2019-01-12 09:17:51,710 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:17:51,717 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2019-01-12 09:17:51,732 INFO L257 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2019-01-12 09:17:51,759 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:17:51,760 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:17:51,760 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:17:51,760 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:17:51,761 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:17:51,761 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:17:51,761 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:17:51,761 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:17:51,761 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:17:51,781 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states. [2019-01-12 09:17:51,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-12 09:17:51,787 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:17:51,788 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-12 09:17:51,790 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:17:51,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:17:51,796 INFO L82 PathProgramCache]: Analyzing trace with hash 890218827, now seen corresponding path program 1 times [2019-01-12 09:17:51,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:17:51,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:17:51,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:17:51,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:17:51,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:17:51,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:17:51,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:17:51,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:17:51,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 09:17:51,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 09:17:51,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 09:17:51,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:17:51,941 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 2 states. [2019-01-12 09:17:51,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:17:51,967 INFO L93 Difference]: Finished difference Result 196 states and 316 transitions. [2019-01-12 09:17:51,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 09:17:51,968 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-01-12 09:17:51,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:17:51,978 INFO L225 Difference]: With dead ends: 196 [2019-01-12 09:17:51,979 INFO L226 Difference]: Without dead ends: 92 [2019-01-12 09:17:51,982 INFO L631 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-01-12 09:17:51,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-12 09:17:52,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-01-12 09:17:52,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-12 09:17:52,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2019-01-12 09:17:52,029 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 6 [2019-01-12 09:17:52,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:17:52,029 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2019-01-12 09:17:52,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 09:17:52,030 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2019-01-12 09:17:52,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-12 09:17:52,030 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:17:52,030 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:17:52,031 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:17:52,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:17:52,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1806865150, now seen corresponding path program 1 times [2019-01-12 09:17:52,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:17:52,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:17:52,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:17:52,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:17:52,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:17:52,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:17:52,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:17:52,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:17:52,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 09:17:52,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 09:17:52,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 09:17:52,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:17:52,109 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand 3 states. [2019-01-12 09:17:52,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:17:52,204 INFO L93 Difference]: Finished difference Result 182 states and 202 transitions. [2019-01-12 09:17:52,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 09:17:52,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-01-12 09:17:52,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:17:52,207 INFO L225 Difference]: With dead ends: 182 [2019-01-12 09:17:52,207 INFO L226 Difference]: Without dead ends: 98 [2019-01-12 09:17:52,209 INFO L631 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-01-12 09:17:52,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-12 09:17:52,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2019-01-12 09:17:52,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-12 09:17:52,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2019-01-12 09:17:52,220 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 7 [2019-01-12 09:17:52,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:17:52,221 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2019-01-12 09:17:52,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 09:17:52,221 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2019-01-12 09:17:52,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-12 09:17:52,222 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:17:52,222 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:17:52,223 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:17:52,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:17:52,223 INFO L82 PathProgramCache]: Analyzing trace with hash 663763925, now seen corresponding path program 1 times [2019-01-12 09:17:52,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:17:52,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:17:52,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:17:52,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:17:52,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:17:52,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:17:52,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:17:52,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:17:52,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 09:17:52,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 09:17:52,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 09:17:52,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:17:52,359 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand 5 states. [2019-01-12 09:17:52,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:17:52,836 INFO L93 Difference]: Finished difference Result 253 states and 288 transitions. [2019-01-12 09:17:52,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 09:17:52,839 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-01-12 09:17:52,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:17:52,843 INFO L225 Difference]: With dead ends: 253 [2019-01-12 09:17:52,846 INFO L226 Difference]: Without dead ends: 247 [2019-01-12 09:17:52,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 09:17:52,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-01-12 09:17:52,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 96. [2019-01-12 09:17:52,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-12 09:17:52,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2019-01-12 09:17:52,875 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 13 [2019-01-12 09:17:52,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:17:52,875 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2019-01-12 09:17:52,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 09:17:52,876 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2019-01-12 09:17:52,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-12 09:17:52,876 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:17:52,877 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:17:52,881 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:17:52,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:17:52,881 INFO L82 PathProgramCache]: Analyzing trace with hash 2036062252, now seen corresponding path program 1 times [2019-01-12 09:17:52,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:17:52,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:17:52,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:17:52,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:17:52,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:17:52,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:17:53,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 09:17:53,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:17:53,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 09:17:53,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 09:17:53,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 09:17:53,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:17:53,090 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. Second operand 5 states. [2019-01-12 09:17:53,429 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-12 09:17:53,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:17:53,763 INFO L93 Difference]: Finished difference Result 125 states and 139 transitions. [2019-01-12 09:17:53,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 09:17:53,765 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-01-12 09:17:53,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:17:53,768 INFO L225 Difference]: With dead ends: 125 [2019-01-12 09:17:53,769 INFO L226 Difference]: Without dead ends: 123 [2019-01-12 09:17:53,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 09:17:53,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-12 09:17:53,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 94. [2019-01-12 09:17:53,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-12 09:17:53,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2019-01-12 09:17:53,781 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 20 [2019-01-12 09:17:53,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:17:53,782 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2019-01-12 09:17:53,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 09:17:53,782 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2019-01-12 09:17:53,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-12 09:17:53,783 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:17:53,783 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:17:53,785 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:17:53,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:17:53,786 INFO L82 PathProgramCache]: Analyzing trace with hash 2014113239, now seen corresponding path program 1 times [2019-01-12 09:17:53,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:17:53,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:17:53,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:17:53,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:17:53,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:17:53,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:17:53,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 09:17:53,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:17:53,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 09:17:53,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 09:17:53,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 09:17:53,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:17:53,912 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand 5 states. [2019-01-12 09:17:54,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:17:54,408 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2019-01-12 09:17:54,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 09:17:54,409 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-01-12 09:17:54,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:17:54,410 INFO L225 Difference]: With dead ends: 94 [2019-01-12 09:17:54,410 INFO L226 Difference]: Without dead ends: 92 [2019-01-12 09:17:54,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 09:17:54,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-12 09:17:54,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-01-12 09:17:54,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-12 09:17:54,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2019-01-12 09:17:54,421 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 20 [2019-01-12 09:17:54,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:17:54,421 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2019-01-12 09:17:54,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 09:17:54,422 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2019-01-12 09:17:54,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 09:17:54,423 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:17:54,423 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:17:54,423 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:17:54,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:17:54,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1486605840, now seen corresponding path program 1 times [2019-01-12 09:17:54,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:17:54,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:17:54,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:17:54,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:17:54,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:17:54,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:17:54,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:17:54,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:17:54,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 09:17:54,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 09:17:54,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 09:17:54,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 09:17:54,586 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand 6 states. [2019-01-12 09:17:55,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:17:55,148 INFO L93 Difference]: Finished difference Result 210 states and 230 transitions. [2019-01-12 09:17:55,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 09:17:55,152 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-01-12 09:17:55,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:17:55,154 INFO L225 Difference]: With dead ends: 210 [2019-01-12 09:17:55,154 INFO L226 Difference]: Without dead ends: 208 [2019-01-12 09:17:55,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-01-12 09:17:55,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-01-12 09:17:55,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 98. [2019-01-12 09:17:55,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-12 09:17:55,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2019-01-12 09:17:55,181 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 23 [2019-01-12 09:17:55,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:17:55,182 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2019-01-12 09:17:55,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 09:17:55,182 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2019-01-12 09:17:55,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 09:17:55,183 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:17:55,183 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:17:55,184 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:17:55,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:17:55,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1760261746, now seen corresponding path program 1 times [2019-01-12 09:17:55,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:17:55,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:17:55,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:17:55,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:17:55,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:17:55,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:17:55,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:17:55,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:17:55,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 09:17:55,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 09:17:55,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 09:17:55,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 09:17:55,284 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand 6 states. [2019-01-12 09:17:55,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:17:55,709 INFO L93 Difference]: Finished difference Result 208 states and 228 transitions. [2019-01-12 09:17:55,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 09:17:55,710 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-01-12 09:17:55,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:17:55,713 INFO L225 Difference]: With dead ends: 208 [2019-01-12 09:17:55,713 INFO L226 Difference]: Without dead ends: 206 [2019-01-12 09:17:55,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-01-12 09:17:55,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-01-12 09:17:55,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 104. [2019-01-12 09:17:55,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-12 09:17:55,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2019-01-12 09:17:55,729 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 23 [2019-01-12 09:17:55,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:17:55,730 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2019-01-12 09:17:55,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 09:17:55,730 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2019-01-12 09:17:55,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-12 09:17:55,731 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:17:55,732 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:17:55,733 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:17:55,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:17:55,733 INFO L82 PathProgramCache]: Analyzing trace with hash -2060804288, now seen corresponding path program 1 times [2019-01-12 09:17:55,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:17:55,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:17:55,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:17:55,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:17:55,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:17:55,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:17:55,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:17:55,832 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 09:17:55,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 09:17:55 BoogieIcfgContainer [2019-01-12 09:17:55,871 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 09:17:55,872 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 09:17:55,872 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 09:17:55,872 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 09:17:55,873 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:17:51" (3/4) ... [2019-01-12 09:17:55,875 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 09:17:55,929 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 09:17:55,929 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 09:17:55,930 INFO L168 Benchmark]: Toolchain (without parser) took 6247.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 946.0 MB in the beginning and 855.4 MB in the end (delta: 90.6 MB). Peak memory consumption was 215.4 MB. Max. memory is 11.5 GB. [2019-01-12 09:17:55,931 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:17:55,932 INFO L168 Benchmark]: CACSL2BoogieTranslator took 678.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -163.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. [2019-01-12 09:17:55,932 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.88 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-12 09:17:55,933 INFO L168 Benchmark]: Boogie Preprocessor took 55.94 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-01-12 09:17:55,933 INFO L168 Benchmark]: RCFGBuilder took 1192.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.8 MB). Peak memory consumption was 51.8 MB. Max. memory is 11.5 GB. [2019-01-12 09:17:55,934 INFO L168 Benchmark]: TraceAbstraction took 4179.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 855.4 MB in the end (delta: 190.3 MB). Peak memory consumption was 190.3 MB. Max. memory is 11.5 GB. [2019-01-12 09:17:55,935 INFO L168 Benchmark]: Witness Printer took 57.34 ms. Allocated memory is still 1.2 GB. Free memory is still 855.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:17:55,939 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 678.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -163.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 77.88 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.94 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. * RCFGBuilder took 1192.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.8 MB). Peak memory consumption was 51.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4179.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 855.4 MB in the end (delta: 190.3 MB). Peak memory consumption was 190.3 MB. Max. memory is 11.5 GB. * Witness Printer took 57.34 ms. Allocated memory is still 1.2 GB. Free memory is still 855.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 554]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] node->next = node [L633] node->value = __VERIFIER_nondet_int() [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] item->slist = node [L638] item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L604] COND FALSE !(!(shape)) [L605] shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L612] EXPR shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L613] EXPR shape->slist [L613] COND FALSE !(!(shape->slist)) [L614] EXPR shape->slist [L614] EXPR shape->slist->next [L614] COND TRUE !(shape->slist->next == ((void *)0)) [L554] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 99 locations, 13 error locations. UNSAFE Result, 4.1s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 2.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 606 SDtfs, 1418 SDslu, 979 SDs, 0 SdLazy, 502 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 396 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 138 NumberOfCodeBlocks, 138 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 105 ConstructedInterpolants, 0 QuantifiedInterpolants, 9999 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 10/10 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...