./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/test-0019_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6b5699aa Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_94fa858a-6961-478b-9f6b-aa4cec1604cd/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_94fa858a-6961-478b-9f6b-aa4cec1604cd/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_94fa858a-6961-478b-9f6b-aa4cec1604cd/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_94fa858a-6961-478b-9f6b-aa4cec1604cd/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0019_1-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_94fa858a-6961-478b-9f6b-aa4cec1604cd/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_94fa858a-6961-478b-9f6b-aa4cec1604cd/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 69e4d0785323ca2fbac076cafe34fff682fc43d2 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: incompatible size --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-6b5699a [2019-11-26 02:41:00,684 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:41:00,686 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:41:00,696 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:41:00,696 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:41:00,697 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:41:00,699 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:41:00,701 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:41:00,702 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:41:00,703 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:41:00,704 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:41:00,705 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:41:00,706 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:41:00,707 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:41:00,708 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:41:00,709 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:41:00,709 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:41:00,710 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:41:00,712 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:41:00,714 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:41:00,716 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:41:00,717 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:41:00,718 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:41:00,718 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:41:00,721 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:41:00,721 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:41:00,722 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:41:00,723 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:41:00,723 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:41:00,724 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:41:00,724 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:41:00,725 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:41:00,726 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:41:00,726 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:41:00,728 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:41:00,728 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:41:00,728 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:41:00,729 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:41:00,729 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:41:00,730 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:41:00,730 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:41:00,731 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_94fa858a-6961-478b-9f6b-aa4cec1604cd/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-11-26 02:41:00,744 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:41:00,744 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:41:00,745 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:41:00,745 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:41:00,746 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:41:00,746 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:41:00,746 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:41:00,746 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:41:00,746 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:41:00,747 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-26 02:41:00,747 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-26 02:41:00,747 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:41:00,748 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:41:00,748 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-26 02:41:00,748 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:41:00,748 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:41:00,749 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:41:00,749 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-26 02:41:00,749 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-26 02:41:00,749 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-26 02:41:00,749 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:41:00,750 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-26 02:41:00,750 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-26 02:41:00,750 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-26 02:41:00,750 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:41:00,750 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-26 02:41:00,751 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:41:00,751 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-26 02:41:00,751 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:41:00,751 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:41:00,751 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:41:00,752 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:41:00,752 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:41:00,752 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-11-26 02:41:00,752 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-26 02:41:00,753 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:41:00,753 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_94fa858a-6961-478b-9f6b-aa4cec1604cd/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 69e4d0785323ca2fbac076cafe34fff682fc43d2 [2019-11-26 02:41:00,887 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:41:00,897 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:41:00,900 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:41:00,901 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:41:00,902 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:41:00,902 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_94fa858a-6961-478b-9f6b-aa4cec1604cd/bin/utaipan/../../sv-benchmarks/c/list-ext-properties/test-0019_1-2.i [2019-11-26 02:41:00,968 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_94fa858a-6961-478b-9f6b-aa4cec1604cd/bin/utaipan/data/3120fea1d/59bbf3dfb09d44e8a4b802e958c5f06f/FLAGa3ac46955 [2019-11-26 02:41:01,340 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:41:01,340 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_94fa858a-6961-478b-9f6b-aa4cec1604cd/sv-benchmarks/c/list-ext-properties/test-0019_1-2.i [2019-11-26 02:41:01,355 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_94fa858a-6961-478b-9f6b-aa4cec1604cd/bin/utaipan/data/3120fea1d/59bbf3dfb09d44e8a4b802e958c5f06f/FLAGa3ac46955 [2019-11-26 02:41:01,673 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_94fa858a-6961-478b-9f6b-aa4cec1604cd/bin/utaipan/data/3120fea1d/59bbf3dfb09d44e8a4b802e958c5f06f [2019-11-26 02:41:01,676 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:41:01,677 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:41:01,678 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:41:01,678 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:41:01,681 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:41:01,682 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:41:01" (1/1) ... [2019-11-26 02:41:01,685 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28432299 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:41:01, skipping insertion in model container [2019-11-26 02:41:01,685 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:41:01" (1/1) ... [2019-11-26 02:41:01,692 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:41:01,742 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:41:02,114 INFO L965 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-26 02:41:02,115 INFO L968 CHandler]: at location: C: (int *)malloc(sizeof(int)) [518] [2019-11-26 02:41:02,115 INFO L969 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-26 02:41:02,117 INFO L965 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-26 02:41:02,117 INFO L968 CHandler]: at location: C: (int *)malloc(sizeof(int)) [519] [2019-11-26 02:41:02,117 INFO L969 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-26 02:41:02,128 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:41:02,140 INFO L198 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-26 02:41:02,150 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:41:02,182 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:41:02,193 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:41:02,235 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:41:02,294 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:41:02,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:41:02 WrapperNode [2019-11-26 02:41:02,294 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:41:02,295 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:41:02,295 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:41:02,295 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:41:02,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:41:02" (1/1) ... [2019-11-26 02:41:02,331 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:41:02" (1/1) ... [2019-11-26 02:41:02,354 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:41:02,354 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:41:02,354 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:41:02,354 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:41:02,363 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:41:02" (1/1) ... [2019-11-26 02:41:02,363 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:41:02" (1/1) ... [2019-11-26 02:41:02,367 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:41:02" (1/1) ... [2019-11-26 02:41:02,368 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:41:02" (1/1) ... [2019-11-26 02:41:02,380 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:41:02" (1/1) ... [2019-11-26 02:41:02,382 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:41:02" (1/1) ... [2019-11-26 02:41:02,393 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:41:02" (1/1) ... [2019-11-26 02:41:02,396 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:41:02,397 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:41:02,397 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:41:02,397 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:41:02,398 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:41:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_94fa858a-6961-478b-9f6b-aa4cec1604cd/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:41:02,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-26 02:41:02,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-26 02:41:02,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-26 02:41:02,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-26 02:41:02,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-26 02:41:02,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-26 02:41:02,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-26 02:41:02,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:41:02,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:41:03,156 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:41:03,156 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-26 02:41:03,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:41:03 BoogieIcfgContainer [2019-11-26 02:41:03,157 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:41:03,158 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:41:03,158 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:41:03,161 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:41:03,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:41:01" (1/3) ... [2019-11-26 02:41:03,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35897d3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:41:03, skipping insertion in model container [2019-11-26 02:41:03,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:41:02" (2/3) ... [2019-11-26 02:41:03,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35897d3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:41:03, skipping insertion in model container [2019-11-26 02:41:03,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:41:03" (3/3) ... [2019-11-26 02:41:03,166 INFO L109 eAbstractionObserver]: Analyzing ICFG test-0019_1-2.i [2019-11-26 02:41:03,175 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:41:03,184 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 35 error locations. [2019-11-26 02:41:03,193 INFO L249 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2019-11-26 02:41:03,213 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:41:03,213 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-26 02:41:03,213 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:41:03,213 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:41:03,213 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:41:03,213 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:41:03,213 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:41:03,213 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:41:03,228 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2019-11-26 02:41:03,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-26 02:41:03,238 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:41:03,239 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-26 02:41:03,239 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-11-26 02:41:03,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:41:03,244 INFO L82 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2019-11-26 02:41:03,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:41:03,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1926416919] [2019-11-26 02:41:03,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_94fa858a-6961-478b-9f6b-aa4cec1604cd/bin/utaipan/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-26 02:41:03,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:41:03,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-26 02:41:03,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:41:03,468 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-26 02:41:03,469 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 19 treesize of output 18 [2019-11-26 02:41:03,469 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:41:03,524 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:41:03,526 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:41:03,527 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-11-26 02:41:03,542 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-26 02:41:03,542 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:41:03,567 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-26 02:41:03,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1926416919] [2019-11-26 02:41:03,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:41:03,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-26 02:41:03,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866762443] [2019-11-26 02:41:03,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:41:03,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:41:03,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:41:03,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:41:03,586 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 4 states. [2019-11-26 02:41:03,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:41:03,803 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-11-26 02:41:03,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:41:03,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-11-26 02:41:03,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:41:03,814 INFO L225 Difference]: With dead ends: 64 [2019-11-26 02:41:03,814 INFO L226 Difference]: Without dead ends: 62 [2019-11-26 02:41:03,816 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:41:03,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-26 02:41:03,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-11-26 02:41:03,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-26 02:41:03,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-11-26 02:41:03,851 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 3 [2019-11-26 02:41:03,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:41:03,851 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-11-26 02:41:03,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:41:03,852 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-11-26 02:41:03,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-26 02:41:03,853 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:41:03,854 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-26 02:41:04,056 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:41:04,056 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-11-26 02:41:04,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:41:04,056 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2019-11-26 02:41:04,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:41:04,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [271335912] [2019-11-26 02:41:04,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_94fa858a-6961-478b-9f6b-aa4cec1604cd/bin/utaipan/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-26 02:41:04,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:41:04,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-26 02:41:04,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:41:04,172 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_37|], 1=[|v_#valid_53|]} [2019-11-26 02:41:04,179 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:41:04,181 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-26 02:41:04,182 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:41:04,195 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:41:04,198 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:41:04,202 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-26 02:41:04,202 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:41:04,212 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:41:04,213 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:41:04,214 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:14 [2019-11-26 02:41:04,229 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-26 02:41:04,229 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:41:04,271 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-26 02:41:04,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [271335912] [2019-11-26 02:41:04,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:41:04,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-26 02:41:04,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904103021] [2019-11-26 02:41:04,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:41:04,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:41:04,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:41:04,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:41:04,274 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 4 states. [2019-11-26 02:41:04,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:41:04,538 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-11-26 02:41:04,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:41:04,539 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-11-26 02:41:04,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:41:04,540 INFO L225 Difference]: With dead ends: 60 [2019-11-26 02:41:04,540 INFO L226 Difference]: Without dead ends: 60 [2019-11-26 02:41:04,541 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:41:04,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-26 02:41:04,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-11-26 02:41:04,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-26 02:41:04,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-11-26 02:41:04,547 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 3 [2019-11-26 02:41:04,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:41:04,548 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-11-26 02:41:04,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:41:04,548 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-11-26 02:41:04,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-26 02:41:04,548 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:41:04,549 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-26 02:41:04,749 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:41:04,750 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-11-26 02:41:04,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:41:04,750 INFO L82 PathProgramCache]: Analyzing trace with hash 28691811, now seen corresponding path program 1 times [2019-11-26 02:41:04,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:41:04,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1256916156] [2019-11-26 02:41:04,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_94fa858a-6961-478b-9f6b-aa4cec1604cd/bin/utaipan/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-26 02:41:04,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:41:04,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-26 02:41:04,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:41:04,880 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_39|], 1=[|v_#valid_55|]} [2019-11-26 02:41:04,887 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:41:04,888 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-26 02:41:04,888 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:41:04,898 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:41:04,906 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:41:04,909 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-26 02:41:04,910 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:41:04,925 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:41:04,926 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:41:04,926 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:14 [2019-11-26 02:41:04,976 INFO L392 ElimStorePlain]: Different costs {1=[|v_#valid_56|], 3=[|v_#length_40|]} [2019-11-26 02:41:04,994 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:41:04,995 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 13 treesize of output 17 [2019-11-26 02:41:04,996 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:41:05,018 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:41:05,056 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:41:05,057 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 44 [2019-11-26 02:41:05,058 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:41:05,104 INFO L567 ElimStorePlain]: treesize reduction 28, result has 40.4 percent of original size [2019-11-26 02:41:05,105 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-26 02:41:05,106 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:19 [2019-11-26 02:41:05,114 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-26 02:41:05,114 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:41:05,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:41:05,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:41:05,309 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:41:05,310 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 23 treesize of output 27 [2019-11-26 02:41:05,311 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:41:05,334 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:41:05,335 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 18 treesize of output 22 [2019-11-26 02:41:05,336 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:41:05,364 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:41:05,365 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 20 treesize of output 24 [2019-11-26 02:41:05,366 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 02:41:05,413 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:41:05,414 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-11-26 02:41:05,415 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:62, output treesize:27 [2019-11-26 02:41:05,478 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-26 02:41:05,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1256916156] [2019-11-26 02:41:05,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:41:05,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-26 02:41:05,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656147749] [2019-11-26 02:41:05,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:41:05,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:41:05,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:41:05,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:41:05,480 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 6 states. [2019-11-26 02:41:05,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:41:05,993 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-11-26 02:41:05,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:41:05,994 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-11-26 02:41:05,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:41:05,996 INFO L225 Difference]: With dead ends: 58 [2019-11-26 02:41:05,996 INFO L226 Difference]: Without dead ends: 58 [2019-11-26 02:41:05,997 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:41:05,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-26 02:41:06,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-11-26 02:41:06,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-26 02:41:06,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-11-26 02:41:06,003 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 5 [2019-11-26 02:41:06,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:41:06,003 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-11-26 02:41:06,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:41:06,004 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-11-26 02:41:06,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-26 02:41:06,004 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:41:06,004 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:41:06,206 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:41:06,207 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-11-26 02:41:06,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:41:06,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1803024997, now seen corresponding path program 1 times [2019-11-26 02:41:06,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:41:06,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [634483459] [2019-11-26 02:41:06,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_94fa858a-6961-478b-9f6b-aa4cec1604cd/bin/utaipan/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-26 02:41:06,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:41:06,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-26 02:41:06,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:41:06,336 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-26 02:41:06,336 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-26 02:41:06,336 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:41:06,345 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:41:06,346 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:41:06,346 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:14 [2019-11-26 02:41:06,370 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 11 treesize of output 7 [2019-11-26 02:41:06,370 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:41:06,389 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:41:06,390 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:41:06,390 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2019-11-26 02:41:06,521 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2019-11-26 02:41:06,522 INFO L343 Elim1Store]: treesize reduction 12, result has 86.2 percent of original size [2019-11-26 02:41:06,522 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 91 [2019-11-26 02:41:06,524 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:41:06,596 INFO L567 ElimStorePlain]: treesize reduction 40, result has 46.7 percent of original size [2019-11-26 02:41:06,597 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:41:06,597 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:35 [2019-11-26 02:41:06,641 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:41:06,642 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-11-26 02:41:06,643 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:41:06,671 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:41:06,671 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:41:06,672 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:52, output treesize:55 [2019-11-26 02:41:06,757 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 48 treesize of output 24 [2019-11-26 02:41:06,758 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-26 02:41:06,775 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:41:06,776 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-26 02:41:06,776 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:28 [2019-11-26 02:41:06,803 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-26 02:41:06,804 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:41:06,913 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-26 02:41:06,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [634483459] [2019-11-26 02:41:06,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:41:06,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 10 [2019-11-26 02:41:06,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5830400] [2019-11-26 02:41:06,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-26 02:41:06,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:41:06,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-26 02:41:06,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-26 02:41:06,915 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 11 states. [2019-11-26 02:41:07,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:41:07,493 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-11-26 02:41:07,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 02:41:07,493 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-11-26 02:41:07,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:41:07,494 INFO L225 Difference]: With dead ends: 57 [2019-11-26 02:41:07,494 INFO L226 Difference]: Without dead ends: 57 [2019-11-26 02:41:07,494 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2019-11-26 02:41:07,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-26 02:41:07,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-11-26 02:41:07,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-26 02:41:07,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-11-26 02:41:07,500 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 7 [2019-11-26 02:41:07,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:41:07,500 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-11-26 02:41:07,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-26 02:41:07,500 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-11-26 02:41:07,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-26 02:41:07,501 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:41:07,501 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:41:07,702 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:41:07,703 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-11-26 02:41:07,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:41:07,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1803024998, now seen corresponding path program 1 times [2019-11-26 02:41:07,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:41:07,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1261561810] [2019-11-26 02:41:07,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_94fa858a-6961-478b-9f6b-aa4cec1604cd/bin/utaipan/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-26 02:41:07,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:41:07,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-26 02:41:07,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:41:07,864 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:41:07,865 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-26 02:41:07,865 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:41:07,913 INFO L567 ElimStorePlain]: treesize reduction 10, result has 75.0 percent of original size [2019-11-26 02:41:07,940 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-26 02:41:07,940 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-26 02:41:07,941 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:41:07,961 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:41:07,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:41:07,963 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:41:07,963 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:31 [2019-11-26 02:41:07,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:41:08,005 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 11 treesize of output 7 [2019-11-26 02:41:08,006 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:41:08,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:41:08,029 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 11 treesize of output 7 [2019-11-26 02:41:08,030 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:41:08,043 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:41:08,043 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:41:08,044 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:31 [2019-11-26 02:41:08,081 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:41:08,082 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 15 treesize of output 19 [2019-11-26 02:41:08,082 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:41:08,104 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:41:08,108 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-26 02:41:08,108 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:41:08,120 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:41:08,120 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:41:08,120 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:33 [2019-11-26 02:41:08,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:41:08,166 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-26 02:41:08,167 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:41:08,197 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:41:08,202 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:41:08,203 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-11-26 02:41:08,204 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:41:08,222 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:41:08,223 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:41:08,223 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:61, output treesize:49 [2019-11-26 02:41:08,269 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2019-11-26 02:41:08,270 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-26 02:41:08,286 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:41:08,289 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-26 02:41:08,290 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:41:08,303 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:41:08,304 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-26 02:41:08,304 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:20 [2019-11-26 02:41:08,326 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-26 02:41:08,326 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:41:08,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:41:08,674 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-26 02:41:08,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1261561810] [2019-11-26 02:41:08,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:41:08,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 10 [2019-11-26 02:41:08,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680395835] [2019-11-26 02:41:08,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-26 02:41:08,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:41:08,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-26 02:41:08,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-26 02:41:08,676 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 11 states. [2019-11-26 02:41:18,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:41:18,083 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-11-26 02:41:18,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 02:41:18,084 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-11-26 02:41:18,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:41:18,085 INFO L225 Difference]: With dead ends: 57 [2019-11-26 02:41:18,085 INFO L226 Difference]: Without dead ends: 57 [2019-11-26 02:41:18,085 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-11-26 02:41:18,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-26 02:41:18,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-11-26 02:41:18,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-26 02:41:18,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-11-26 02:41:18,091 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 7 [2019-11-26 02:41:18,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:41:18,091 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-11-26 02:41:18,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-26 02:41:18,091 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-11-26 02:41:18,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-26 02:41:18,091 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:41:18,092 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:41:18,292 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:41:18,292 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-11-26 02:41:18,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:41:18,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1056667984, now seen corresponding path program 1 times [2019-11-26 02:41:18,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:41:18,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1271415802] [2019-11-26 02:41:18,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_94fa858a-6961-478b-9f6b-aa4cec1604cd/bin/utaipan/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-26 02:41:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:41:18,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-26 02:41:18,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:41:18,440 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-26 02:41:18,440 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:41:18,445 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:41:18,445 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:41:18,446 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-11-26 02:41:18,457 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-26 02:41:18,457 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:41:18,465 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:41:18,465 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:41:18,466 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-11-26 02:41:18,506 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:41:18,506 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 14 treesize of output 30 [2019-11-26 02:41:18,507 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:41:18,542 INFO L567 ElimStorePlain]: treesize reduction 14, result has 61.1 percent of original size [2019-11-26 02:41:18,542 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:41:18,542 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:22 [2019-11-26 02:41:18,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:41:18,566 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-11-26 02:41:18,566 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:41:18,578 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:41:18,579 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:41:18,579 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:30 [2019-11-26 02:41:18,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:41:18,689 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:41:18,689 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 112 [2019-11-26 02:41:18,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:41:18,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:41:18,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:41:18,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:41:18,694 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-26 02:41:18,753 INFO L567 ElimStorePlain]: treesize reduction 80, result has 40.3 percent of original size [2019-11-26 02:41:18,754 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-26 02:41:18,755 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:51 [2019-11-26 02:41:24,812 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 27 [2019-11-26 02:41:24,903 INFO L343 Elim1Store]: treesize reduction 10, result has 84.1 percent of original size [2019-11-26 02:41:24,904 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 46 treesize of output 71 [2019-11-26 02:41:24,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:41:24,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:41:24,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:41:24,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:41:24,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:41:24,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:41:24,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:41:24,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:41:24,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:41:24,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:41:24,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:41:24,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:41:24,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:41:24,912 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:41:24,926 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:41:24,927 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:41:24,927 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:13 [2019-11-26 02:41:24,945 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-26 02:41:24,945 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:41:24,982 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-26 02:41:25,000 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:41:25,001 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-26 02:41:25,001 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:37 [2019-11-26 02:41:25,588 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:41:25,588 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 218 treesize of output 222 [2019-11-26 02:41:25,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:41:25,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:41:25,589 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:41:25,648 INFO L567 ElimStorePlain]: treesize reduction 71, result has 71.4 percent of original size [2019-11-26 02:41:25,849 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:41:25,850 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: incompatible size at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.computeCostEstimation(ArrayIndexBasedCostEstimation.java:152) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.(ArrayIndexBasedCostEstimation.java:64) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:390) 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-26 02:41:25,853 INFO L168 Benchmark]: Toolchain (without parser) took 24176.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 171.4 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -192.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:41:25,853 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:41:25,854 INFO L168 Benchmark]: CACSL2BoogieTranslator took 617.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -179.6 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-26 02:41:25,854 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.71 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:41:25,854 INFO L168 Benchmark]: Boogie Preprocessor took 42.41 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:41:25,855 INFO L168 Benchmark]: RCFGBuilder took 760.80 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: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2019-11-26 02:41:25,856 INFO L168 Benchmark]: TraceAbstraction took 22693.69 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 28.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -51.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:41:25,858 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 617.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -179.6 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.71 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.41 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 760.80 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: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22693.69 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 28.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -51.4 MB). There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: incompatible size de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: incompatible size: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...