./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/heap-manipulation/merge_sort_false-unreach-call_false-valid-memcleanup.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_87665cc1-8114-4761-b938-5ef245349333/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_87665cc1-8114-4761-b938-5ef245349333/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_87665cc1-8114-4761-b938-5ef245349333/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_87665cc1-8114-4761-b938-5ef245349333/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/heap-manipulation/merge_sort_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_87665cc1-8114-4761-b938-5ef245349333/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_87665cc1-8114-4761-b938-5ef245349333/bin-2019/utaipan --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 Taipan --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.23-635dfa2 [2018-12-03 01:19:22,596 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 01:19:22,597 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 01:19:22,603 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 01:19:22,603 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 01:19:22,604 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 01:19:22,605 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 01:19:22,605 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 01:19:22,606 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 01:19:22,607 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 01:19:22,607 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 01:19:22,607 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 01:19:22,608 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 01:19:22,608 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 01:19:22,609 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 01:19:22,609 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 01:19:22,609 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 01:19:22,610 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 01:19:22,611 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 01:19:22,612 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 01:19:22,612 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 01:19:22,613 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 01:19:22,614 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 01:19:22,614 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 01:19:22,614 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 01:19:22,615 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 01:19:22,615 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 01:19:22,616 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 01:19:22,616 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 01:19:22,617 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 01:19:22,617 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 01:19:22,617 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 01:19:22,617 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 01:19:22,617 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 01:19:22,618 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 01:19:22,618 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 01:19:22,619 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_87665cc1-8114-4761-b938-5ef245349333/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-03 01:19:22,626 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 01:19:22,626 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 01:19:22,626 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 01:19:22,626 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 01:19:22,626 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 01:19:22,627 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 01:19:22,627 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 01:19:22,627 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 01:19:22,627 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 01:19:22,627 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 01:19:22,627 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 01:19:22,627 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 01:19:22,627 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 01:19:22,628 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 01:19:22,628 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 01:19:22,628 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 01:19:22,628 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 01:19:22,628 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 01:19:22,628 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 01:19:22,628 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 01:19:22,628 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 01:19:22,628 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 01:19:22,628 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 01:19:22,628 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 01:19:22,629 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 01:19:22,629 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 01:19:22,629 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 01:19:22,629 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 01:19:22,629 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 01:19:22,629 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 01:19:22,629 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 01:19:22,629 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 01:19:22,629 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 01:19:22,629 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 01:19:22,629 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 01:19:22,630 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 01:19:22,630 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_87665cc1-8114-4761-b938-5ef245349333/bin-2019/utaipan 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 -> Taipan 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 [2018-12-03 01:19:22,647 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 01:19:22,654 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 01:19:22,656 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 01:19:22,656 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 01:19:22,657 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 01:19:22,657 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_87665cc1-8114-4761-b938-5ef245349333/bin-2019/utaipan/../../sv-benchmarks/c/heap-manipulation/merge_sort_false-unreach-call_false-valid-memcleanup.i [2018-12-03 01:19:22,690 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_87665cc1-8114-4761-b938-5ef245349333/bin-2019/utaipan/data/4b2d923a0/0159274ad7be4a7da6f9c799b7e95396/FLAG97c17d29d [2018-12-03 01:19:23,047 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 01:19:23,048 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_87665cc1-8114-4761-b938-5ef245349333/sv-benchmarks/c/heap-manipulation/merge_sort_false-unreach-call_false-valid-memcleanup.i [2018-12-03 01:19:23,053 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_87665cc1-8114-4761-b938-5ef245349333/bin-2019/utaipan/data/4b2d923a0/0159274ad7be4a7da6f9c799b7e95396/FLAG97c17d29d [2018-12-03 01:19:23,434 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_87665cc1-8114-4761-b938-5ef245349333/bin-2019/utaipan/data/4b2d923a0/0159274ad7be4a7da6f9c799b7e95396 [2018-12-03 01:19:23,436 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 01:19:23,437 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 01:19:23,437 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 01:19:23,438 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 01:19:23,439 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 01:19:23,440 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 01:19:23" (1/1) ... [2018-12-03 01:19:23,441 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f6040bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:19:23, skipping insertion in model container [2018-12-03 01:19:23,442 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 01:19:23" (1/1) ... [2018-12-03 01:19:23,447 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 01:19:23,472 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 01:19:23,637 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 01:19:23,643 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 01:19:23,706 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 01:19:23,732 INFO L195 MainTranslator]: Completed translation [2018-12-03 01:19:23,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:19:23 WrapperNode [2018-12-03 01:19:23,732 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 01:19:23,733 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 01:19:23,733 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 01:19:23,733 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 01:19:23,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:19:23" (1/1) ... [2018-12-03 01:19:23,749 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:19:23" (1/1) ... [2018-12-03 01:19:23,754 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 01:19:23,754 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 01:19:23,754 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 01:19:23,754 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 01:19:23,760 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:19:23" (1/1) ... [2018-12-03 01:19:23,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:19:23" (1/1) ... [2018-12-03 01:19:23,763 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:19:23" (1/1) ... [2018-12-03 01:19:23,763 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:19:23" (1/1) ... [2018-12-03 01:19:23,773 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:19:23" (1/1) ... [2018-12-03 01:19:23,779 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:19:23" (1/1) ... [2018-12-03 01:19:23,781 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:19:23" (1/1) ... [2018-12-03 01:19:23,783 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 01:19:23,783 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 01:19:23,783 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 01:19:23,784 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 01:19:23,784 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:19:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_87665cc1-8114-4761-b938-5ef245349333/bin-2019/utaipan/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 [2018-12-03 01:19:23,816 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_before [2018-12-03 01:19:23,816 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_before [2018-12-03 01:19:23,816 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_after [2018-12-03 01:19:23,816 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_after [2018-12-03 01:19:23,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 01:19:23,816 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-03 01:19:23,816 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2018-12-03 01:19:23,816 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2018-12-03 01:19:23,816 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2018-12-03 01:19:23,816 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2018-12-03 01:19:23,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-03 01:19:23,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 01:19:23,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 01:19:23,817 INFO L130 BoogieDeclarations]: Found specification of procedure merge_pair [2018-12-03 01:19:23,817 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_pair [2018-12-03 01:19:23,817 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 01:19:23,817 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 01:19:23,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-03 01:19:23,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-03 01:19:23,817 INFO L130 BoogieDeclarations]: Found specification of procedure seq_sort_core [2018-12-03 01:19:23,817 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_sort_core [2018-12-03 01:19:23,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 01:19:23,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 01:19:23,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 01:19:24,116 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 01:19:24,117 INFO L280 CfgBuilder]: Removed 33 assue(true) statements. [2018-12-03 01:19:24,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:19:24 BoogieIcfgContainer [2018-12-03 01:19:24,117 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 01:19:24,118 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 01:19:24,118 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 01:19:24,120 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 01:19:24,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 01:19:23" (1/3) ... [2018-12-03 01:19:24,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dcedaf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 01:19:24, skipping insertion in model container [2018-12-03 01:19:24,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:19:23" (2/3) ... [2018-12-03 01:19:24,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dcedaf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 01:19:24, skipping insertion in model container [2018-12-03 01:19:24,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:19:24" (3/3) ... [2018-12-03 01:19:24,122 INFO L112 eAbstractionObserver]: Analyzing ICFG merge_sort_false-unreach-call_false-valid-memcleanup.i [2018-12-03 01:19:24,128 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 01:19:24,133 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 01:19:24,142 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 01:19:24,162 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 01:19:24,163 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 01:19:24,163 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 01:19:24,163 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 01:19:24,163 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 01:19:24,163 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 01:19:24,163 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 01:19:24,163 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 01:19:24,174 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states. [2018-12-03 01:19:24,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 01:19:24,177 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:19:24,177 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:19:24,179 INFO L423 AbstractCegarLoop]: === Iteration 1 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:19:24,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:19:24,182 INFO L82 PathProgramCache]: Analyzing trace with hash 533567477, now seen corresponding path program 1 times [2018-12-03 01:19:24,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:19:24,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:19:24,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:19:24,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:19:24,216 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:19:24,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:19:24,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:19:24,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:19:24,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 01:19:24,254 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:19:24,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-03 01:19:24,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-03 01:19:24,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-03 01:19:24,267 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 2 states. [2018-12-03 01:19:24,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:19:24,288 INFO L93 Difference]: Finished difference Result 222 states and 373 transitions. [2018-12-03 01:19:24,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-03 01:19:24,289 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-12-03 01:19:24,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:19:24,296 INFO L225 Difference]: With dead ends: 222 [2018-12-03 01:19:24,296 INFO L226 Difference]: Without dead ends: 103 [2018-12-03 01:19:24,299 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 [2018-12-03 01:19:24,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-03 01:19:24,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-03 01:19:24,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-03 01:19:24,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2018-12-03 01:19:24,327 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 13 [2018-12-03 01:19:24,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:19:24,327 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2018-12-03 01:19:24,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-03 01:19:24,327 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2018-12-03 01:19:24,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 01:19:24,328 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:19:24,328 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:19:24,328 INFO L423 AbstractCegarLoop]: === Iteration 2 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:19:24,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:19:24,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1718675266, now seen corresponding path program 1 times [2018-12-03 01:19:24,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:19:24,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:19:24,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:19:24,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:19:24,330 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:19:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:19:24,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:19:24,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:19:24,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 01:19:24,369 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:19:24,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 01:19:24,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 01:19:24,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 01:19:24,371 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand 3 states. [2018-12-03 01:19:24,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:19:24,399 INFO L93 Difference]: Finished difference Result 200 states and 246 transitions. [2018-12-03 01:19:24,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 01:19:24,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 01:19:24,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:19:24,401 INFO L225 Difference]: With dead ends: 200 [2018-12-03 01:19:24,402 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 01:19:24,403 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 [2018-12-03 01:19:24,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 01:19:24,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2018-12-03 01:19:24,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-03 01:19:24,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2018-12-03 01:19:24,412 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 14 [2018-12-03 01:19:24,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:19:24,412 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2018-12-03 01:19:24,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 01:19:24,412 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2018-12-03 01:19:24,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 01:19:24,413 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:19:24,413 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:19:24,413 INFO L423 AbstractCegarLoop]: === Iteration 3 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:19:24,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:19:24,413 INFO L82 PathProgramCache]: Analyzing trace with hash -107362549, now seen corresponding path program 1 times [2018-12-03 01:19:24,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:19:24,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:19:24,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:19:24,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:19:24,415 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:19:24,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:19:24,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:19:24,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:19:24,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 01:19:24,473 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:19:24,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 01:19:24,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 01:19:24,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 01:19:24,474 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand 6 states. [2018-12-03 01:19:24,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:19:24,566 INFO L93 Difference]: Finished difference Result 151 states and 184 transitions. [2018-12-03 01:19:24,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 01:19:24,567 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-12-03 01:19:24,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:19:24,567 INFO L225 Difference]: With dead ends: 151 [2018-12-03 01:19:24,567 INFO L226 Difference]: Without dead ends: 146 [2018-12-03 01:19:24,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-03 01:19:24,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-03 01:19:24,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 108. [2018-12-03 01:19:24,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 01:19:24,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 131 transitions. [2018-12-03 01:19:24,576 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 131 transitions. Word has length 20 [2018-12-03 01:19:24,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:19:24,576 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 131 transitions. [2018-12-03 01:19:24,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 01:19:24,576 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 131 transitions. [2018-12-03 01:19:24,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 01:19:24,577 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:19:24,577 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, 1] [2018-12-03 01:19:24,577 INFO L423 AbstractCegarLoop]: === Iteration 4 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:19:24,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:19:24,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1290121333, now seen corresponding path program 1 times [2018-12-03 01:19:24,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:19:24,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:19:24,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:19:24,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:19:24,578 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:19:24,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:19:24,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 01:19:24,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:19:24,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 01:19:24,633 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:19:24,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 01:19:24,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 01:19:24,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:19:24,634 INFO L87 Difference]: Start difference. First operand 108 states and 131 transitions. Second operand 5 states. [2018-12-03 01:19:24,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:19:24,754 INFO L93 Difference]: Finished difference Result 110 states and 132 transitions. [2018-12-03 01:19:24,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 01:19:24,754 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-12-03 01:19:24,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:19:24,755 INFO L225 Difference]: With dead ends: 110 [2018-12-03 01:19:24,755 INFO L226 Difference]: Without dead ends: 107 [2018-12-03 01:19:24,755 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 [2018-12-03 01:19:24,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-03 01:19:24,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-03 01:19:24,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-03 01:19:24,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 129 transitions. [2018-12-03 01:19:24,761 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 129 transitions. Word has length 27 [2018-12-03 01:19:24,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:19:24,761 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 129 transitions. [2018-12-03 01:19:24,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 01:19:24,761 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 129 transitions. [2018-12-03 01:19:24,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 01:19:24,762 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:19:24,762 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, 1] [2018-12-03 01:19:24,762 INFO L423 AbstractCegarLoop]: === Iteration 5 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:19:24,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:19:24,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1615537323, now seen corresponding path program 1 times [2018-12-03 01:19:24,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:19:24,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:19:24,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:19:24,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:19:24,763 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:19:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:19:24,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 01:19:24,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:19:24,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 01:19:24,798 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:19:24,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 01:19:24,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 01:19:24,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 01:19:24,799 INFO L87 Difference]: Start difference. First operand 107 states and 129 transitions. Second operand 5 states. [2018-12-03 01:19:24,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:19:24,914 INFO L93 Difference]: Finished difference Result 109 states and 130 transitions. [2018-12-03 01:19:24,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 01:19:24,914 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-12-03 01:19:24,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:19:24,915 INFO L225 Difference]: With dead ends: 109 [2018-12-03 01:19:24,915 INFO L226 Difference]: Without dead ends: 106 [2018-12-03 01:19:24,915 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 [2018-12-03 01:19:24,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-03 01:19:24,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-12-03 01:19:24,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 01:19:24,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 127 transitions. [2018-12-03 01:19:24,921 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 127 transitions. Word has length 27 [2018-12-03 01:19:24,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:19:24,921 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 127 transitions. [2018-12-03 01:19:24,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 01:19:24,921 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 127 transitions. [2018-12-03 01:19:24,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 01:19:24,922 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:19:24,922 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, 1, 1, 1, 1] [2018-12-03 01:19:24,922 INFO L423 AbstractCegarLoop]: === Iteration 6 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:19:24,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:19:24,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1872008122, now seen corresponding path program 1 times [2018-12-03 01:19:24,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:19:24,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:19:24,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:19:24,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:19:24,923 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:19:24,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:19:24,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:19:24,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:19:24,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 01:19:24,972 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:19:24,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 01:19:24,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 01:19:24,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 01:19:24,973 INFO L87 Difference]: Start difference. First operand 106 states and 127 transitions. Second operand 7 states. [2018-12-03 01:19:25,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:19:25,147 INFO L93 Difference]: Finished difference Result 141 states and 167 transitions. [2018-12-03 01:19:25,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 01:19:25,148 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-12-03 01:19:25,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:19:25,148 INFO L225 Difference]: With dead ends: 141 [2018-12-03 01:19:25,148 INFO L226 Difference]: Without dead ends: 138 [2018-12-03 01:19:25,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-03 01:19:25,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-03 01:19:25,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 112. [2018-12-03 01:19:25,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 01:19:25,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2018-12-03 01:19:25,156 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 133 transitions. Word has length 30 [2018-12-03 01:19:25,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:19:25,156 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 133 transitions. [2018-12-03 01:19:25,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 01:19:25,156 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 133 transitions. [2018-12-03 01:19:25,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 01:19:25,157 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:19:25,157 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, 1, 1, 1, 1] [2018-12-03 01:19:25,157 INFO L423 AbstractCegarLoop]: === Iteration 7 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:19:25,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:19:25,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1085071641, now seen corresponding path program 1 times [2018-12-03 01:19:25,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:19:25,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:19:25,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:19:25,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:19:25,159 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:19:25,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:19:25,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:19:25,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 01:19:25,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 01:19:25,201 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 01:19:25,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 01:19:25,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 01:19:25,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 01:19:25,201 INFO L87 Difference]: Start difference. First operand 112 states and 133 transitions. Second operand 7 states. [2018-12-03 01:19:25,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:19:25,358 INFO L93 Difference]: Finished difference Result 140 states and 165 transitions. [2018-12-03 01:19:25,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 01:19:25,358 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-12-03 01:19:25,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:19:25,359 INFO L225 Difference]: With dead ends: 140 [2018-12-03 01:19:25,359 INFO L226 Difference]: Without dead ends: 137 [2018-12-03 01:19:25,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-03 01:19:25,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-03 01:19:25,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 118. [2018-12-03 01:19:25,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-03 01:19:25,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 139 transitions. [2018-12-03 01:19:25,364 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 139 transitions. Word has length 30 [2018-12-03 01:19:25,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:19:25,365 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 139 transitions. [2018-12-03 01:19:25,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 01:19:25,365 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2018-12-03 01:19:25,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 01:19:25,365 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:19:25,365 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:19:25,365 INFO L423 AbstractCegarLoop]: === Iteration 8 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:19:25,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:19:25,365 INFO L82 PathProgramCache]: Analyzing trace with hash 956444098, now seen corresponding path program 1 times [2018-12-03 01:19:25,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:19:25,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:19:25,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:19:25,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:19:25,366 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:19:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:19:25,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:19:25,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:19:25,544 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 01:19:25,545 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 34 with the following transitions: [2018-12-03 01:19:25,546 INFO L205 CegarAbsIntRunner]: [24], [33], [37], [44], [49], [58], [62], [69], [75], [79], [86], [92], [96], [103], [106], [190], [195], [198], [200], [205], [207], [212], [214], [221], [339], [342], [343], [400], [410], [428], [429], [430] [2018-12-03 01:19:25,567 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 01:19:25,567 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 01:19:25,690 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 01:19:25,690 INFO L272 AbstractInterpreter]: Visited 32 different actions 40 times. Merged at 7 different actions 7 times. Never widened. Performed 321 root evaluator evaluations with a maximum evaluation depth of 3. Performed 321 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-12-03 01:19:25,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:19:25,696 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 01:19:25,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 01:19:25,696 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_87665cc1-8114-4761-b938-5ef245349333/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 01:19:25,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:19:25,715 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 01:19:25,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 01:19:25,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 01:19:25,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 14 treesize of output 11 [2018-12-03 01:19:25,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 11 treesize of output 14 [2018-12-03 01:19:25,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 14 treesize of output 15 [2018-12-03 01:19:25,795 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 01:19:25,798 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:19:25,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:19:25,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 14 treesize of output 11 [2018-12-03 01:19:25,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 11 treesize of output 14 [2018-12-03 01:19:25,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 14 treesize of output 15 [2018-12-03 01:19:25,815 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 01:19:25,817 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:19:25,820 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:19:25,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:19:25,826 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:32, output treesize:18 [2018-12-03 01:19:25,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2018-12-03 01:19:25,856 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-03 01:19:25,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 01:19:25,858 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:19:25,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2018-12-03 01:19:25,866 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-03 01:19:25,867 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 01:19:25,868 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:19:25,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 01:19:25,870 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-12-03 01:19:25,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:19:25,878 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 01:19:25,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 01:19:25,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 01:19:25,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 14 [2018-12-03 01:19:25,939 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 01:19:25,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 01:19:25,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 01:19:25,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-12-03 01:19:25,939 INFO L87 Difference]: Start difference. First operand 118 states and 139 transitions. Second operand 11 states. [2018-12-03 01:19:26,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 01:19:26,126 INFO L93 Difference]: Finished difference Result 241 states and 286 transitions. [2018-12-03 01:19:26,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 01:19:26,126 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2018-12-03 01:19:26,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 01:19:26,127 INFO L225 Difference]: With dead ends: 241 [2018-12-03 01:19:26,127 INFO L226 Difference]: Without dead ends: 151 [2018-12-03 01:19:26,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 58 SyntacticMatches, 8 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-12-03 01:19:26,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-12-03 01:19:26,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 144. [2018-12-03 01:19:26,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-12-03 01:19:26,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 167 transitions. [2018-12-03 01:19:26,135 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 167 transitions. Word has length 33 [2018-12-03 01:19:26,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 01:19:26,135 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 167 transitions. [2018-12-03 01:19:26,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 01:19:26,135 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 167 transitions. [2018-12-03 01:19:26,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 01:19:26,136 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 01:19:26,136 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 01:19:26,136 INFO L423 AbstractCegarLoop]: === Iteration 9 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 01:19:26,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 01:19:26,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1584953832, now seen corresponding path program 1 times [2018-12-03 01:19:26,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 01:19:26,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:19:26,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 01:19:26,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 01:19:26,138 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 01:19:26,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:19:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 01:19:26,171 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 01:19:26,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 01:19:26 BoogieIcfgContainer [2018-12-03 01:19:26,195 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 01:19:26,195 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 01:19:26,195 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 01:19:26,195 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 01:19:26,195 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:19:24" (3/4) ... [2018-12-03 01:19:26,197 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-03 01:19:26,226 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_87665cc1-8114-4761-b938-5ef245349333/bin-2019/utaipan/witness.graphml [2018-12-03 01:19:26,226 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 01:19:26,227 INFO L168 Benchmark]: Toolchain (without parser) took 2790.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 208.1 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -139.9 MB). Peak memory consumption was 68.2 MB. Max. memory is 11.5 GB. [2018-12-03 01:19:26,227 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 01:19:26,228 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -151.4 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. [2018-12-03 01:19:26,228 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.09 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. [2018-12-03 01:19:26,228 INFO L168 Benchmark]: Boogie Preprocessor took 29.06 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-03 01:19:26,228 INFO L168 Benchmark]: RCFGBuilder took 333.78 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: 48.1 MB). Peak memory consumption was 48.1 MB. Max. memory is 11.5 GB. [2018-12-03 01:19:26,228 INFO L168 Benchmark]: TraceAbstraction took 2076.77 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 83.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -43.4 MB). Peak memory consumption was 40.5 MB. Max. memory is 11.5 GB. [2018-12-03 01:19:26,229 INFO L168 Benchmark]: Witness Printer took 31.20 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. [2018-12-03 01:19:26,230 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 295.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 956.0 MB in the beginning and 1.1 GB in the end (delta: -151.4 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.09 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. * Boogie Preprocessor took 29.06 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 333.78 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: 48.1 MB). Peak memory consumption was 48.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2076.77 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 83.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -43.4 MB). Peak memory consumption was 40.5 MB. Max. memory is 11.5 GB. * Witness Printer took 31.20 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: 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); VAL [data={0:0}] [L628] COND TRUE __VERIFIER_nondet_int() [L629] struct node *node = malloc(sizeof *node); VAL [data={0:0}, malloc(sizeof *node)={14:0}, node={14:0}] [L630] COND FALSE !(!node) VAL [data={0:0}, malloc(sizeof *node)={14:0}, node={14:0}] [L632] node->next = node [L633] node->value = __VERIFIER_nondet_int() [L634] struct list *item = malloc(sizeof *item); VAL [data={0:0}, item={10:0}, malloc(sizeof *item)={10:0}, malloc(sizeof *node)={14:0}, node={14:0}] [L635] COND FALSE !(!item) VAL [data={0:0}, item={10:0}, malloc(sizeof *item)={10:0}, malloc(sizeof *node)={14:0}, node={14:0}] [L637] item->slist = node [L638] item->next = data [L639] data = item VAL [data={10:0}, item={10:0}, malloc(sizeof *item)={10:0}, malloc(sizeof *node)={14:0}, node={14:0}] [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) VAL [data={10:0}, item={10:0}, malloc(sizeof *item)={10:0}, malloc(sizeof *node)={14:0}, node={14:0}] [L643] CALL inspect_before(data) VAL [shape={10:0}] [L604] COND FALSE !(!(shape)) VAL [shape={10:0}, shape={10:0}] [L605] shape->next VAL [shape={10:0}, shape={10:0}, shape->next={0:0}] [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) VAL [shape={10:0}, shape={10:0}] [L612] EXPR shape->next VAL [shape={10:0}, shape={10:0}, shape->next={0:0}] [L612] COND FALSE !(!(shape->next == ((void *)0))) [L613] EXPR shape->slist VAL [shape={10:0}, shape={10:0}, shape->slist={14:0}] [L613] COND FALSE !(!(shape->slist)) [L614] EXPR shape->slist [L614] EXPR shape->slist->next VAL [shape={10:0}, shape={10:0}, shape->slist={14:0}, shape->slist->next={14:0}] [L614] COND TRUE !(shape->slist->next == ((void *)0)) [L614] CALL fail() [L554] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 115 locations, 1 error locations. UNSAFE Result, 2.0s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 918 SDtfs, 391 SDslu, 2420 SDs, 0 SdLazy, 819 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 75 SyntacticMatches, 8 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 94 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 260 NumberOfCodeBlocks, 260 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 250 ConstructedInterpolants, 0 QuantifiedInterpolants, 41638 SizeOfPredicates, 16 NumberOfNonLiveVariables, 125 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 10/16 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...