./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/list-properties/list_search-1.i --full-output --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 264dba86 Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-properties/list_search-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.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 valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8b9ae191666cff52a5646f600ca779e3fb8cdedc --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported: (forall ((v_DerPreprocessor_5 (_ BitVec 32))) (exists ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (v_insert_list_~l.base_141 (_ BitVec 32))) (let ((.cse2 (store (select |#memory_$Pointer$.base| insert_list_~l.base) (bvadd insert_list_~l.offset (_ bv2 32)) v_DerPreprocessor_5))) (or (let ((.cse0 (select |old(#memory_$Pointer$.base)| v_insert_list_~l.base_141))) (let ((.cse1 (store .cse0 (_ bv2 32) v_DerPreprocessor_4))) (and (= v_DerPreprocessor_3 (select (store .cse0 (_ bv2 32) v_DerPreprocessor_3) (_ bv0 32))) (= v_DerPreprocessor_4 (select .cse1 (_ bv0 32))) (= (select |old(#valid)| v_insert_list_~l.base_141) (_ bv0 1)) (not (= (_ bv1 1) (select (store |old(#valid)| v_insert_list_~l.base_141 (_ bv1 1)) (select (select (store |old(#memory_$Pointer$.base)| v_insert_list_~l.base_141 (store .cse1 (_ bv4 32) |old(~head~0.base)|)) |old(~head~0.base)|) (bvadd |old(~head~0.offset)| (_ bv4 32))))))))) (not (= (_ bv1 1) (select |#valid| insert_list_~l.base))) (not (= v_DerPreprocessor_5 (select .cse2 insert_list_~l.offset))) (= (_ bv1 1) (select |#valid| (select (select (store |#memory_$Pointer$.base| insert_list_~l.base (store .cse2 (bvadd insert_list_~l.offset (_ bv4 32)) ~head~0.base)) ~head~0.base) (bvadd ~head~0.offset (_ bv4 32))))))))) --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-264dba8 [2019-11-21 13:28:06,594 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-21 13:28:06,597 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-21 13:28:06,615 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-21 13:28:06,615 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-21 13:28:06,617 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-21 13:28:06,619 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-21 13:28:06,632 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-21 13:28:06,634 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-21 13:28:06,637 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-21 13:28:06,638 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-21 13:28:06,640 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-21 13:28:06,640 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-21 13:28:06,646 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-21 13:28:06,647 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-21 13:28:06,649 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-21 13:28:06,651 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-21 13:28:06,654 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-21 13:28:06,657 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-21 13:28:06,663 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-21 13:28:06,667 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-21 13:28:06,670 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-21 13:28:06,673 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-21 13:28:06,675 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-21 13:28:06,679 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-21 13:28:06,680 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-21 13:28:06,680 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-21 13:28:06,681 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-21 13:28:06,682 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-21 13:28:06,683 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-21 13:28:06,683 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-21 13:28:06,684 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-21 13:28:06,685 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-21 13:28:06,686 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-21 13:28:06,687 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-21 13:28:06,687 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-21 13:28:06,688 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-21 13:28:06,688 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-21 13:28:06,688 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-21 13:28:06,689 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-21 13:28:06,690 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-21 13:28:06,691 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2019-11-21 13:28:06,706 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-21 13:28:06,706 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-21 13:28:06,707 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-21 13:28:06,708 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-21 13:28:06,708 INFO L138 SettingsManager]: * Use SBE=true [2019-11-21 13:28:06,708 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-21 13:28:06,709 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-21 13:28:06,709 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-21 13:28:06,709 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-21 13:28:06,710 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-21 13:28:06,710 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-21 13:28:06,710 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-21 13:28:06,710 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-21 13:28:06,711 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-21 13:28:06,711 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-21 13:28:06,711 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-21 13:28:06,712 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-21 13:28:06,712 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-21 13:28:06,712 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-21 13:28:06,712 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-21 13:28:06,713 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-21 13:28:06,713 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-21 13:28:06,713 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-21 13:28:06,714 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-21 13:28:06,714 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-21 13:28:06,714 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-21 13:28:06,715 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-21 13:28:06,715 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-21 13:28:06,715 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 valid-memcleanup) ) 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 -> 8b9ae191666cff52a5646f600ca779e3fb8cdedc Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2019-11-21 13:28:07,016 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-21 13:28:07,030 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-21 13:28:07,033 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-21 13:28:07,035 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-21 13:28:07,035 INFO L275 PluginConnector]: CDTParser initialized [2019-11-21 13:28:07,036 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list_search-1.i [2019-11-21 13:28:07,107 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/582f2c8b3/889b809102a340cdb625e80750d18f57/FLAGe4ea0a7d2 [2019-11-21 13:28:07,686 INFO L306 CDTParser]: Found 1 translation units. [2019-11-21 13:28:07,687 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_search-1.i [2019-11-21 13:28:07,708 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/582f2c8b3/889b809102a340cdb625e80750d18f57/FLAGe4ea0a7d2 [2019-11-21 13:28:07,944 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/582f2c8b3/889b809102a340cdb625e80750d18f57 [2019-11-21 13:28:07,948 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-21 13:28:07,950 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-21 13:28:07,951 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-21 13:28:07,951 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-21 13:28:07,954 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-21 13:28:07,955 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:28:07" (1/1) ... [2019-11-21 13:28:07,958 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@760d99d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:28:07, skipping insertion in model container [2019-11-21 13:28:07,958 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:28:07" (1/1) ... [2019-11-21 13:28:07,966 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-21 13:28:08,002 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 13:28:08,430 INFO L966 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-21 13:28:08,430 INFO L969 CHandler]: at location: C: (mlist*)malloc(sizeof(mlist)) [531] [2019-11-21 13:28:08,431 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 13:28:08,441 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 13:28:08,455 INFO L198 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-21 13:28:08,463 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 13:28:08,506 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 13:28:08,518 INFO L201 MainTranslator]: Completed pre-run [2019-11-21 13:28:08,560 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 13:28:08,633 INFO L205 MainTranslator]: Completed translation [2019-11-21 13:28:08,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:28:08 WrapperNode [2019-11-21 13:28:08,634 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-21 13:28:08,635 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-21 13:28:08,635 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-21 13:28:08,635 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-21 13:28:08,649 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:28:08" (1/1) ... [2019-11-21 13:28:08,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:28:08" (1/1) ... [2019-11-21 13:28:08,672 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:28:08" (1/1) ... [2019-11-21 13:28:08,673 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:28:08" (1/1) ... [2019-11-21 13:28:08,694 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:28:08" (1/1) ... [2019-11-21 13:28:08,699 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:28:08" (1/1) ... [2019-11-21 13:28:08,705 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:28:08" (1/1) ... [2019-11-21 13:28:08,721 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-21 13:28:08,722 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-21 13:28:08,722 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-21 13:28:08,722 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-21 13:28:08,724 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:28:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-21 13:28:08,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-21 13:28:08,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-21 13:28:08,784 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-21 13:28:08,784 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-21 13:28:08,785 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-21 13:28:08,785 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-21 13:28:08,786 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-21 13:28:08,786 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-21 13:28:08,786 INFO L138 BoogieDeclarations]: Found implementation of procedure search_list [2019-11-21 13:28:08,786 INFO L138 BoogieDeclarations]: Found implementation of procedure insert_list [2019-11-21 13:28:08,788 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-21 13:28:08,789 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-21 13:28:08,789 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-21 13:28:08,789 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-21 13:28:08,790 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-21 13:28:08,790 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-21 13:28:08,790 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-21 13:28:08,790 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-21 13:28:08,790 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-21 13:28:08,791 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-21 13:28:08,791 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-21 13:28:08,792 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-21 13:28:08,792 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-21 13:28:08,792 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-21 13:28:08,792 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-21 13:28:08,792 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-21 13:28:08,792 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-21 13:28:08,793 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-21 13:28:08,793 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-21 13:28:08,793 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-21 13:28:08,793 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-21 13:28:08,793 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-21 13:28:08,793 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-21 13:28:08,793 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-21 13:28:08,793 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-21 13:28:08,794 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-21 13:28:08,794 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-21 13:28:08,794 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-21 13:28:08,795 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-21 13:28:08,795 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-21 13:28:08,795 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-21 13:28:08,795 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-21 13:28:08,795 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-21 13:28:08,795 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-21 13:28:08,795 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-21 13:28:08,795 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-21 13:28:08,796 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-21 13:28:08,796 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-21 13:28:08,796 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-21 13:28:08,796 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-21 13:28:08,796 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-21 13:28:08,797 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-21 13:28:08,797 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-21 13:28:08,797 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-21 13:28:08,797 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-21 13:28:08,797 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-21 13:28:08,797 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-21 13:28:08,797 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-21 13:28:08,797 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-21 13:28:08,798 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-21 13:28:08,798 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-21 13:28:08,798 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-21 13:28:08,799 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-21 13:28:08,799 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-21 13:28:08,799 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-21 13:28:08,799 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-21 13:28:08,800 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-21 13:28:08,801 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-21 13:28:08,802 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-21 13:28:08,802 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-21 13:28:08,802 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-21 13:28:08,802 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-21 13:28:08,802 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-21 13:28:08,802 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-21 13:28:08,803 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-21 13:28:08,803 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-21 13:28:08,804 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-21 13:28:08,804 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-21 13:28:08,804 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-21 13:28:08,804 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-21 13:28:08,804 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-21 13:28:08,804 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-21 13:28:08,804 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-21 13:28:08,805 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-21 13:28:08,805 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-21 13:28:08,805 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-21 13:28:08,805 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-21 13:28:08,805 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-21 13:28:08,805 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-21 13:28:08,805 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-21 13:28:08,806 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-21 13:28:08,806 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-21 13:28:08,806 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-21 13:28:08,806 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-21 13:28:08,806 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-21 13:28:08,806 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-21 13:28:08,806 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-21 13:28:08,806 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-21 13:28:08,807 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-21 13:28:08,807 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-21 13:28:08,807 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-21 13:28:08,807 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-21 13:28:08,807 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-21 13:28:08,807 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-21 13:28:08,807 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-21 13:28:08,807 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-21 13:28:08,808 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-21 13:28:08,808 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-21 13:28:08,808 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-21 13:28:08,808 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-21 13:28:08,809 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-21 13:28:08,809 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-21 13:28:08,809 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-21 13:28:08,809 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-21 13:28:08,809 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-21 13:28:08,810 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-21 13:28:08,810 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-21 13:28:08,810 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-21 13:28:08,810 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-21 13:28:08,810 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-21 13:28:08,810 INFO L130 BoogieDeclarations]: Found specification of procedure search_list [2019-11-21 13:28:08,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-21 13:28:08,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-21 13:28:08,811 INFO L130 BoogieDeclarations]: Found specification of procedure insert_list [2019-11-21 13:28:08,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-21 13:28:08,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-21 13:28:08,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-21 13:28:08,816 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-21 13:28:08,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-21 13:28:08,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-21 13:28:08,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-21 13:28:09,550 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-21 13:28:09,550 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-21 13:28:09,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:28:09 BoogieIcfgContainer [2019-11-21 13:28:09,552 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-21 13:28:09,553 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-21 13:28:09,553 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-21 13:28:09,556 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-21 13:28:09,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:28:07" (1/3) ... [2019-11-21 13:28:09,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5879be3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:28:09, skipping insertion in model container [2019-11-21 13:28:09,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:28:08" (2/3) ... [2019-11-21 13:28:09,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5879be3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:28:09, skipping insertion in model container [2019-11-21 13:28:09,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:28:09" (3/3) ... [2019-11-21 13:28:09,560 INFO L109 eAbstractionObserver]: Analyzing ICFG list_search-1.i [2019-11-21 13:28:09,570 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-21 13:28:09,578 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2019-11-21 13:28:09,590 INFO L249 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2019-11-21 13:28:09,609 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-21 13:28:09,610 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-21 13:28:09,610 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-21 13:28:09,610 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-21 13:28:09,610 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-21 13:28:09,610 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-21 13:28:09,610 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-21 13:28:09,610 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-21 13:28:09,628 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2019-11-21 13:28:09,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-21 13:28:09,638 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:28:09,639 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:28:09,640 INFO L410 AbstractCegarLoop]: === Iteration 1 === [insert_listErr4REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION]=== [2019-11-21 13:28:09,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:28:09,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1520208519, now seen corresponding path program 1 times [2019-11-21 13:28:09,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:28:09,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1979809309] [2019-11-21 13:28:09,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:28:09,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:28:09,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-21 13:28:09,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:28:09,994 INFO L377 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 13:28:09,994 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:28:10,005 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:28:10,006 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:28:10,006 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 13:28:10,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:28:10,018 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:28:10,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:28:10,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1979809309] [2019-11-21 13:28:10,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 13:28:10,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-21 13:28:10,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386736644] [2019-11-21 13:28:10,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-21 13:28:10,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:28:10,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-21 13:28:10,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-21 13:28:10,058 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 3 states. [2019-11-21 13:28:10,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:28:10,222 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2019-11-21 13:28:10,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 13:28:10,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-21 13:28:10,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:28:10,235 INFO L225 Difference]: With dead ends: 70 [2019-11-21 13:28:10,236 INFO L226 Difference]: Without dead ends: 66 [2019-11-21 13:28:10,237 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-21 13:28:10,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-21 13:28:10,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-11-21 13:28:10,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-21 13:28:10,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2019-11-21 13:28:10,286 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 9 [2019-11-21 13:28:10,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:28:10,286 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2019-11-21 13:28:10,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-21 13:28:10,287 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2019-11-21 13:28:10,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-21 13:28:10,287 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:28:10,287 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:28:10,499 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:28:10,500 INFO L410 AbstractCegarLoop]: === Iteration 2 === [insert_listErr4REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION]=== [2019-11-21 13:28:10,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:28:10,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1520208520, now seen corresponding path program 1 times [2019-11-21 13:28:10,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:28:10,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1001056267] [2019-11-21 13:28:10,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:28:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:28:10,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 13:28:10,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:28:10,742 INFO L377 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 13:28:10,743 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:28:10,750 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:28:10,751 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:28:10,751 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 13:28:10,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:28:10,768 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:28:10,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:28:10,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1001056267] [2019-11-21 13:28:10,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 13:28:10,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-21 13:28:10,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443312658] [2019-11-21 13:28:10,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 13:28:10,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:28:10,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 13:28:10,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 13:28:10,813 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 4 states. [2019-11-21 13:28:11,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:28:11,021 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2019-11-21 13:28:11,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 13:28:11,023 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-21 13:28:11,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:28:11,025 INFO L225 Difference]: With dead ends: 62 [2019-11-21 13:28:11,026 INFO L226 Difference]: Without dead ends: 62 [2019-11-21 13:28:11,027 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 13:28:11,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-21 13:28:11,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-11-21 13:28:11,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-21 13:28:11,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2019-11-21 13:28:11,049 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 9 [2019-11-21 13:28:11,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:28:11,054 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2019-11-21 13:28:11,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 13:28:11,054 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2019-11-21 13:28:11,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-21 13:28:11,058 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:28:11,059 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:28:11,259 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:28:11,260 INFO L410 AbstractCegarLoop]: === Iteration 3 === [insert_listErr4REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION]=== [2019-11-21 13:28:11,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:28:11,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1488025840, now seen corresponding path program 1 times [2019-11-21 13:28:11,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:28:11,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [206698798] [2019-11-21 13:28:11,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:28:11,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:28:11,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-21 13:28:11,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:28:11,596 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 29 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-21 13:28:11,597 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:28:11,690 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 1 proven. 32 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-21 13:28:11,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [206698798] [2019-11-21 13:28:11,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 13:28:11,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-21 13:28:11,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973889651] [2019-11-21 13:28:11,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-21 13:28:11,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:28:11,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-21 13:28:11,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-21 13:28:11,693 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 7 states. [2019-11-21 13:28:12,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:28:12,196 INFO L93 Difference]: Finished difference Result 118 states and 131 transitions. [2019-11-21 13:28:12,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-21 13:28:12,197 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-11-21 13:28:12,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:28:12,200 INFO L225 Difference]: With dead ends: 118 [2019-11-21 13:28:12,200 INFO L226 Difference]: Without dead ends: 118 [2019-11-21 13:28:12,200 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-11-21 13:28:12,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-21 13:28:12,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 69. [2019-11-21 13:28:12,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-21 13:28:12,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2019-11-21 13:28:12,213 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 47 [2019-11-21 13:28:12,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:28:12,214 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2019-11-21 13:28:12,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-21 13:28:12,214 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2019-11-21 13:28:12,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-21 13:28:12,216 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:28:12,216 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 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] [2019-11-21 13:28:12,422 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:28:12,423 INFO L410 AbstractCegarLoop]: === Iteration 4 === [insert_listErr4REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION]=== [2019-11-21 13:28:12,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:28:12,424 INFO L82 PathProgramCache]: Analyzing trace with hash 493032989, now seen corresponding path program 1 times [2019-11-21 13:28:12,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:28:12,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1818529280] [2019-11-21 13:28:12,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:28:12,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:28:12,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-21 13:28:12,896 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:28:12,909 INFO L377 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 13:28:12,909 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:28:12,913 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:28:12,913 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:28:12,913 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 13:28:12,943 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-21 13:28:12,944 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:28:13,017 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-21 13:28:13,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1818529280] [2019-11-21 13:28:13,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 13:28:13,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-21 13:28:13,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978728518] [2019-11-21 13:28:13,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 13:28:13,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:28:13,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 13:28:13,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 13:28:13,021 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 5 states. [2019-11-21 13:28:13,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:28:13,406 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2019-11-21 13:28:13,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 13:28:13,407 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-11-21 13:28:13,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:28:13,411 INFO L225 Difference]: With dead ends: 83 [2019-11-21 13:28:13,411 INFO L226 Difference]: Without dead ends: 83 [2019-11-21 13:28:13,412 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-21 13:28:13,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-21 13:28:13,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 74. [2019-11-21 13:28:13,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-21 13:28:13,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2019-11-21 13:28:13,421 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 50 [2019-11-21 13:28:13,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:28:13,421 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2019-11-21 13:28:13,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 13:28:13,422 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2019-11-21 13:28:13,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-21 13:28:13,423 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:28:13,424 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 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] [2019-11-21 13:28:13,628 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:28:13,628 INFO L410 AbstractCegarLoop]: === Iteration 5 === [insert_listErr4REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION]=== [2019-11-21 13:28:13,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:28:13,628 INFO L82 PathProgramCache]: Analyzing trace with hash 493032990, now seen corresponding path program 1 times [2019-11-21 13:28:13,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:28:13,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [862226143] [2019-11-21 13:28:13,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:28:14,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:28:14,008 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-21 13:28:14,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:28:14,023 INFO L377 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 13:28:14,023 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:28:14,029 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:28:14,029 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:28:14,030 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 13:28:14,084 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-21 13:28:14,084 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:28:14,340 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-21 13:28:14,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [862226143] [2019-11-21 13:28:14,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 13:28:14,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-21 13:28:14,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360225945] [2019-11-21 13:28:14,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-21 13:28:14,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:28:14,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-21 13:28:14,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-21 13:28:14,344 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand 8 states. [2019-11-21 13:28:14,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:28:14,976 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2019-11-21 13:28:14,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-21 13:28:14,977 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2019-11-21 13:28:14,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:28:14,979 INFO L225 Difference]: With dead ends: 94 [2019-11-21 13:28:14,979 INFO L226 Difference]: Without dead ends: 94 [2019-11-21 13:28:14,980 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-11-21 13:28:14,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-21 13:28:14,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 79. [2019-11-21 13:28:14,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-21 13:28:14,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2019-11-21 13:28:14,988 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 50 [2019-11-21 13:28:14,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:28:14,988 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2019-11-21 13:28:14,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-21 13:28:14,989 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2019-11-21 13:28:14,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-21 13:28:14,990 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:28:14,990 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 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] [2019-11-21 13:28:15,194 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:28:15,195 INFO L410 AbstractCegarLoop]: === Iteration 6 === [insert_listErr4REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION]=== [2019-11-21 13:28:15,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:28:15,195 INFO L82 PathProgramCache]: Analyzing trace with hash -782626401, now seen corresponding path program 1 times [2019-11-21 13:28:15,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:28:15,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1584349884] [2019-11-21 13:28:15,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:28:15,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:28:15,457 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-21 13:28:15,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:28:15,516 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-21 13:28:15,516 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:28:15,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:28:15,697 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-21 13:28:15,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1584349884] [2019-11-21 13:28:15,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 13:28:15,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 7] imperfect sequences [] total 9 [2019-11-21 13:28:15,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019243878] [2019-11-21 13:28:15,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-21 13:28:15,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:28:15,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-21 13:28:15,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-21 13:28:15,699 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand 9 states. [2019-11-21 13:28:16,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:28:16,108 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2019-11-21 13:28:16,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-21 13:28:16,109 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-11-21 13:28:16,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:28:16,111 INFO L225 Difference]: With dead ends: 89 [2019-11-21 13:28:16,111 INFO L226 Difference]: Without dead ends: 89 [2019-11-21 13:28:16,111 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-21 13:28:16,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-21 13:28:16,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 79. [2019-11-21 13:28:16,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-21 13:28:16,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2019-11-21 13:28:16,119 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 55 [2019-11-21 13:28:16,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:28:16,119 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2019-11-21 13:28:16,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-21 13:28:16,119 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2019-11-21 13:28:16,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-21 13:28:16,120 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:28:16,121 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 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, 1] [2019-11-21 13:28:16,323 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:28:16,324 INFO L410 AbstractCegarLoop]: === Iteration 7 === [insert_listErr4REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION]=== [2019-11-21 13:28:16,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:28:16,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1546121596, now seen corresponding path program 1 times [2019-11-21 13:28:16,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:28:16,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1139329576] [2019-11-21 13:28:16,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:28:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:28:16,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-21 13:28:16,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:28:16,746 INFO L377 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 13:28:16,746 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:28:16,749 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:28:16,749 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:28:16,749 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 13:28:16,805 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-21 13:28:16,806 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:28:16,946 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-21 13:28:16,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1139329576] [2019-11-21 13:28:16,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 13:28:16,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2019-11-21 13:28:16,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636336037] [2019-11-21 13:28:16,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 13:28:16,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:28:16,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 13:28:16,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-21 13:28:16,951 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand 10 states. [2019-11-21 13:28:17,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:28:17,717 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2019-11-21 13:28:17,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-21 13:28:17,718 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2019-11-21 13:28:17,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:28:17,720 INFO L225 Difference]: With dead ends: 96 [2019-11-21 13:28:17,720 INFO L226 Difference]: Without dead ends: 96 [2019-11-21 13:28:17,721 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 103 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-11-21 13:28:17,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-21 13:28:17,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 84. [2019-11-21 13:28:17,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-21 13:28:17,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2019-11-21 13:28:17,744 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 57 [2019-11-21 13:28:17,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:28:17,745 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2019-11-21 13:28:17,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 13:28:17,745 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2019-11-21 13:28:17,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-21 13:28:17,746 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:28:17,746 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 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, 1] [2019-11-21 13:28:17,950 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:28:17,951 INFO L410 AbstractCegarLoop]: === Iteration 8 === [insert_listErr4REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION]=== [2019-11-21 13:28:17,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:28:17,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1546121597, now seen corresponding path program 1 times [2019-11-21 13:28:17,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:28:17,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [724420404] [2019-11-21 13:28:17,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:28:18,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:28:18,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-21 13:28:18,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:28:18,347 INFO L377 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 13:28:18,347 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:28:18,353 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:28:18,354 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:28:18,354 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 13:28:18,472 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-21 13:28:18,473 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:28:19,066 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-21 13:28:19,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [724420404] [2019-11-21 13:28:19,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 13:28:19,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 13 [2019-11-21 13:28:19,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877804904] [2019-11-21 13:28:19,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-21 13:28:19,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:28:19,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-21 13:28:19,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-11-21 13:28:19,068 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand 14 states. [2019-11-21 13:28:20,171 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 27 [2019-11-21 13:28:20,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:28:20,578 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2019-11-21 13:28:20,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-21 13:28:20,579 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2019-11-21 13:28:20,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:28:20,580 INFO L225 Difference]: With dead ends: 119 [2019-11-21 13:28:20,580 INFO L226 Difference]: Without dead ends: 119 [2019-11-21 13:28:20,581 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2019-11-21 13:28:20,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-11-21 13:28:20,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 84. [2019-11-21 13:28:20,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-21 13:28:20,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2019-11-21 13:28:20,587 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 57 [2019-11-21 13:28:20,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:28:20,587 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2019-11-21 13:28:20,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-21 13:28:20,587 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2019-11-21 13:28:20,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-21 13:28:20,589 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:28:20,589 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 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] [2019-11-21 13:28:20,793 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:28:20,794 INFO L410 AbstractCegarLoop]: === Iteration 9 === [insert_listErr4REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION]=== [2019-11-21 13:28:20,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:28:20,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1596651362, now seen corresponding path program 1 times [2019-11-21 13:28:20,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:28:20,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [973630702] [2019-11-21 13:28:20,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:28:21,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:28:21,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-21 13:28:21,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:28:21,253 INFO L377 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 13:28:21,253 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:28:21,256 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:28:21,256 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:28:21,256 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 13:28:21,314 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 13 treesize of output 9 [2019-11-21 13:28:21,314 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:28:21,326 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:28:21,326 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:28:21,326 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-21 13:28:21,397 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:28:21,397 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 18 treesize of output 46 [2019-11-21 13:28:21,399 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:28:21,423 INFO L567 ElimStorePlain]: treesize reduction 26, result has 40.9 percent of original size [2019-11-21 13:28:21,424 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:28:21,424 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:18 [2019-11-21 13:28:21,482 INFO L377 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 19 treesize of output 11 [2019-11-21 13:28:21,482 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:28:21,487 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:28:21,488 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 13:28:21,488 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:11 [2019-11-21 13:28:21,536 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-21 13:28:21,537 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:28:21,950 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-21 13:28:21,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [973630702] [2019-11-21 13:28:21,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 13:28:21,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 16 [2019-11-21 13:28:21,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7138654] [2019-11-21 13:28:21,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-21 13:28:21,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:28:21,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-21 13:28:21,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-11-21 13:28:21,953 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand 17 states. [2019-11-21 13:28:23,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:28:23,547 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2019-11-21 13:28:23,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-21 13:28:23,548 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 57 [2019-11-21 13:28:23,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:28:23,551 INFO L225 Difference]: With dead ends: 114 [2019-11-21 13:28:23,551 INFO L226 Difference]: Without dead ends: 114 [2019-11-21 13:28:23,552 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 96 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=182, Invalid=688, Unknown=0, NotChecked=0, Total=870 [2019-11-21 13:28:23,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-21 13:28:23,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 91. [2019-11-21 13:28:23,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-21 13:28:23,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2019-11-21 13:28:23,558 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 57 [2019-11-21 13:28:23,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:28:23,559 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2019-11-21 13:28:23,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-21 13:28:23,559 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2019-11-21 13:28:23,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-21 13:28:23,560 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:28:23,561 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 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] [2019-11-21 13:28:23,764 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:28:23,765 INFO L410 AbstractCegarLoop]: === Iteration 10 === [insert_listErr4REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION]=== [2019-11-21 13:28:23,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:28:23,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1596651363, now seen corresponding path program 1 times [2019-11-21 13:28:23,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:28:23,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1758410590] [2019-11-21 13:28:23,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:28:24,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:28:24,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-21 13:28:24,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:28:24,360 INFO L377 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 13:28:24,361 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:28:24,370 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:28:24,374 INFO L377 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 13:28:24,375 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 13:28:24,382 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:28:24,383 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:28:24,383 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-21 13:28:24,483 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 13 treesize of output 9 [2019-11-21 13:28:24,484 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:28:24,502 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:28:24,508 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 13 treesize of output 9 [2019-11-21 13:28:24,509 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 13:28:24,524 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:28:24,525 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:28:24,525 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2019-11-21 13:28:24,603 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:28:24,603 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2019-11-21 13:28:24,604 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:28:24,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:28:24,627 INFO L377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-11-21 13:28:24,628 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 13:28:24,641 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:28:24,641 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:28:24,642 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:33 [2019-11-21 13:28:24,740 INFO L377 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 27 treesize of output 15 [2019-11-21 13:28:24,742 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:28:24,760 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:28:24,767 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-21 13:28:24,768 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 13:28:24,777 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:28:24,778 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 13:28:24,778 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:20 [2019-11-21 13:28:24,874 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-21 13:28:24,874 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:28:25,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 13:28:32,381 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-21 13:28:32,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 13:28:32,692 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 24 [2019-11-21 13:28:33,196 WARN L192 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-11-21 13:28:44,943 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-21 13:28:44,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1758410590] [2019-11-21 13:28:44,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 13:28:44,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2019-11-21 13:28:44,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334779796] [2019-11-21 13:28:44,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-21 13:28:44,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:28:44,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-21 13:28:44,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=393, Unknown=3, NotChecked=0, Total=462 [2019-11-21 13:28:44,946 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand 22 states. [2019-11-21 13:28:47,928 WARN L192 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2019-11-21 13:28:49,029 WARN L192 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-11-21 13:28:49,341 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-11-21 13:28:50,473 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-11-21 13:28:51,427 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-11-21 13:28:56,038 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-11-21 13:28:58,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:28:58,007 INFO L93 Difference]: Finished difference Result 120 states and 131 transitions. [2019-11-21 13:28:58,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-21 13:28:58,008 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 57 [2019-11-21 13:28:58,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:28:58,009 INFO L225 Difference]: With dead ends: 120 [2019-11-21 13:28:58,009 INFO L226 Difference]: Without dead ends: 120 [2019-11-21 13:28:58,010 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 92 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 22.6s TimeCoverageRelationStatistics Valid=288, Invalid=1191, Unknown=3, NotChecked=0, Total=1482 [2019-11-21 13:28:58,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-21 13:28:58,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 94. [2019-11-21 13:28:58,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-21 13:28:58,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2019-11-21 13:28:58,016 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 57 [2019-11-21 13:28:58,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:28:58,016 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2019-11-21 13:28:58,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-21 13:28:58,016 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2019-11-21 13:28:58,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-21 13:28:58,018 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:28:58,018 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1] [2019-11-21 13:28:58,229 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:28:58,230 INFO L410 AbstractCegarLoop]: === Iteration 11 === [insert_listErr4REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION]=== [2019-11-21 13:28:58,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:28:58,230 INFO L82 PathProgramCache]: Analyzing trace with hash -65719430, now seen corresponding path program 1 times [2019-11-21 13:28:58,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:28:58,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1265094505] [2019-11-21 13:28:58,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:28:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:28:58,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-21 13:28:58,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:28:58,627 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 13 treesize of output 9 [2019-11-21 13:28:58,627 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:28:58,634 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:28:58,634 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:28:58,634 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-21 13:28:58,806 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-21 13:28:58,807 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:28:58,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:28:59,325 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-21 13:28:59,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1265094505] [2019-11-21 13:28:59,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 13:28:59,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2019-11-21 13:28:59,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813810478] [2019-11-21 13:28:59,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-21 13:28:59,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:28:59,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-21 13:28:59,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-11-21 13:28:59,328 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand 22 states. [2019-11-21 13:29:01,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:29:01,248 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2019-11-21 13:29:01,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-21 13:29:01,248 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 62 [2019-11-21 13:29:01,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:29:01,250 INFO L225 Difference]: With dead ends: 114 [2019-11-21 13:29:01,251 INFO L226 Difference]: Without dead ends: 114 [2019-11-21 13:29:01,252 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=307, Invalid=1415, Unknown=0, NotChecked=0, Total=1722 [2019-11-21 13:29:01,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-21 13:29:01,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 93. [2019-11-21 13:29:01,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-21 13:29:01,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2019-11-21 13:29:01,257 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 62 [2019-11-21 13:29:01,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:29:01,257 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2019-11-21 13:29:01,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-21 13:29:01,257 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2019-11-21 13:29:01,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-21 13:29:01,258 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:29:01,259 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:29:01,462 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:29:01,463 INFO L410 AbstractCegarLoop]: === Iteration 12 === [insert_listErr4REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION]=== [2019-11-21 13:29:01,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:29:01,463 INFO L82 PathProgramCache]: Analyzing trace with hash -945484163, now seen corresponding path program 2 times [2019-11-21 13:29:01,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:29:01,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2079149987] [2019-11-21 13:29:01,465 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:29:02,029 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-21 13:29:02,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-21 13:29:02,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 44 conjunts are in the unsatisfiable core [2019-11-21 13:29:02,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:29:02,057 INFO L377 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 13:29:02,057 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:29:02,059 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:29:02,060 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:29:02,060 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 13:29:02,103 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 13 treesize of output 9 [2019-11-21 13:29:02,103 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:29:02,114 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:29:02,115 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:29:02,115 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-11-21 13:29:02,186 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:29:02,187 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 61 [2019-11-21 13:29:02,188 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:29:02,217 INFO L567 ElimStorePlain]: treesize reduction 26, result has 50.0 percent of original size [2019-11-21 13:29:02,217 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:29:02,218 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:26 [2019-11-21 13:29:02,416 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 13:29:02,485 INFO L567 ElimStorePlain]: treesize reduction 5, result has 90.9 percent of original size [2019-11-21 13:29:02,486 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 13:29:02,486 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:60, output treesize:50 [2019-11-21 13:29:02,548 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_244|], 2=[|v_#memory_$Pointer$.base_255|]} [2019-11-21 13:29:02,559 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 13 treesize of output 9 [2019-11-21 13:29:02,560 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:29:02,609 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:29:02,612 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 13:29:02,648 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:29:02,649 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 13:29:02,649 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:54 [2019-11-21 13:29:04,709 WARN L192 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 35 [2019-11-21 13:29:06,573 WARN L192 SmtUtils]: Spent 1.81 s on a formula simplification that was a NOOP. DAG size: 33 [2019-11-21 13:29:06,637 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:29:06,638 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 93 [2019-11-21 13:29:06,639 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:29:06,788 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-11-21 13:29:06,789 INFO L567 ElimStorePlain]: treesize reduction 40, result has 64.9 percent of original size [2019-11-21 13:29:06,798 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2019-11-21 13:29:06,814 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 25 [2019-11-21 13:29:06,815 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 13:29:06,840 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:29:06,840 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:29:06,909 INFO L567 ElimStorePlain]: treesize reduction 4, result has 94.4 percent of original size [2019-11-21 13:29:06,910 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:29:06,910 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:72, output treesize:81 [2019-11-21 13:29:07,058 INFO L377 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 7 [2019-11-21 13:29:07,059 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:29:07,088 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:29:07,089 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 13:29:07,089 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:92, output treesize:81 [2019-11-21 13:29:07,240 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:29:07,241 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 40 [2019-11-21 13:29:07,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:29:07,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:29:07,243 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 13:29:07,294 INFO L567 ElimStorePlain]: treesize reduction 4, result has 88.2 percent of original size [2019-11-21 13:29:07,295 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-21 13:29:07,295 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:82, output treesize:30 [2019-11-21 13:29:07,444 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 41 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-21 13:29:07,444 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:29:08,231 WARN L192 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-11-21 13:29:08,465 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-21 13:29:08,863 WARN L192 SmtUtils]: Spent 397.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-21 13:29:09,162 WARN L192 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-21 13:29:09,170 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_265|], 3=[|v_#memory_$Pointer$.base_266|]} [2019-11-21 13:29:09,174 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 13:29:09,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:29:09,208 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 13:29:09,227 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:29:09,229 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-21 13:29:09,229 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:54 [2019-11-21 13:29:31,333 WARN L192 SmtUtils]: Spent 3.88 s on a formula simplification that was a NOOP. DAG size: 49 [2019-11-21 13:29:49,148 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 13:29:51,267 WARN L192 SmtUtils]: Spent 2.12 s on a formula simplification that was a NOOP. DAG size: 57 [2019-11-21 13:29:51,267 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:29:51,468 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:29:51,469 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: alternation not yet supported: (forall ((v_DerPreprocessor_5 (_ BitVec 32))) (exists ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (v_insert_list_~l.base_141 (_ BitVec 32))) (let ((.cse2 (store (select |#memory_$Pointer$.base| insert_list_~l.base) (bvadd insert_list_~l.offset (_ bv2 32)) v_DerPreprocessor_5))) (or (let ((.cse0 (select |old(#memory_$Pointer$.base)| v_insert_list_~l.base_141))) (let ((.cse1 (store .cse0 (_ bv2 32) v_DerPreprocessor_4))) (and (= v_DerPreprocessor_3 (select (store .cse0 (_ bv2 32) v_DerPreprocessor_3) (_ bv0 32))) (= v_DerPreprocessor_4 (select .cse1 (_ bv0 32))) (= (select |old(#valid)| v_insert_list_~l.base_141) (_ bv0 1)) (not (= (_ bv1 1) (select (store |old(#valid)| v_insert_list_~l.base_141 (_ bv1 1)) (select (select (store |old(#memory_$Pointer$.base)| v_insert_list_~l.base_141 (store .cse1 (_ bv4 32) |old(~head~0.base)|)) |old(~head~0.base)|) (bvadd |old(~head~0.offset)| (_ bv4 32))))))))) (not (= (_ bv1 1) (select |#valid| insert_list_~l.base))) (not (= v_DerPreprocessor_5 (select .cse2 insert_list_~l.offset))) (= (_ bv1 1) (select |#valid| (select (select (store |#memory_$Pointer$.base| insert_list_~l.base (store .cse2 (bvadd insert_list_~l.offset (_ bv4 32)) ~head~0.base)) ~head~0.base) (bvadd ~head~0.offset (_ bv4 32))))))))) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:667) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:493) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-21 13:29:51,476 INFO L168 Benchmark]: Toolchain (without parser) took 103527.37 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 359.1 MB). Free memory was 949.6 MB in the beginning and 1.3 GB in the end (delta: -324.2 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. [2019-11-21 13:29:51,477 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-21 13:29:51,477 INFO L168 Benchmark]: CACSL2BoogieTranslator took 683.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -167.0 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-21 13:29:51,477 INFO L168 Benchmark]: Boogie Preprocessor took 86.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-21 13:29:51,478 INFO L168 Benchmark]: RCFGBuilder took 830.29 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: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 11.5 GB. [2019-11-21 13:29:51,478 INFO L168 Benchmark]: TraceAbstraction took 101921.83 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 210.8 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -214.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-21 13:29:51,480 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 683.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -167.0 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 86.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 830.29 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: 50.8 MB). Peak memory consumption was 50.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 101921.83 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 210.8 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -214.6 MB). There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported: (forall ((v_DerPreprocessor_5 (_ BitVec 32))) (exists ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (v_insert_list_~l.base_141 (_ BitVec 32))) (let ((.cse2 (store (select |#memory_$Pointer$.base| insert_list_~l.base) (bvadd insert_list_~l.offset (_ bv2 32)) v_DerPreprocessor_5))) (or (let ((.cse0 (select |old(#memory_$Pointer$.base)| v_insert_list_~l.base_141))) (let ((.cse1 (store .cse0 (_ bv2 32) v_DerPreprocessor_4))) (and (= v_DerPreprocessor_3 (select (store .cse0 (_ bv2 32) v_DerPreprocessor_3) (_ bv0 32))) (= v_DerPreprocessor_4 (select .cse1 (_ bv0 32))) (= (select |old(#valid)| v_insert_list_~l.base_141) (_ bv0 1)) (not (= (_ bv1 1) (select (store |old(#valid)| v_insert_list_~l.base_141 (_ bv1 1)) (select (select (store |old(#memory_$Pointer$.base)| v_insert_list_~l.base_141 (store .cse1 (_ bv4 32) |old(~head~0.base)|)) |old(~head~0.base)|) (bvadd |old(~head~0.offset)| (_ bv4 32))))))))) (not (= (_ bv1 1) (select |#valid| insert_list_~l.base))) (not (= v_DerPreprocessor_5 (select .cse2 insert_list_~l.offset))) (= (_ bv1 1) (select |#valid| (select (select (store |#memory_$Pointer$.base| insert_list_~l.base (store .cse2 (bvadd insert_list_~l.offset (_ bv4 32)) ~head~0.base)) ~head~0.base) (bvadd ~head~0.offset (_ bv4 32))))))))) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: alternation not yet supported: (forall ((v_DerPreprocessor_5 (_ BitVec 32))) (exists ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (v_insert_list_~l.base_141 (_ BitVec 32))) (let ((.cse2 (store (select |#memory_$Pointer$.base| insert_list_~l.base) (bvadd insert_list_~l.offset (_ bv2 32)) v_DerPreprocessor_5))) (or (let ((.cse0 (select |old(#memory_$Pointer$.base)| v_insert_list_~l.base_141))) (let ((.cse1 (store .cse0 (_ bv2 32) v_DerPreprocessor_4))) (and (= v_DerPreprocessor_3 (select (store .cse0 (_ bv2 32) v_DerPreprocessor_3) (_ bv0 32))) (= v_DerPreprocessor_4 (select .cse1 (_ bv0 32))) (= (select |old(#valid)| v_insert_list_~l.base_141) (_ bv0 1)) (not (= (_ bv1 1) (select (store |old(#valid)| v_insert_list_~l.base_141 (_ bv1 1)) (select (select (store |old(#memory_$Pointer$.base)| v_insert_list_~l.base_141 (store .cse1 (_ bv4 32) |old(~head~0.base)|)) |old(~head~0.base)|) (bvadd |old(~head~0.offset)| (_ bv4 32))))))))) (not (= (_ bv1 1) (select |#valid| insert_list_~l.base))) (not (= v_DerPreprocessor_5 (select .cse2 insert_list_~l.offset))) (= (_ bv1 1) (select |#valid| (select (select (store |#memory_$Pointer$.base| insert_list_~l.base (store .cse2 (bvadd insert_list_~l.offset (_ bv4 32)) ~head~0.base)) ~head~0.base) (bvadd ~head~0.offset (_ bv4 32))))))))): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:667) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...