./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/test-0019_1-1.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_6eb74337-8ed8-4599-9d1f-a84644582b36/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6eb74337-8ed8-4599-9d1f-a84644582b36/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6eb74337-8ed8-4599-9d1f-a84644582b36/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6eb74337-8ed8-4599-9d1f-a84644582b36/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0019_1-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_6eb74337-8ed8-4599-9d1f-a84644582b36/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6eb74337-8ed8-4599-9d1f-a84644582b36/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 eb5e103dbe59a250cbe01613b667895523582d5d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 03:00:18,081 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 03:00:18,083 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 03:00:18,097 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 03:00:18,098 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 03:00:18,099 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 03:00:18,101 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 03:00:18,108 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 03:00:18,113 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 03:00:18,117 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 03:00:18,118 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 03:00:18,120 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 03:00:18,120 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 03:00:18,123 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 03:00:18,124 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 03:00:18,125 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 03:00:18,126 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 03:00:18,127 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 03:00:18,129 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 03:00:18,133 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 03:00:18,136 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 03:00:18,139 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 03:00:18,140 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 03:00:18,141 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 03:00:18,144 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 03:00:18,144 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 03:00:18,144 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 03:00:18,146 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 03:00:18,146 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 03:00:18,147 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 03:00:18,148 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 03:00:18,148 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 03:00:18,149 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 03:00:18,149 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 03:00:18,150 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 03:00:18,150 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 03:00:18,151 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 03:00:18,151 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 03:00:18,151 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 03:00:18,152 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 03:00:18,153 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 03:00:18,154 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6eb74337-8ed8-4599-9d1f-a84644582b36/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-11-26 03:00:18,178 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 03:00:18,178 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 03:00:18,179 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 03:00:18,179 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 03:00:18,179 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 03:00:18,179 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 03:00:18,180 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 03:00:18,180 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 03:00:18,180 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 03:00:18,180 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-26 03:00:18,181 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-26 03:00:18,181 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 03:00:18,181 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 03:00:18,181 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-26 03:00:18,181 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 03:00:18,182 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 03:00:18,182 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 03:00:18,182 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-26 03:00:18,182 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-26 03:00:18,182 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-26 03:00:18,182 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 03:00:18,183 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-26 03:00:18,183 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-26 03:00:18,183 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-26 03:00:18,183 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 03:00:18,183 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-26 03:00:18,183 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 03:00:18,184 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-26 03:00:18,184 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 03:00:18,184 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 03:00:18,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 03:00:18,184 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 03:00:18,185 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 03:00:18,185 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-11-26 03:00:18,185 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-26 03:00:18,185 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 03:00:18,185 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_6eb74337-8ed8-4599-9d1f-a84644582b36/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 -> eb5e103dbe59a250cbe01613b667895523582d5d [2019-11-26 03:00:18,366 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 03:00:18,381 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 03:00:18,384 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 03:00:18,385 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 03:00:18,385 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 03:00:18,386 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6eb74337-8ed8-4599-9d1f-a84644582b36/bin/utaipan/../../sv-benchmarks/c/list-ext-properties/test-0019_1-1.i [2019-11-26 03:00:18,444 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6eb74337-8ed8-4599-9d1f-a84644582b36/bin/utaipan/data/b2e786ca0/b99d9bea3d38498dbc268debedbf54f3/FLAGb19b572da [2019-11-26 03:00:18,871 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 03:00:18,873 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6eb74337-8ed8-4599-9d1f-a84644582b36/sv-benchmarks/c/list-ext-properties/test-0019_1-1.i [2019-11-26 03:00:18,887 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6eb74337-8ed8-4599-9d1f-a84644582b36/bin/utaipan/data/b2e786ca0/b99d9bea3d38498dbc268debedbf54f3/FLAGb19b572da [2019-11-26 03:00:19,246 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6eb74337-8ed8-4599-9d1f-a84644582b36/bin/utaipan/data/b2e786ca0/b99d9bea3d38498dbc268debedbf54f3 [2019-11-26 03:00:19,248 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 03:00:19,249 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 03:00:19,250 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 03:00:19,250 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 03:00:19,254 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 03:00:19,254 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 03:00:19" (1/1) ... [2019-11-26 03:00:19,257 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a19833d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:00:19, skipping insertion in model container [2019-11-26 03:00:19,257 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 03:00:19" (1/1) ... [2019-11-26 03:00:19,264 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 03:00:19,321 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 03:00:19,689 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 03:00:19,690 INFO L968 CHandler]: at location: C: (int *)malloc(sizeof(int)) [518] [2019-11-26 03:00:19,690 INFO L969 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-26 03:00:19,691 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 03:00:19,692 INFO L968 CHandler]: at location: C: (int *)malloc(sizeof(int)) [519] [2019-11-26 03:00:19,692 INFO L969 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-26 03:00:19,702 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 03:00:19,715 INFO L198 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-26 03:00:19,723 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 03:00:19,768 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 03:00:19,783 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 03:00:19,840 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 03:00:19,897 INFO L205 MainTranslator]: Completed translation [2019-11-26 03:00:19,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:00:19 WrapperNode [2019-11-26 03:00:19,898 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 03:00:19,898 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 03:00:19,898 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 03:00:19,899 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 03:00:19,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:00:19" (1/1) ... [2019-11-26 03:00:19,923 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:00:19" (1/1) ... [2019-11-26 03:00:19,943 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 03:00:19,948 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 03:00:19,948 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 03:00:19,948 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 03:00:19,955 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:00:19" (1/1) ... [2019-11-26 03:00:19,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:00:19" (1/1) ... [2019-11-26 03:00:19,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:00:19" (1/1) ... [2019-11-26 03:00:19,959 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:00:19" (1/1) ... [2019-11-26 03:00:19,968 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:00:19" (1/1) ... [2019-11-26 03:00:19,970 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:00:19" (1/1) ... [2019-11-26 03:00:19,972 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:00:19" (1/1) ... [2019-11-26 03:00:19,975 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 03:00:19,976 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 03:00:19,976 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 03:00:19,976 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 03:00:19,977 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:00:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6eb74337-8ed8-4599-9d1f-a84644582b36/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 03:00:20,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-26 03:00:20,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-26 03:00:20,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-26 03:00:20,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-26 03:00:20,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-26 03:00:20,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-26 03:00:20,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-26 03:00:20,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 03:00:20,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 03:00:20,551 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 03:00:20,551 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-26 03:00:20,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 03:00:20 BoogieIcfgContainer [2019-11-26 03:00:20,552 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 03:00:20,553 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 03:00:20,553 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 03:00:20,558 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 03:00:20,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 03:00:19" (1/3) ... [2019-11-26 03:00:20,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60696912 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 03:00:20, skipping insertion in model container [2019-11-26 03:00:20,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:00:19" (2/3) ... [2019-11-26 03:00:20,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60696912 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 03:00:20, skipping insertion in model container [2019-11-26 03:00:20,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 03:00:20" (3/3) ... [2019-11-26 03:00:20,563 INFO L109 eAbstractionObserver]: Analyzing ICFG test-0019_1-1.i [2019-11-26 03:00:20,572 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 03:00:20,580 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2019-11-26 03:00:20,590 INFO L249 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2019-11-26 03:00:20,610 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 03:00:20,610 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-26 03:00:20,610 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 03:00:20,610 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 03:00:20,610 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 03:00:20,611 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 03:00:20,611 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 03:00:20,611 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 03:00:20,631 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2019-11-26 03:00:20,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-26 03:00:20,640 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:00:20,641 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-26 03:00:20,642 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-11-26 03:00:20,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:00:20,647 INFO L82 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2019-11-26 03:00:20,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 03:00:20,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [69998385] [2019-11-26 03:00:20,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6eb74337-8ed8-4599-9d1f-a84644582b36/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 03:00:20,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:00:20,769 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-26 03:00:20,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 03:00:20,856 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-26 03:00:20,857 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 03:00:20,857 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 03:00:20,867 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 03:00:20,870 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 03:00:20,870 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-11-26 03:00:20,885 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 03:00:20,885 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 03:00:20,900 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 03:00:20,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [69998385] [2019-11-26 03:00:20,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:00:20,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-26 03:00:20,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118496346] [2019-11-26 03:00:20,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 03:00:20,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 03:00:20,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 03:00:20,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 03:00:20,921 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 4 states. [2019-11-26 03:00:21,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:00:21,133 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-11-26 03:00:21,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 03:00:21,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-11-26 03:00:21,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:00:21,146 INFO L225 Difference]: With dead ends: 65 [2019-11-26 03:00:21,146 INFO L226 Difference]: Without dead ends: 63 [2019-11-26 03:00:21,148 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 03:00:21,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-26 03:00:21,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2019-11-26 03:00:21,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-26 03:00:21,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-11-26 03:00:21,178 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 3 [2019-11-26 03:00:21,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:00:21,178 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-11-26 03:00:21,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 03:00:21,179 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-11-26 03:00:21,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-26 03:00:21,179 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:00:21,179 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-26 03:00:21,381 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 03:00:21,381 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-11-26 03:00:21,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:00:21,381 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2019-11-26 03:00:21,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 03:00:21,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1723255738] [2019-11-26 03:00:21,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6eb74337-8ed8-4599-9d1f-a84644582b36/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 03:00:21,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:00:21,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-26 03:00:21,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 03:00:21,476 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_31|], 1=[|v_#valid_44|]} [2019-11-26 03:00:21,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 03:00:21,490 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 03:00:21,490 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 03:00:21,503 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 03:00:21,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 03:00:21,509 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 03:00:21,510 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 03:00:21,525 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 03:00:21,526 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 03:00:21,526 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:14 [2019-11-26 03:00:21,540 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 03:00:21,540 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 03:00:21,580 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 03:00:21,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1723255738] [2019-11-26 03:00:21,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:00:21,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-26 03:00:21,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10171939] [2019-11-26 03:00:21,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 03:00:21,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 03:00:21,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 03:00:21,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 03:00:21,583 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 4 states. [2019-11-26 03:00:21,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:00:21,811 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-11-26 03:00:21,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 03:00:21,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-11-26 03:00:21,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:00:21,813 INFO L225 Difference]: With dead ends: 54 [2019-11-26 03:00:21,813 INFO L226 Difference]: Without dead ends: 54 [2019-11-26 03:00:21,814 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 03:00:21,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-26 03:00:21,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-11-26 03:00:21,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-26 03:00:21,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-11-26 03:00:21,820 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 3 [2019-11-26 03:00:21,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:00:21,820 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-11-26 03:00:21,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 03:00:21,821 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-11-26 03:00:21,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-26 03:00:21,821 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:00:21,821 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-26 03:00:22,023 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 03:00:22,024 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-11-26 03:00:22,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:00:22,025 INFO L82 PathProgramCache]: Analyzing trace with hash 28691811, now seen corresponding path program 1 times [2019-11-26 03:00:22,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 03:00:22,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [528710081] [2019-11-26 03:00:22,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6eb74337-8ed8-4599-9d1f-a84644582b36/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 03:00:22,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:00:22,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-26 03:00:22,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 03:00:22,148 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_33|], 1=[|v_#valid_46|]} [2019-11-26 03:00:22,153 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 03:00:22,155 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 03:00:22,155 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 03:00:22,167 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 03:00:22,170 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 03:00:22,178 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 03:00:22,178 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 03:00:22,186 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 03:00:22,187 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 03:00:22,187 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:14 [2019-11-26 03:00:22,224 INFO L392 ElimStorePlain]: Different costs {1=[|v_#valid_47|], 3=[|v_#length_34|]} [2019-11-26 03:00:22,238 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 03:00:22,238 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 03:00:22,239 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 03:00:22,257 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 03:00:22,286 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 03:00:22,286 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 03:00:22,287 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 03:00:22,334 INFO L567 ElimStorePlain]: treesize reduction 28, result has 40.4 percent of original size [2019-11-26 03:00:22,335 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 03:00:22,336 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:19 [2019-11-26 03:00:22,342 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 03:00:22,342 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 03:00:22,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 03:00:22,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 03:00:22,545 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 03:00:22,545 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 03:00:22,546 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 03:00:22,568 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 03:00:22,568 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 03:00:22,569 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 03:00:22,601 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 03:00:22,602 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 03:00:22,602 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 03:00:22,660 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 03:00:22,661 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 03:00:22,661 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:62, output treesize:27 [2019-11-26 03:00:22,718 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 03:00:22,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [528710081] [2019-11-26 03:00:22,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:00:22,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-26 03:00:22,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160784260] [2019-11-26 03:00:22,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 03:00:22,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 03:00:22,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 03:00:22,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 03:00:22,721 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 6 states. [2019-11-26 03:00:22,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:00:22,954 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-11-26 03:00:22,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 03:00:22,955 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-11-26 03:00:22,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:00:22,956 INFO L225 Difference]: With dead ends: 59 [2019-11-26 03:00:22,956 INFO L226 Difference]: Without dead ends: 59 [2019-11-26 03:00:22,956 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 03:00:22,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-26 03:00:22,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2019-11-26 03:00:22,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-26 03:00:22,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-11-26 03:00:22,962 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 5 [2019-11-26 03:00:22,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:00:22,962 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-11-26 03:00:22,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 03:00:22,963 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-11-26 03:00:22,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-26 03:00:22,963 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:00:22,963 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:00:23,166 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 03:00:23,166 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-11-26 03:00:23,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:00:23,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1803024997, now seen corresponding path program 1 times [2019-11-26 03:00:23,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 03:00:23,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1060697394] [2019-11-26 03:00:23,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6eb74337-8ed8-4599-9d1f-a84644582b36/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 03:00:23,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:00:23,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-26 03:00:23,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 03:00:23,316 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-26 03:00:23,317 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 03:00:23,317 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 03:00:23,325 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 03:00:23,325 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 03:00:23,325 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:14 [2019-11-26 03:00:23,351 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 03:00:23,351 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 03:00:23,363 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 03:00:23,364 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 03:00:23,364 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2019-11-26 03:00:23,470 INFO L343 Elim1Store]: treesize reduction 12, result has 86.2 percent of original size [2019-11-26 03:00:23,470 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 03:00:23,471 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 03:00:23,547 INFO L567 ElimStorePlain]: treesize reduction 40, result has 46.7 percent of original size [2019-11-26 03:00:23,547 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 03:00:23,547 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:35 [2019-11-26 03:00:23,585 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 03:00:23,589 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 03:00:23,589 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 03:00:23,621 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 03:00:23,622 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 03:00:23,622 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:52, output treesize:55 [2019-11-26 03:00:23,665 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 03:00:23,667 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 03:00:23,682 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 03:00:23,683 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 03:00:23,683 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:28 [2019-11-26 03:00:23,705 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 03:00:23,705 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 03:00:23,817 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 03:00:23,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1060697394] [2019-11-26 03:00:23,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:00:23,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 10 [2019-11-26 03:00:23,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978984513] [2019-11-26 03:00:23,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-26 03:00:23,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 03:00:23,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-26 03:00:23,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-26 03:00:23,819 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 11 states. [2019-11-26 03:00:24,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:00:24,285 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-11-26 03:00:24,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 03:00:24,286 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-11-26 03:00:24,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:00:24,287 INFO L225 Difference]: With dead ends: 58 [2019-11-26 03:00:24,287 INFO L226 Difference]: Without dead ends: 58 [2019-11-26 03:00:24,287 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2019-11-26 03:00:24,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-26 03:00:24,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2019-11-26 03:00:24,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-26 03:00:24,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-11-26 03:00:24,292 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 7 [2019-11-26 03:00:24,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:00:24,293 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-11-26 03:00:24,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-26 03:00:24,293 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-11-26 03:00:24,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-26 03:00:24,293 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:00:24,294 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:00:24,495 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 03:00:24,496 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-11-26 03:00:24,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:00:24,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1803024998, now seen corresponding path program 1 times [2019-11-26 03:00:24,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 03:00:24,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [319728856] [2019-11-26 03:00:24,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6eb74337-8ed8-4599-9d1f-a84644582b36/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 03:00:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:00:24,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-26 03:00:24,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 03:00:24,611 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-26 03:00:24,611 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 03:00:24,611 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 03:00:24,622 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 03:00:24,645 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 03:00:24,646 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 03:00:24,646 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 03:00:24,682 INFO L567 ElimStorePlain]: treesize reduction 10, result has 75.6 percent of original size [2019-11-26 03:00:24,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:00:24,684 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 03:00:24,684 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:31 [2019-11-26 03:00:24,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:00:24,731 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 03:00:24,732 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 03:00:24,747 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 03:00:24,751 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 03:00:24,751 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 03:00:24,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 03:00:24,787 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 03:00:24,787 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:31 [2019-11-26 03:00:24,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 03:00:24,821 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 03:00:24,822 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 03:00:24,841 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 03:00:24,853 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 03:00:24,853 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 03:00:24,854 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 03:00:24,865 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 03:00:24,866 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 03:00:24,866 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:33 [2019-11-26 03:00:24,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 03:00:24,906 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 03:00:24,907 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 03:00:24,933 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 03:00:24,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 03:00:24,939 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 03:00:24,940 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 03:00:24,958 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 03:00:24,959 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 03:00:24,959 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:61, output treesize:49 [2019-11-26 03:00:24,999 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 03:00:25,001 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 03:00:25,013 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 03:00:25,018 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 03:00:25,019 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 03:00:25,027 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 03:00:25,027 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 03:00:25,027 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:20 [2019-11-26 03:00:25,066 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 03:00:25,066 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 03:00:25,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 03:00:25,501 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 03:00:25,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [319728856] [2019-11-26 03:00:25,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:00:25,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 10 [2019-11-26 03:00:25,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638984229] [2019-11-26 03:00:25,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-26 03:00:25,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 03:00:25,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-26 03:00:25,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-26 03:00:25,502 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 11 states. [2019-11-26 03:00:26,418 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-11-26 03:00:28,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:00:28,656 INFO L93 Difference]: Finished difference Result 59 states and 58 transitions. [2019-11-26 03:00:28,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 03:00:28,657 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-11-26 03:00:28,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:00:28,657 INFO L225 Difference]: With dead ends: 59 [2019-11-26 03:00:28,658 INFO L226 Difference]: Without dead ends: 59 [2019-11-26 03:00:28,658 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2019-11-26 03:00:28,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-26 03:00:28,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 50. [2019-11-26 03:00:28,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-26 03:00:28,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-11-26 03:00:28,662 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 7 [2019-11-26 03:00:28,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:00:28,663 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-11-26 03:00:28,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-26 03:00:28,663 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-11-26 03:00:28,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-26 03:00:28,663 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:00:28,663 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:00:28,866 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 03:00:28,867 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-11-26 03:00:28,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:00:28,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1056667984, now seen corresponding path program 1 times [2019-11-26 03:00:28,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 03:00:28,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [824871262] [2019-11-26 03:00:28,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6eb74337-8ed8-4599-9d1f-a84644582b36/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 03:00:29,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:00:29,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-26 03:00:29,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 03:00:29,031 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 03:00:29,031 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 03:00:29,037 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 03:00:29,037 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 03:00:29,037 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-11-26 03:00:29,049 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 03:00:29,050 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 03:00:29,059 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 03:00:29,060 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 03:00:29,060 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-11-26 03:00:29,101 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 03:00:29,102 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 03:00:29,102 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 03:00:29,128 INFO L567 ElimStorePlain]: treesize reduction 14, result has 61.1 percent of original size [2019-11-26 03:00:29,129 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 03:00:29,129 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:22 [2019-11-26 03:00:29,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 03:00:29,157 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 03:00:29,158 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 03:00:29,181 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 03:00:29,182 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 03:00:29,182 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:30 [2019-11-26 03:00:29,236 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 03:00:29,327 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 03:00:29,327 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 03:00:29,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:00:29,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:00:29,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:00:29,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:00:29,331 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 03:00:29,433 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 30 [2019-11-26 03:00:29,435 INFO L567 ElimStorePlain]: treesize reduction 80, result has 40.3 percent of original size [2019-11-26 03:00:29,436 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 03:00:29,436 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:51 [2019-11-26 03:00:35,481 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 27 [2019-11-26 03:00:35,552 INFO L343 Elim1Store]: treesize reduction 10, result has 84.1 percent of original size [2019-11-26 03:00:35,552 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 03:00:35,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 03:00:35,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 03:00:35,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 03:00:35,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 03:00:35,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 03:00:35,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 03:00:35,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 03:00:35,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 03:00:35,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 03:00:35,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 03:00:35,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 03:00:35,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 03:00:35,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 03:00:35,560 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 03:00:35,578 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 03:00:35,579 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 03:00:35,579 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:13 [2019-11-26 03:00:35,604 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 03:00:35,605 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 03:00:35,649 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 03:00:35,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 03:00:35,668 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 03:00:35,668 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:37 [2019-11-26 03:00:36,295 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 03:00:36,296 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 03:00:36,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:00:36,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 03:00:36,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 03:00:36,366 INFO L567 ElimStorePlain]: treesize reduction 71, result has 71.4 percent of original size [2019-11-26 03:00:36,567 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 03:00:36,568 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 03:00:36,571 INFO L168 Benchmark]: Toolchain (without parser) took 17321.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 192.4 MB). Free memory was 943.4 MB in the beginning and 956.7 MB in the end (delta: -13.3 MB). Peak memory consumption was 179.1 MB. Max. memory is 11.5 GB. [2019-11-26 03:00:36,571 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 03:00:36,572 INFO L168 Benchmark]: CACSL2BoogieTranslator took 647.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -131.8 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-26 03:00:36,572 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. [2019-11-26 03:00:36,572 INFO L168 Benchmark]: Boogie Preprocessor took 27.46 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 03:00:36,573 INFO L168 Benchmark]: RCFGBuilder took 576.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 30.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. [2019-11-26 03:00:36,573 INFO L168 Benchmark]: TraceAbstraction took 16016.82 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 92.8 MB). Free memory was 1.0 GB in the beginning and 956.7 MB in the end (delta: 79.5 MB). Peak memory consumption was 172.3 MB. Max. memory is 11.5 GB. [2019-11-26 03:00:36,575 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.44 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 647.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -131.8 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.46 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 576.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 30.0 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16016.82 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 92.8 MB). Free memory was 1.0 GB in the beginning and 956.7 MB in the end (delta: 79.5 MB). Peak memory consumption was 172.3 MB. 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...