./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/list-properties/list_search-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) 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_79a7b186-ade7-40a1-9dde-c03f2861e9c8/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_79a7b186-ade7-40a1-9dde-c03f2861e9c8/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_79a7b186-ade7-40a1-9dde-c03f2861e9c8/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_79a7b186-ade7-40a1-9dde-c03f2861e9c8/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-properties/list_search-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_79a7b186-ade7-40a1-9dde-c03f2861e9c8/bin/utaipan/config/svcomp-MemCleanup-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_79a7b186-ade7-40a1-9dde-c03f2861e9c8/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d4b81a46ec2331214cca2fd1ae780369dc773284 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-6b5699a [2019-11-26 02:57:35,445 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:57:35,447 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:57:35,462 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:57:35,462 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:57:35,463 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:57:35,464 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:57:35,466 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:57:35,468 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:57:35,469 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:57:35,470 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:57:35,471 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:57:35,471 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:57:35,472 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:57:35,473 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:57:35,474 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:57:35,474 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:57:35,475 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:57:35,477 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:57:35,479 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:57:35,481 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:57:35,482 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:57:35,483 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:57:35,483 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:57:35,486 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:57:35,486 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:57:35,486 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:57:35,487 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:57:35,488 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:57:35,489 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:57:35,489 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:57:35,489 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:57:35,490 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:57:35,491 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:57:35,492 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:57:35,492 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:57:35,492 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:57:35,493 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:57:35,493 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:57:35,493 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:57:35,494 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:57:35,495 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_79a7b186-ade7-40a1-9dde-c03f2861e9c8/bin/utaipan/config/svcomp-MemCleanup-32bit-Taipan_Bitvector.epf [2019-11-26 02:57:35,508 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:57:35,508 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:57:35,508 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:57:35,509 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:57:35,509 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:57:35,509 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:57:35,509 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:57:35,509 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:57:35,509 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:57:35,510 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-26 02:57:35,510 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-26 02:57:35,510 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:57:35,511 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:57:35,511 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-26 02:57:35,511 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:57:35,511 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:57:35,511 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:57:35,511 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-26 02:57:35,512 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-26 02:57:35,512 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:57:35,512 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-26 02:57:35,512 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-26 02:57:35,512 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-26 02:57:35,513 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:57:35,513 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-26 02:57:35,513 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:57:35,513 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-26 02:57:35,513 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:57:35,514 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:57:35,514 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:57:35,514 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:57:35,514 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:57:35,514 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-11-26 02:57:35,514 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-26 02:57:35,515 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:57:35,515 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_79a7b186-ade7-40a1-9dde-c03f2861e9c8/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-memcleanup) ) 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 -> d4b81a46ec2331214cca2fd1ae780369dc773284 [2019-11-26 02:57:35,647 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:57:35,658 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:57:35,661 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:57:35,662 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:57:35,662 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:57:35,663 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_79a7b186-ade7-40a1-9dde-c03f2861e9c8/bin/utaipan/../../sv-benchmarks/c/list-properties/list_search-2.i [2019-11-26 02:57:35,711 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_79a7b186-ade7-40a1-9dde-c03f2861e9c8/bin/utaipan/data/25e93eabb/230a6dfae648425cb8716a14700f09a2/FLAG4c72dc979 [2019-11-26 02:57:36,185 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:57:36,190 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_79a7b186-ade7-40a1-9dde-c03f2861e9c8/sv-benchmarks/c/list-properties/list_search-2.i [2019-11-26 02:57:36,211 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_79a7b186-ade7-40a1-9dde-c03f2861e9c8/bin/utaipan/data/25e93eabb/230a6dfae648425cb8716a14700f09a2/FLAG4c72dc979 [2019-11-26 02:57:36,680 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_79a7b186-ade7-40a1-9dde-c03f2861e9c8/bin/utaipan/data/25e93eabb/230a6dfae648425cb8716a14700f09a2 [2019-11-26 02:57:36,683 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:57:36,684 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:57:36,685 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:57:36,685 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:57:36,688 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:57:36,689 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:57:36" (1/1) ... [2019-11-26 02:57:36,691 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72bd2ad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:57:36, skipping insertion in model container [2019-11-26 02:57:36,691 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:57:36" (1/1) ... [2019-11-26 02:57:36,698 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:57:36,739 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:57:37,138 INFO L965 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-26 02:57:37,139 INFO L968 CHandler]: at location: C: (mlist*)malloc(sizeof(mlist)) [781] [2019-11-26 02:57:37,139 INFO L969 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-26 02:57:37,146 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:57:37,157 INFO L198 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-26 02:57:37,168 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:57:37,229 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:57:37,238 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:57:37,279 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:57:37,379 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:57:37,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:57:37 WrapperNode [2019-11-26 02:57:37,380 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:57:37,381 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:57:37,381 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:57:37,381 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:57:37,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:57:37" (1/1) ... [2019-11-26 02:57:37,408 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:57:37" (1/1) ... [2019-11-26 02:57:37,435 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:57:37,438 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:57:37,439 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:57:37,440 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:57:37,448 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:57:37" (1/1) ... [2019-11-26 02:57:37,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:57:37" (1/1) ... [2019-11-26 02:57:37,467 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:57:37" (1/1) ... [2019-11-26 02:57:37,468 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:57:37" (1/1) ... [2019-11-26 02:57:37,479 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:57:37" (1/1) ... [2019-11-26 02:57:37,495 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:57:37" (1/1) ... [2019-11-26 02:57:37,502 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:57:37" (1/1) ... [2019-11-26 02:57:37,512 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:57:37,518 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:57:37,518 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:57:37,518 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:57:37,519 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:57:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79a7b186-ade7-40a1-9dde-c03f2861e9c8/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:57:37,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-26 02:57:37,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-26 02:57:37,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-26 02:57:37,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-26 02:57:37,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-26 02:57:37,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-26 02:57:37,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:57:37,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:57:38,597 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:57:38,597 INFO L284 CfgBuilder]: Removed 22 assume(true) statements. [2019-11-26 02:57:38,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:57:38 BoogieIcfgContainer [2019-11-26 02:57:38,598 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:57:38,599 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:57:38,599 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:57:38,602 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:57:38,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:57:36" (1/3) ... [2019-11-26 02:57:38,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40ac8e1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:57:38, skipping insertion in model container [2019-11-26 02:57:38,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:57:37" (2/3) ... [2019-11-26 02:57:38,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40ac8e1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:57:38, skipping insertion in model container [2019-11-26 02:57:38,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:57:38" (3/3) ... [2019-11-26 02:57:38,606 INFO L109 eAbstractionObserver]: Analyzing ICFG list_search-2.i [2019-11-26 02:57:38,614 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:57:38,620 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 56 error locations. [2019-11-26 02:57:38,630 INFO L249 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2019-11-26 02:57:38,652 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:57:38,652 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-26 02:57:38,652 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:57:38,652 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:57:38,652 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:57:38,653 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:57:38,653 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:57:38,653 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:57:38,675 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states. [2019-11-26 02:57:38,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-11-26 02:57:38,681 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:38,681 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-11-26 02:57:38,682 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-11-26 02:57:38,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:38,687 INFO L82 PathProgramCache]: Analyzing trace with hash 925605, now seen corresponding path program 1 times [2019-11-26 02:57:38,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:57:38,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [459433865] [2019-11-26 02:57:38,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79a7b186-ade7-40a1-9dde-c03f2861e9c8/bin/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:57:38,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:38,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-26 02:57:38,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:57:38,911 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-26 02:57:38,911 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:57:38,918 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:57:38,918 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:57:38,918 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-26 02:57:38,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:38,927 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:57:38,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:38,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [459433865] [2019-11-26 02:57:38,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:38,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-26 02:57:38,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469071568] [2019-11-26 02:57:38,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:57:38,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:57:38,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:57:38,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:57:38,961 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 3 states. [2019-11-26 02:57:39,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:39,367 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2019-11-26 02:57:39,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:57:39,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-11-26 02:57:39,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:39,378 INFO L225 Difference]: With dead ends: 109 [2019-11-26 02:57:39,378 INFO L226 Difference]: Without dead ends: 106 [2019-11-26 02:57:39,379 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:57:39,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-26 02:57:39,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-11-26 02:57:39,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-26 02:57:39,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2019-11-26 02:57:39,415 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 4 [2019-11-26 02:57:39,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:39,416 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2019-11-26 02:57:39,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:57:39,416 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2019-11-26 02:57:39,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-11-26 02:57:39,416 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:39,417 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-11-26 02:57:39,618 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:57:39,618 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-11-26 02:57:39,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:39,621 INFO L82 PathProgramCache]: Analyzing trace with hash 925606, now seen corresponding path program 1 times [2019-11-26 02:57:39,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:57:39,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [71861177] [2019-11-26 02:57:39,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79a7b186-ade7-40a1-9dde-c03f2861e9c8/bin/utaipan/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:57:39,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:39,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-26 02:57:39,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:57:39,730 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-26 02:57:39,730 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:57:39,737 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:57:39,737 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:57:39,737 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-26 02:57:39,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:39,747 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:57:39,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:39,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [71861177] [2019-11-26 02:57:39,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:39,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-26 02:57:39,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887314290] [2019-11-26 02:57:39,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:57:39,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:57:39,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:57:39,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:39,775 INFO L87 Difference]: Start difference. First operand 106 states and 115 transitions. Second operand 4 states. [2019-11-26 02:57:40,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:40,024 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2019-11-26 02:57:40,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:57:40,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-11-26 02:57:40,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:40,027 INFO L225 Difference]: With dead ends: 90 [2019-11-26 02:57:40,027 INFO L226 Difference]: Without dead ends: 90 [2019-11-26 02:57:40,027 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:40,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-26 02:57:40,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-11-26 02:57:40,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-26 02:57:40,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2019-11-26 02:57:40,036 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 4 [2019-11-26 02:57:40,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:40,036 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2019-11-26 02:57:40,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:57:40,036 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2019-11-26 02:57:40,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-26 02:57:40,037 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:40,038 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:57:40,241 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:57:40,242 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-11-26 02:57:40,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:40,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1934806513, now seen corresponding path program 1 times [2019-11-26 02:57:40,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:57:40,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [133358950] [2019-11-26 02:57:40,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79a7b186-ade7-40a1-9dde-c03f2861e9c8/bin/utaipan/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:57:40,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:40,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-26 02:57:40,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:57:40,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:40,417 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:57:40,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:40,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [133358950] [2019-11-26 02:57:40,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:40,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-26 02:57:40,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422441725] [2019-11-26 02:57:40,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:57:40,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:57:40,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:57:40,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:40,424 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 4 states. [2019-11-26 02:57:40,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:40,595 INFO L93 Difference]: Finished difference Result 106 states and 112 transitions. [2019-11-26 02:57:40,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:57:40,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-26 02:57:40,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:40,597 INFO L225 Difference]: With dead ends: 106 [2019-11-26 02:57:40,597 INFO L226 Difference]: Without dead ends: 106 [2019-11-26 02:57:40,598 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:57:40,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-26 02:57:40,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 84. [2019-11-26 02:57:40,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-26 02:57:40,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2019-11-26 02:57:40,614 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 24 [2019-11-26 02:57:40,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:40,614 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2019-11-26 02:57:40,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:57:40,614 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2019-11-26 02:57:40,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-26 02:57:40,615 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:40,616 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:57:40,818 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:57:40,818 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-11-26 02:57:40,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:40,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1106677015, now seen corresponding path program 1 times [2019-11-26 02:57:40,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:57:40,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [193204522] [2019-11-26 02:57:40,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79a7b186-ade7-40a1-9dde-c03f2861e9c8/bin/utaipan/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:57:41,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:41,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-26 02:57:41,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:57:41,036 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-26 02:57:41,037 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:57:41,039 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:57:41,039 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:57:41,039 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-26 02:57:41,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:41,063 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:57:41,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:41,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [193204522] [2019-11-26 02:57:41,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:41,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-26 02:57:41,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990475050] [2019-11-26 02:57:41,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:57:41,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:57:41,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:57:41,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:57:41,081 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand 5 states. [2019-11-26 02:57:41,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:41,486 INFO L93 Difference]: Finished difference Result 159 states and 170 transitions. [2019-11-26 02:57:41,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 02:57:41,486 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-11-26 02:57:41,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:41,489 INFO L225 Difference]: With dead ends: 159 [2019-11-26 02:57:41,489 INFO L226 Difference]: Without dead ends: 159 [2019-11-26 02:57:41,490 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:57:41,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-26 02:57:41,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 86. [2019-11-26 02:57:41,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-26 02:57:41,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2019-11-26 02:57:41,497 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 24 [2019-11-26 02:57:41,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:41,498 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2019-11-26 02:57:41,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:57:41,498 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2019-11-26 02:57:41,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-26 02:57:41,499 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:41,499 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:57:41,702 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:57:41,702 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-11-26 02:57:41,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:41,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1106677016, now seen corresponding path program 1 times [2019-11-26 02:57:41,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:57:41,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [333519620] [2019-11-26 02:57:41,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79a7b186-ade7-40a1-9dde-c03f2861e9c8/bin/utaipan/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:57:41,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:41,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-26 02:57:41,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:57:41,935 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-26 02:57:41,935 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:57:41,944 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:57:41,944 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:57:41,944 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-26 02:57:41,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:41,992 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:57:42,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:42,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [333519620] [2019-11-26 02:57:42,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:42,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-26 02:57:42,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044007050] [2019-11-26 02:57:42,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 02:57:42,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:57:42,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 02:57:42,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:57:42,126 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand 8 states. [2019-11-26 02:57:42,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:42,908 INFO L93 Difference]: Finished difference Result 177 states and 188 transitions. [2019-11-26 02:57:42,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 02:57:42,909 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-11-26 02:57:42,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:42,910 INFO L225 Difference]: With dead ends: 177 [2019-11-26 02:57:42,911 INFO L226 Difference]: Without dead ends: 177 [2019-11-26 02:57:42,911 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-11-26 02:57:42,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-11-26 02:57:42,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 95. [2019-11-26 02:57:42,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-11-26 02:57:42,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 111 transitions. [2019-11-26 02:57:42,918 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 111 transitions. Word has length 24 [2019-11-26 02:57:42,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:42,919 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 111 transitions. [2019-11-26 02:57:42,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 02:57:42,919 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 111 transitions. [2019-11-26 02:57:42,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-26 02:57:42,920 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:42,920 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:57:43,122 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:57:43,123 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-11-26 02:57:43,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:43,123 INFO L82 PathProgramCache]: Analyzing trace with hash 844428815, now seen corresponding path program 1 times [2019-11-26 02:57:43,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:57:43,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1811829087] [2019-11-26 02:57:43,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79a7b186-ade7-40a1-9dde-c03f2861e9c8/bin/utaipan/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:57:43,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:43,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-26 02:57:43,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:57:43,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:43,289 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:57:43,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:43,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1811829087] [2019-11-26 02:57:43,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:43,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-26 02:57:43,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441750925] [2019-11-26 02:57:43,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:57:43,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:57:43,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:57:43,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:57:43,294 INFO L87 Difference]: Start difference. First operand 95 states and 111 transitions. Second operand 5 states. [2019-11-26 02:57:43,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:43,504 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2019-11-26 02:57:43,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:57:43,504 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-26 02:57:43,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:43,505 INFO L225 Difference]: With dead ends: 113 [2019-11-26 02:57:43,505 INFO L226 Difference]: Without dead ends: 113 [2019-11-26 02:57:43,505 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:57:43,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-26 02:57:43,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 95. [2019-11-26 02:57:43,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-11-26 02:57:43,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2019-11-26 02:57:43,511 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 27 [2019-11-26 02:57:43,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:43,511 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2019-11-26 02:57:43,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:57:43,512 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2019-11-26 02:57:43,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-26 02:57:43,512 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:43,512 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:57:43,721 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:57:43,722 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-11-26 02:57:43,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:43,722 INFO L82 PathProgramCache]: Analyzing trace with hash 846058159, now seen corresponding path program 1 times [2019-11-26 02:57:43,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:57:43,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [294278119] [2019-11-26 02:57:43,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79a7b186-ade7-40a1-9dde-c03f2861e9c8/bin/utaipan/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:57:43,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:43,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-26 02:57:43,973 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:57:43,981 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-26 02:57:43,982 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:57:43,983 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:57:43,983 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:57:43,983 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-26 02:57:44,020 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:57:44,021 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 30 [2019-11-26 02:57:44,023 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:57:44,040 INFO L567 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2019-11-26 02:57:44,040 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:57:44,040 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:14 [2019-11-26 02:57:44,056 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-26 02:57:44,057 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:57:44,065 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:57:44,066 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:57:44,066 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-11-26 02:57:44,136 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-11-26 02:57:44,137 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:57:44,143 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:57:44,143 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:57:44,144 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:13 [2019-11-26 02:57:44,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:44,197 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:57:44,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:44,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [294278119] [2019-11-26 02:57:44,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106058802] [2019-11-26 02:57:44,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79a7b186-ade7-40a1-9dde-c03f2861e9c8/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:57:44,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:44,436 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-26 02:57:44,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:57:44,442 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-26 02:57:44,442 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:57:44,450 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:57:44,450 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:57:44,450 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-26 02:57:44,484 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:57:44,484 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2019-11-26 02:57:44,485 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:57:44,522 INFO L567 ElimStorePlain]: treesize reduction 14, result has 56.3 percent of original size [2019-11-26 02:57:44,523 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:57:44,523 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2019-11-26 02:57:44,618 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 13 treesize of output 9 [2019-11-26 02:57:44,619 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:57:44,641 INFO L567 ElimStorePlain]: treesize reduction 5, result has 85.3 percent of original size [2019-11-26 02:57:44,642 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:57:44,643 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:32 [2019-11-26 02:57:44,782 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-26 02:57:44,782 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:57:44,804 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:57:44,804 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:57:44,805 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:17 [2019-11-26 02:57:44,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:44,902 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:57:45,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:45,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-26 02:57:45,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9, 10] total 22 [2019-11-26 02:57:45,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753327410] [2019-11-26 02:57:45,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-26 02:57:45,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:57:45,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-26 02:57:45,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2019-11-26 02:57:45,134 INFO L87 Difference]: Start difference. First operand 95 states and 109 transitions. Second operand 23 states. [2019-11-26 02:57:46,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:46,968 INFO L93 Difference]: Finished difference Result 165 states and 177 transitions. [2019-11-26 02:57:46,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-26 02:57:46,970 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 27 [2019-11-26 02:57:46,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:46,971 INFO L225 Difference]: With dead ends: 165 [2019-11-26 02:57:46,971 INFO L226 Difference]: Without dead ends: 165 [2019-11-26 02:57:46,972 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 80 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=276, Invalid=914, Unknown=0, NotChecked=0, Total=1190 [2019-11-26 02:57:46,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-26 02:57:46,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 98. [2019-11-26 02:57:46,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-26 02:57:46,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 114 transitions. [2019-11-26 02:57:46,977 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 114 transitions. Word has length 27 [2019-11-26 02:57:46,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:46,977 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 114 transitions. [2019-11-26 02:57:46,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-26 02:57:46,978 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 114 transitions. [2019-11-26 02:57:46,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-26 02:57:46,978 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:46,979 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:57:47,383 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:57:47,383 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-11-26 02:57:47,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:47,384 INFO L82 PathProgramCache]: Analyzing trace with hash 846058160, now seen corresponding path program 1 times [2019-11-26 02:57:47,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:57:47,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1103986705] [2019-11-26 02:57:47,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79a7b186-ade7-40a1-9dde-c03f2861e9c8/bin/utaipan/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:57:47,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:47,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-26 02:57:47,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:57:47,651 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-26 02:57:47,651 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:57:47,658 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:57:47,660 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-26 02:57:47,661 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:57:47,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:57:47,667 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:57:47,667 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-26 02:57:47,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:57:47,700 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 14 treesize of output 16 [2019-11-26 02:57:47,701 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:57:47,722 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:57:47,738 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:57:47,738 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-26 02:57:47,739 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:57:47,755 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:57:47,756 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:57:47,756 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:23 [2019-11-26 02:57:47,794 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 13 treesize of output 9 [2019-11-26 02:57:47,794 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:57:47,829 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:57:47,833 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 13 treesize of output 9 [2019-11-26 02:57:47,833 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:57:47,847 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:57:47,848 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:57:47,848 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2019-11-26 02:57:47,948 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 25 treesize of output 13 [2019-11-26 02:57:47,949 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:57:47,963 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:57:47,968 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-26 02:57:47,968 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:57:47,976 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:57:47,977 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:57:47,977 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:20 [2019-11-26 02:57:48,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:48,047 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:57:48,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:57:48,954 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:48,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1103986705] [2019-11-26 02:57:48,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98479009] [2019-11-26 02:57:48,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79a7b186-ade7-40a1-9dde-c03f2861e9c8/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:57:49,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:49,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-26 02:57:49,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:57:49,050 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-26 02:57:49,051 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:57:49,064 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:57:49,066 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-26 02:57:49,066 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:57:49,073 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:57:49,073 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:57:49,073 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-26 02:57:49,089 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:57:49,090 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-26 02:57:49,090 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:57:49,103 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:57:49,106 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 14 treesize of output 16 [2019-11-26 02:57:49,106 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:57:49,116 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:57:49,117 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:57:49,117 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2019-11-26 02:57:49,248 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-26 02:57:49,249 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:57:49,322 INFO L567 ElimStorePlain]: treesize reduction 5, result has 88.9 percent of original size [2019-11-26 02:57:49,327 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 13 treesize of output 9 [2019-11-26 02:57:49,327 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:57:49,357 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:57:49,358 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:57:49,358 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:39 [2019-11-26 02:57:49,579 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 25 treesize of output 13 [2019-11-26 02:57:49,580 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:57:49,598 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:57:49,606 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-26 02:57:49,606 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:57:49,622 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:57:49,622 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:57:49,623 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2019-11-26 02:57:49,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:49,707 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:57:49,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:57:50,439 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-11-26 02:57:50,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:50,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-11-26 02:57:50,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 11] total 24 [2019-11-26 02:57:50,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119650243] [2019-11-26 02:57:50,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-26 02:57:50,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:57:50,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-26 02:57:50,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2019-11-26 02:57:50,451 INFO L87 Difference]: Start difference. First operand 98 states and 114 transitions. Second operand 25 states. [2019-11-26 02:57:51,687 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-11-26 02:57:51,849 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2019-11-26 02:57:52,218 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-11-26 02:57:54,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:54,613 INFO L93 Difference]: Finished difference Result 177 states and 188 transitions. [2019-11-26 02:57:54,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-26 02:57:54,613 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 27 [2019-11-26 02:57:54,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:54,615 INFO L225 Difference]: With dead ends: 177 [2019-11-26 02:57:54,615 INFO L226 Difference]: Without dead ends: 177 [2019-11-26 02:57:54,616 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 76 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=444, Invalid=1536, Unknown=0, NotChecked=0, Total=1980 [2019-11-26 02:57:54,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-11-26 02:57:54,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 98. [2019-11-26 02:57:54,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-26 02:57:54,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 113 transitions. [2019-11-26 02:57:54,623 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 113 transitions. Word has length 27 [2019-11-26 02:57:54,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:54,624 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 113 transitions. [2019-11-26 02:57:54,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-26 02:57:54,624 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 113 transitions. [2019-11-26 02:57:54,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-26 02:57:54,626 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:54,626 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:57:55,029 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:57:55,029 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-11-26 02:57:55,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:55,030 INFO L82 PathProgramCache]: Analyzing trace with hash 2048960887, now seen corresponding path program 1 times [2019-11-26 02:57:55,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:57:55,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1424333006] [2019-11-26 02:57:55,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79a7b186-ade7-40a1-9dde-c03f2861e9c8/bin/utaipan/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:57:55,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:55,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-26 02:57:55,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:57:55,206 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-26 02:57:55,207 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:57:55,208 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:57:55,209 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:57:55,209 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-26 02:57:55,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-26 02:57:55,229 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:57:55,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-26 02:57:55,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1424333006] [2019-11-26 02:57:55,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:55,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-26 02:57:55,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296830745] [2019-11-26 02:57:55,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:57:55,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:57:55,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:57:55,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:57:55,237 INFO L87 Difference]: Start difference. First operand 98 states and 113 transitions. Second operand 5 states. [2019-11-26 02:57:55,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:55,517 INFO L93 Difference]: Finished difference Result 159 states and 171 transitions. [2019-11-26 02:57:55,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:57:55,518 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-26 02:57:55,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:55,519 INFO L225 Difference]: With dead ends: 159 [2019-11-26 02:57:55,519 INFO L226 Difference]: Without dead ends: 159 [2019-11-26 02:57:55,520 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:57:55,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-26 02:57:55,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 103. [2019-11-26 02:57:55,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-26 02:57:55,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 122 transitions. [2019-11-26 02:57:55,524 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 122 transitions. Word has length 30 [2019-11-26 02:57:55,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:55,524 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 122 transitions. [2019-11-26 02:57:55,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:57:55,524 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2019-11-26 02:57:55,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-26 02:57:55,525 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:55,525 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:57:55,725 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:57:55,726 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-11-26 02:57:55,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:55,726 INFO L82 PathProgramCache]: Analyzing trace with hash 2048960888, now seen corresponding path program 1 times [2019-11-26 02:57:55,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:57:55,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1383288935] [2019-11-26 02:57:55,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79a7b186-ade7-40a1-9dde-c03f2861e9c8/bin/utaipan/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:57:55,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:55,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-26 02:57:55,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:57:55,913 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 13 treesize of output 9 [2019-11-26 02:57:55,913 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:57:55,919 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:57:55,920 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:57:55,920 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2019-11-26 02:57:55,963 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 16 treesize of output 8 [2019-11-26 02:57:55,963 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:57:55,965 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:57:55,966 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:57:55,966 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-11-26 02:57:55,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:55,987 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:57:56,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:56,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1383288935] [2019-11-26 02:57:56,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793659934] [2019-11-26 02:57:56,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79a7b186-ade7-40a1-9dde-c03f2861e9c8/bin/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:57:56,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:56,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-26 02:57:56,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:57:56,167 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-26 02:57:56,168 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:57:56,173 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:57:56,173 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:57:56,173 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-26 02:57:56,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-26 02:57:56,260 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:57:56,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-26 02:57:56,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 2 imperfect interpolant sequences. [2019-11-26 02:57:56,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 5] imperfect sequences [10, 9] total 20 [2019-11-26 02:57:56,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689832725] [2019-11-26 02:57:56,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-26 02:57:56,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:57:56,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-26 02:57:56,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2019-11-26 02:57:56,546 INFO L87 Difference]: Start difference. First operand 103 states and 122 transitions. Second operand 9 states. [2019-11-26 02:57:57,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:57,227 INFO L93 Difference]: Finished difference Result 258 states and 275 transitions. [2019-11-26 02:57:57,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 02:57:57,228 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-11-26 02:57:57,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:57,229 INFO L225 Difference]: With dead ends: 258 [2019-11-26 02:57:57,230 INFO L226 Difference]: Without dead ends: 258 [2019-11-26 02:57:57,230 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2019-11-26 02:57:57,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-11-26 02:57:57,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 106. [2019-11-26 02:57:57,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-26 02:57:57,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 125 transitions. [2019-11-26 02:57:57,234 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 125 transitions. Word has length 30 [2019-11-26 02:57:57,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:57,235 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 125 transitions. [2019-11-26 02:57:57,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-26 02:57:57,235 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 125 transitions. [2019-11-26 02:57:57,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-26 02:57:57,235 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:57,236 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:57:57,640 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:57:57,641 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr45REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr47REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr49REQUIRES_VIOLATION, ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr54REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr46REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr48REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr53REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-11-26 02:57:57,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:57,642 INFO L82 PathProgramCache]: Analyzing trace with hash 2050590231, now seen corresponding path program 2 times [2019-11-26 02:57:57,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:57:57,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [970854887] [2019-11-26 02:57:57,644 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_79a7b186-ade7-40a1-9dde-c03f2861e9c8/bin/utaipan/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:57:58,038 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-26 02:57:58,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 02:57:58,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-26 02:57:58,046 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:57:58,063 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:57:58,063 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 12 treesize of output 28 [2019-11-26 02:57:58,064 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:57:58,076 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-26 02:57:58,076 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:57:58,077 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-11-26 02:57:58,102 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:57:58,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 02:57:58,102 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:57:58,118 INFO L567 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2019-11-26 02:57:58,119 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:57:58,119 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:14 [2019-11-26 02:57:58,144 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-26 02:57:58,144 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:57:58,153 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:57:58,153 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:57:58,153 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-11-26 02:57:58,264 INFO L343 Elim1Store]: treesize reduction 14, result has 85.9 percent of original size [2019-11-26 02:57:58,264 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 32 treesize of output 103 [2019-11-26 02:57:58,265 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:57:58,314 INFO L567 ElimStorePlain]: treesize reduction 46, result has 47.7 percent of original size [2019-11-26 02:57:58,315 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:57:58,315 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:42 [2019-11-26 02:57:58,352 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 41 treesize of output 34 [2019-11-26 02:57:58,352 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:57:58,374 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:57:58,374 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:57:58,374 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:59 [2019-11-26 02:57:58,424 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_78|], 12=[|v_#memory_$Pointer$.base_83|]} [2019-11-26 02:57:58,430 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-26 02:57:58,430 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:57:58,468 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:57:58,473 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:57:58,474 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:57:58,475 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:57:58,476 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2019-11-26 02:57:58,477 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:57:58,523 INFO L567 ElimStorePlain]: treesize reduction 4, result has 94.1 percent of original size [2019-11-26 02:57:58,523 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:57:58,523 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:78, output treesize:73 [2019-11-26 02:57:58,698 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-26 02:57:58,698 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:57:58,728 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:57:58,729 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:57:58,729 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:74, output treesize:63 [2019-11-26 02:57:58,843 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:57:58,843 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 34 [2019-11-26 02:57:58,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:57:58,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:57:58,845 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:57:58,872 INFO L567 ElimStorePlain]: treesize reduction 4, result has 87.5 percent of original size [2019-11-26 02:57:58,872 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-26 02:57:58,872 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:64, output treesize:28 [2019-11-26 02:57:58,971 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:58,972 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:57:59,476 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:57:59,495 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:57:59,496 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:57:59,496 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:42 [2019-11-26 02:58:15,551 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:58:15,551 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 239 treesize of output 239 [2019-11-26 02:58:15,568 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:58:15,569 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 22 treesize of output 26 [2019-11-26 02:58:15,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:58:15,573 INFO L392 ElimStorePlain]: Different costs {0=[v_arrayElimCell_32], 1=[v_arrayElimCell_31]} [2019-11-26 02:58:15,776 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:58:15,777 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-26 02:58:15,781 INFO L168 Benchmark]: Toolchain (without parser) took 39096.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 198.2 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -167.9 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2019-11-26 02:58:15,782 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:58:15,783 INFO L168 Benchmark]: CACSL2BoogieTranslator took 695.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -136.5 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:58:15,783 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:58:15,784 INFO L168 Benchmark]: Boogie Preprocessor took 78.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:58:15,784 INFO L168 Benchmark]: RCFGBuilder took 1080.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. [2019-11-26 02:58:15,784 INFO L168 Benchmark]: TraceAbstraction took 37180.86 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -86.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:58:15,790 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 695.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -136.5 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 78.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1080.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 37180.86 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -86.1 MB). There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...