./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/sll-circular-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6b5699aa Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7046def2-ccb3-4e2f-a3ab-b4dd52cba02f/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7046def2-ccb3-4e2f-a3ab-b4dd52cba02f/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7046def2-ccb3-4e2f-a3ab-b4dd52cba02f/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7046def2-ccb3-4e2f-a3ab-b4dd52cba02f/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-circular-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_7046def2-ccb3-4e2f-a3ab-b4dd52cba02f/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7046def2-ccb3-4e2f-a3ab-b4dd52cba02f/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 811c06b4616c360d68e825b8fa9e0b4596e5faf8 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: incompatible size --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-6b5699a [2019-11-26 02:16:24,630 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:16:24,632 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:16:24,646 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:16:24,646 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:16:24,648 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:16:24,649 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:16:24,657 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:16:24,661 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:16:24,665 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:16:24,667 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:16:24,668 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:16:24,668 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:16:24,670 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:16:24,671 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:16:24,672 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:16:24,673 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:16:24,674 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:16:24,676 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:16:24,679 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:16:24,683 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:16:24,686 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:16:24,688 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:16:24,688 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:16:24,691 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:16:24,691 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:16:24,691 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:16:24,693 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:16:24,693 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:16:24,694 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:16:24,694 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:16:24,695 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:16:24,696 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:16:24,697 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:16:24,698 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:16:24,699 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:16:24,699 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:16:24,700 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:16:24,700 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:16:24,700 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:16:24,702 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:16:24,702 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7046def2-ccb3-4e2f-a3ab-b4dd52cba02f/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-11-26 02:16:24,727 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:16:24,727 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:16:24,727 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:16:24,728 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:16:24,728 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:16:24,728 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:16:24,728 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:16:24,728 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:16:24,729 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:16:24,729 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-26 02:16:24,729 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-26 02:16:24,730 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:16:24,730 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:16:24,730 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-26 02:16:24,730 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:16:24,730 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:16:24,730 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:16:24,731 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-26 02:16:24,731 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-26 02:16:24,731 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-26 02:16:24,731 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:16:24,731 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-26 02:16:24,731 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-26 02:16:24,732 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-26 02:16:24,732 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:16:24,732 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-26 02:16:24,732 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:16:24,732 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-26 02:16:24,733 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:16:24,733 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:16:24,733 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:16:24,733 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:16:24,733 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:16:24,744 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-11-26 02:16:24,744 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-26 02:16:24,744 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:16:24,744 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_7046def2-ccb3-4e2f-a3ab-b4dd52cba02f/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 811c06b4616c360d68e825b8fa9e0b4596e5faf8 [2019-11-26 02:16:24,907 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:16:24,918 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:16:24,920 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:16:24,922 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:16:24,922 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:16:24,923 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7046def2-ccb3-4e2f-a3ab-b4dd52cba02f/bin/utaipan/../../sv-benchmarks/c/forester-heap/sll-circular-1.i [2019-11-26 02:16:24,976 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7046def2-ccb3-4e2f-a3ab-b4dd52cba02f/bin/utaipan/data/6bcde6746/2d1939083df44b948070ef548e5ee06f/FLAGc0f55ef91 [2019-11-26 02:16:25,414 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:16:25,415 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7046def2-ccb3-4e2f-a3ab-b4dd52cba02f/sv-benchmarks/c/forester-heap/sll-circular-1.i [2019-11-26 02:16:25,426 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7046def2-ccb3-4e2f-a3ab-b4dd52cba02f/bin/utaipan/data/6bcde6746/2d1939083df44b948070ef548e5ee06f/FLAGc0f55ef91 [2019-11-26 02:16:25,752 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7046def2-ccb3-4e2f-a3ab-b4dd52cba02f/bin/utaipan/data/6bcde6746/2d1939083df44b948070ef548e5ee06f [2019-11-26 02:16:25,754 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:16:25,755 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:16:25,757 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:16:25,757 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:16:25,760 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:16:25,761 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:16:25" (1/1) ... [2019-11-26 02:16:25,763 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fb8b673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:16:25, skipping insertion in model container [2019-11-26 02:16:25,763 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:16:25" (1/1) ... [2019-11-26 02:16:25,771 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:16:25,816 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:16:26,223 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:16:26,241 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:16:26,278 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:16:26,330 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:16:26,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:16:26 WrapperNode [2019-11-26 02:16:26,330 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:16:26,331 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:16:26,331 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:16:26,332 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:16:26,339 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:16:26" (1/1) ... [2019-11-26 02:16:26,362 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:16:26" (1/1) ... [2019-11-26 02:16:26,384 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:16:26,385 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:16:26,385 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:16:26,385 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:16:26,394 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:16:26" (1/1) ... [2019-11-26 02:16:26,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:16:26" (1/1) ... [2019-11-26 02:16:26,398 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:16:26" (1/1) ... [2019-11-26 02:16:26,398 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:16:26" (1/1) ... [2019-11-26 02:16:26,411 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:16:26" (1/1) ... [2019-11-26 02:16:26,416 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:16:26" (1/1) ... [2019-11-26 02:16:26,418 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:16:26" (1/1) ... [2019-11-26 02:16:26,422 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:16:26,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:16:26,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:16:26,422 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:16:26,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:16:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7046def2-ccb3-4e2f-a3ab-b4dd52cba02f/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:16:26,477 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-26 02:16:26,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-26 02:16:26,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-26 02:16:26,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-26 02:16:26,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-26 02:16:26,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-26 02:16:26,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:16:26,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:16:27,130 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:16:27,130 INFO L284 CfgBuilder]: Removed 13 assume(true) statements. [2019-11-26 02:16:27,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:16:27 BoogieIcfgContainer [2019-11-26 02:16:27,131 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:16:27,132 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:16:27,133 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:16:27,136 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:16:27,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:16:25" (1/3) ... [2019-11-26 02:16:27,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c0b7650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:16:27, skipping insertion in model container [2019-11-26 02:16:27,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:16:26" (2/3) ... [2019-11-26 02:16:27,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c0b7650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:16:27, skipping insertion in model container [2019-11-26 02:16:27,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:16:27" (3/3) ... [2019-11-26 02:16:27,139 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-circular-1.i [2019-11-26 02:16:27,148 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:16:27,155 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 43 error locations. [2019-11-26 02:16:27,165 INFO L249 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2019-11-26 02:16:27,183 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:16:27,183 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-26 02:16:27,184 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:16:27,184 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:16:27,184 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:16:27,184 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:16:27,184 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:16:27,184 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:16:27,201 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states. [2019-11-26 02:16:27,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-26 02:16:27,207 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:16:27,208 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-26 02:16:27,208 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-11-26 02:16:27,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:16:27,214 INFO L82 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2019-11-26 02:16:27,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:16:27,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [582002906] [2019-11-26 02:16:27,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7046def2-ccb3-4e2f-a3ab-b4dd52cba02f/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:16:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:16:27,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-26 02:16:27,338 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:16:27,391 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:16:27,391 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:16:27,399 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:16:27,400 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:16:27,400 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-26 02:16:27,413 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:16:27,413 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:16:27,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:16:27,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [582002906] [2019-11-26 02:16:27,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:16:27,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-26 02:16:27,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209867299] [2019-11-26 02:16:27,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:16:27,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:16:27,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:16:27,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:16:27,439 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 3 states. [2019-11-26 02:16:27,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:16:27,671 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2019-11-26 02:16:27,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:16:27,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-11-26 02:16:27,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:16:27,691 INFO L225 Difference]: With dead ends: 99 [2019-11-26 02:16:27,691 INFO L226 Difference]: Without dead ends: 97 [2019-11-26 02:16:27,692 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:16:27,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-26 02:16:27,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 87. [2019-11-26 02:16:27,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-26 02:16:27,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2019-11-26 02:16:27,740 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 3 [2019-11-26 02:16:27,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:16:27,740 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2019-11-26 02:16:27,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:16:27,740 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2019-11-26 02:16:27,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-26 02:16:27,741 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:16:27,741 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-26 02:16:27,944 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:16:27,945 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-11-26 02:16:27,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:16:27,946 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2019-11-26 02:16:27,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:16:27,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1666473648] [2019-11-26 02:16:27,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7046def2-ccb3-4e2f-a3ab-b4dd52cba02f/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:16:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:16:28,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-26 02:16:28,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:16:28,029 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:16:28,029 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:16:28,034 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:16:28,034 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:16:28,034 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-26 02:16:28,044 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:16:28,044 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:16:28,083 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:16:28,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1666473648] [2019-11-26 02:16:28,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:16:28,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-26 02:16:28,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418407664] [2019-11-26 02:16:28,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:16:28,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:16:28,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:16:28,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:16:28,086 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand 4 states. [2019-11-26 02:16:28,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:16:28,365 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2019-11-26 02:16:28,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:16:28,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-11-26 02:16:28,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:16:28,367 INFO L225 Difference]: With dead ends: 95 [2019-11-26 02:16:28,368 INFO L226 Difference]: Without dead ends: 95 [2019-11-26 02:16:28,368 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:16:28,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-26 02:16:28,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 83. [2019-11-26 02:16:28,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-26 02:16:28,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2019-11-26 02:16:28,380 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 3 [2019-11-26 02:16:28,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:16:28,381 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2019-11-26 02:16:28,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:16:28,381 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2019-11-26 02:16:28,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-26 02:16:28,381 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:16:28,382 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:16:28,583 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:16:28,584 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-11-26 02:16:28,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:16:28,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1803027160, now seen corresponding path program 1 times [2019-11-26 02:16:28,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:16:28,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [338562045] [2019-11-26 02:16:28,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7046def2-ccb3-4e2f-a3ab-b4dd52cba02f/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:16:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:16:28,682 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-26 02:16:28,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:16:28,694 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:16:28,695 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:16:28,697 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:16:28,697 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:16:28,698 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-26 02:16:28,709 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:16:28,709 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:16:28,710 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:16:28,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [338562045] [2019-11-26 02:16:28,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:16:28,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-26 02:16:28,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278283507] [2019-11-26 02:16:28,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:16:28,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:16:28,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:16:28,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:16:28,712 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand 4 states. [2019-11-26 02:16:28,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:16:28,992 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2019-11-26 02:16:28,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:16:28,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-26 02:16:28,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:16:28,994 INFO L225 Difference]: With dead ends: 81 [2019-11-26 02:16:28,994 INFO L226 Difference]: Without dead ends: 81 [2019-11-26 02:16:28,994 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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:16:28,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-26 02:16:28,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2019-11-26 02:16:28,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-26 02:16:29,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2019-11-26 02:16:29,000 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 7 [2019-11-26 02:16:29,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:16:29,000 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2019-11-26 02:16:29,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:16:29,001 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2019-11-26 02:16:29,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-26 02:16:29,001 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:16:29,001 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:16:29,206 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:16:29,206 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-11-26 02:16:29,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:16:29,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1803027161, now seen corresponding path program 1 times [2019-11-26 02:16:29,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:16:29,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [778637211] [2019-11-26 02:16:29,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7046def2-ccb3-4e2f-a3ab-b4dd52cba02f/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:16:29,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:16:29,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-26 02:16:29,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:16:29,309 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:16:29,309 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:16:29,316 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:16:29,316 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:16:29,316 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-26 02:16:29,339 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:16:29,339 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:16:29,436 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:16:29,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [778637211] [2019-11-26 02:16:29,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:16:29,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-26 02:16:29,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668188931] [2019-11-26 02:16:29,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:16:29,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:16:29,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:16:29,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:16:29,438 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 6 states. [2019-11-26 02:16:30,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:16:30,051 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2019-11-26 02:16:30,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 02:16:30,052 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-11-26 02:16:30,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:16:30,053 INFO L225 Difference]: With dead ends: 90 [2019-11-26 02:16:30,054 INFO L226 Difference]: Without dead ends: 90 [2019-11-26 02:16:30,054 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-11-26 02:16:30,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-26 02:16:30,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 75. [2019-11-26 02:16:30,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-26 02:16:30,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2019-11-26 02:16:30,061 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 7 [2019-11-26 02:16:30,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:16:30,061 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2019-11-26 02:16:30,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:16:30,062 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2019-11-26 02:16:30,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-26 02:16:30,062 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:16:30,062 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:16:30,263 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:16:30,263 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-11-26 02:16:30,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:16:30,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1121499220, now seen corresponding path program 1 times [2019-11-26 02:16:30,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:16:30,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [985876805] [2019-11-26 02:16:30,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7046def2-ccb3-4e2f-a3ab-b4dd52cba02f/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:16:30,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:16:30,366 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-26 02:16:30,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:16:30,410 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:16:30,410 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:16:30,411 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:16:30,432 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-26 02:16:30,433 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:16:30,433 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-11-26 02:16:30,455 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-26 02:16:30,455 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:16:30,462 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:16:30,463 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:16:30,463 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2019-11-26 02:16:30,479 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 17 treesize of output 9 [2019-11-26 02:16:30,480 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:16:30,487 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:16:30,487 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:16:30,487 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:7 [2019-11-26 02:16:30,516 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:16:30,516 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:16:30,545 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:16:30,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [985876805] [2019-11-26 02:16:30,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:16:30,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 6 [2019-11-26 02:16:30,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078144998] [2019-11-26 02:16:30,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-26 02:16:30,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:16:30,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-26 02:16:30,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:16:30,547 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 7 states. [2019-11-26 02:16:31,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:16:31,238 INFO L93 Difference]: Finished difference Result 124 states and 134 transitions. [2019-11-26 02:16:31,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 02:16:31,238 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-11-26 02:16:31,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:16:31,240 INFO L225 Difference]: With dead ends: 124 [2019-11-26 02:16:31,240 INFO L226 Difference]: Without dead ends: 124 [2019-11-26 02:16:31,240 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-11-26 02:16:31,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-11-26 02:16:31,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 74. [2019-11-26 02:16:31,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-26 02:16:31,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2019-11-26 02:16:31,247 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 10 [2019-11-26 02:16:31,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:16:31,248 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2019-11-26 02:16:31,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-26 02:16:31,248 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2019-11-26 02:16:31,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-26 02:16:31,248 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:16:31,249 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:16:31,451 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:16:31,451 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-11-26 02:16:31,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:16:31,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1121499221, now seen corresponding path program 1 times [2019-11-26 02:16:31,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:16:31,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [892770909] [2019-11-26 02:16:31,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7046def2-ccb3-4e2f-a3ab-b4dd52cba02f/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:16:31,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:16:31,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-26 02:16:31,538 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:16:31,543 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:16:31,543 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:16:31,548 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:16:31,548 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:16:31,548 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-26 02:16:31,569 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-26 02:16:31,570 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:16:31,579 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:16:31,584 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-26 02:16:31,585 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:16:31,592 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:16:31,593 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:16:31,593 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2019-11-26 02:16:31,616 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:16:31,616 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:16:31,624 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:16:31,627 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:16:31,627 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:16:31,652 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:16:31,652 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:16:31,653 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2019-11-26 02:16:31,678 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:16:31,678 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:16:31,844 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:16:31,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [892770909] [2019-11-26 02:16:31,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:16:31,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-26 02:16:31,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115431996] [2019-11-26 02:16:31,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-26 02:16:31,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:16:31,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-26 02:16:31,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-26 02:16:31,846 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 10 states. [2019-11-26 02:16:33,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:16:33,009 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2019-11-26 02:16:33,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 02:16:33,010 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-11-26 02:16:33,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:16:33,011 INFO L225 Difference]: With dead ends: 115 [2019-11-26 02:16:33,011 INFO L226 Difference]: Without dead ends: 115 [2019-11-26 02:16:33,011 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2019-11-26 02:16:33,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-26 02:16:33,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 63. [2019-11-26 02:16:33,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-26 02:16:33,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2019-11-26 02:16:33,016 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 10 [2019-11-26 02:16:33,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:16:33,016 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2019-11-26 02:16:33,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-26 02:16:33,016 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2019-11-26 02:16:33,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-26 02:16:33,017 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:16:33,017 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:16:33,219 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:16:33,219 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-11-26 02:16:33,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:16:33,219 INFO L82 PathProgramCache]: Analyzing trace with hash -601451934, now seen corresponding path program 1 times [2019-11-26 02:16:33,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:16:33,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [62527631] [2019-11-26 02:16:33,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7046def2-ccb3-4e2f-a3ab-b4dd52cba02f/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:16:33,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:16:33,307 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-26 02:16:33,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:16:33,317 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-26 02:16:33,317 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:16:33,322 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:16:33,322 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:16:33,322 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-26 02:16:33,347 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-26 02:16:33,348 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:16:33,357 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:16:33,362 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-26 02:16:33,362 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:16:33,370 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:16:33,371 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:16:33,371 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:25 [2019-11-26 02:16:33,398 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:16:33,400 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 27 treesize of output 11 [2019-11-26 02:16:33,400 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:16:33,420 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:16:33,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:16:33,426 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 27 treesize of output 11 [2019-11-26 02:16:33,427 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:16:33,435 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:16:33,435 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:16:33,435 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:25 [2019-11-26 02:16:33,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:16:33,469 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 27 treesize of output 11 [2019-11-26 02:16:33,470 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:16:33,486 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:16:33,489 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:16:33,490 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 27 treesize of output 11 [2019-11-26 02:16:33,490 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:16:33,498 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:16:33,498 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:16:33,499 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:25 [2019-11-26 02:16:33,511 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:16:33,511 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:16:33,519 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:16:33,522 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:16:33,522 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:16:33,529 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:16:33,530 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:16:33,530 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:11 [2019-11-26 02:16:33,553 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:16:33,553 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:16:33,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:16:33,720 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:16:33,732 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:16:33,739 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 02:16:33,804 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:16:33,810 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:16:33,823 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:16:33,828 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:16:33,876 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:16:33,877 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-11-26 02:16:33,877 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:163, output treesize:90 [2019-11-26 02:16:34,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:16:34,195 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:16:34,202 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:16:34,208 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 02:16:34,296 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:16:34,302 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:16:34,309 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:16:34,315 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:16:34,343 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:16:34,343 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-11-26 02:16:34,343 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:163, output treesize:65 [2019-11-26 02:16:34,427 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:16:34,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [62527631] [2019-11-26 02:16:34,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:16:34,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2019-11-26 02:16:34,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689653048] [2019-11-26 02:16:34,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-26 02:16:34,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:16:34,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-26 02:16:34,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-11-26 02:16:34,428 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 12 states. [2019-11-26 02:16:36,515 WARN L192 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 56 DAG size of output: 39 [2019-11-26 02:16:37,027 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2019-11-26 02:16:37,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:16:37,602 INFO L93 Difference]: Finished difference Result 139 states and 150 transitions. [2019-11-26 02:16:37,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-26 02:16:37,602 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-11-26 02:16:37,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:16:37,603 INFO L225 Difference]: With dead ends: 139 [2019-11-26 02:16:37,603 INFO L226 Difference]: Without dead ends: 139 [2019-11-26 02:16:37,604 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-11-26 02:16:37,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-11-26 02:16:37,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 72. [2019-11-26 02:16:37,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-26 02:16:37,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2019-11-26 02:16:37,610 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 12 [2019-11-26 02:16:37,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:16:37,611 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2019-11-26 02:16:37,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-26 02:16:37,611 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2019-11-26 02:16:37,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-26 02:16:37,611 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:16:37,612 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:16:37,813 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:16:37,814 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-11-26 02:16:37,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:16:37,814 INFO L82 PathProgramCache]: Analyzing trace with hash -601451935, now seen corresponding path program 1 times [2019-11-26 02:16:37,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:16:37,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [824871262] [2019-11-26 02:16:37,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7046def2-ccb3-4e2f-a3ab-b4dd52cba02f/bin/utaipan/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:16:37,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:16:37,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-26 02:16:37,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:16:37,916 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:16:37,916 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:16:37,920 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:16:37,921 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:16:37,921 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-26 02:16:37,930 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-26 02:16:37,931 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:16:37,937 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:16:37,937 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:16:37,937 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2019-11-26 02:16:37,958 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:16:37,959 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 27 treesize of output 11 [2019-11-26 02:16:37,960 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:16:37,966 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:16:37,966 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:16:37,966 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:16 [2019-11-26 02:16:37,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:16:37,989 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 27 treesize of output 11 [2019-11-26 02:16:37,989 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:16:37,995 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:16:37,995 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:16:37,995 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:16 [2019-11-26 02:16:38,005 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:16:38,006 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:16:38,012 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:16:38,012 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:16:38,013 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:7 [2019-11-26 02:16:38,034 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:16:38,034 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:16:38,065 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:16:38,069 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:16:38,069 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:16:38,069 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:19 [2019-11-26 02:16:40,121 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:16:40,126 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:16:40,126 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:16:40,127 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:23 [2019-11-26 02:16:42,156 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 17 [2019-11-26 02:16:42,159 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:16:42,174 INFO L567 ElimStorePlain]: treesize reduction 21, result has 25.0 percent of original size [2019-11-26 02:16:42,174 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:16:42,176 INFO L567 ElimStorePlain]: treesize reduction 13, result has 7.1 percent of original size [2019-11-26 02:16:42,176 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:16:42,176 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:1 [2019-11-26 02:16:42,177 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:16:42,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [824871262] [2019-11-26 02:16:42,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:16:42,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2019-11-26 02:16:42,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253853963] [2019-11-26 02:16:42,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-26 02:16:42,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:16:42,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-26 02:16:42,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=61, Unknown=2, NotChecked=0, Total=90 [2019-11-26 02:16:42,179 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand 10 states. [2019-11-26 02:16:44,766 WARN L192 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 26 [2019-11-26 02:16:45,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:16:45,190 INFO L93 Difference]: Finished difference Result 116 states and 127 transitions. [2019-11-26 02:16:45,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-26 02:16:45,191 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2019-11-26 02:16:45,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:16:45,192 INFO L225 Difference]: With dead ends: 116 [2019-11-26 02:16:45,192 INFO L226 Difference]: Without dead ends: 116 [2019-11-26 02:16:45,192 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=83, Invalid=155, Unknown=2, NotChecked=0, Total=240 [2019-11-26 02:16:45,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-26 02:16:45,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 72. [2019-11-26 02:16:45,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-26 02:16:45,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2019-11-26 02:16:45,197 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 12 [2019-11-26 02:16:45,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:16:45,197 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2019-11-26 02:16:45,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-26 02:16:45,197 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2019-11-26 02:16:45,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-26 02:16:45,205 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:16:45,205 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:16:45,413 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:16:45,413 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2019-11-26 02:16:45,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:16:45,413 INFO L82 PathProgramCache]: Analyzing trace with hash 749033961, now seen corresponding path program 1 times [2019-11-26 02:16:45,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:16:45,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [272423021] [2019-11-26 02:16:45,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7046def2-ccb3-4e2f-a3ab-b4dd52cba02f/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:16:45,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:16:45,532 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-26 02:16:45,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:16:45,541 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:16:45,541 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:16:45,547 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:16:45,550 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:16:45,550 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:16:45,556 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:16:45,557 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:16:45,557 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-26 02:16:45,569 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-26 02:16:45,569 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:16:45,579 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:16:45,580 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:16:45,580 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2019-11-26 02:16:45,604 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:16:45,605 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 27 treesize of output 11 [2019-11-26 02:16:45,606 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:16:45,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:16:45,615 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:16:45,615 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:23 [2019-11-26 02:16:45,654 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:16:45,656 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 27 treesize of output 11 [2019-11-26 02:16:45,656 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:16:45,668 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:16:45,668 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:16:45,669 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:23 [2019-11-26 02:16:45,677 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 7 treesize of output 3 [2019-11-26 02:16:45,678 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:16:45,692 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:16:45,693 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:16:45,693 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2019-11-26 02:16:45,839 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 16 [2019-11-26 02:16:45,840 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:16:45,928 INFO L567 ElimStorePlain]: treesize reduction 10, result has 81.5 percent of original size [2019-11-26 02:16:45,944 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 02:16:45,949 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:16:45,949 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2019-11-26 02:16:45,950 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:16:45,968 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:16:45,974 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:16:45,974 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:73, output treesize:5 [2019-11-26 02:16:45,995 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:16:45,995 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:16:46,284 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 68 treesize of output 44 [2019-11-26 02:16:46,285 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:16:46,306 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:16:46,307 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:16:46,307 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:68, output treesize:44 [2019-11-26 02:16:46,374 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:16:46,420 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:16:46,421 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:16:46,421 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:64, output treesize:74 [2019-11-26 02:16:55,235 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-26 02:16:55,235 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: incompatible size at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.computeCostEstimation(ArrayIndexBasedCostEstimation.java:152) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.(ArrayIndexBasedCostEstimation.java:64) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:390) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-26 02:16:55,239 INFO L168 Benchmark]: Toolchain (without parser) took 29484.14 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 270.0 MB). Free memory was 939.1 MB in the beginning and 1.2 GB in the end (delta: -275.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:16:55,239 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 961.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:16:55,239 INFO L168 Benchmark]: CACSL2BoogieTranslator took 574.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -199.6 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:16:55,240 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.44 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:16:55,241 INFO L168 Benchmark]: Boogie Preprocessor took 36.96 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:16:55,241 INFO L168 Benchmark]: RCFGBuilder took 709.48 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: 41.8 MB). Peak memory consumption was 41.8 MB. Max. memory is 11.5 GB. [2019-11-26 02:16:55,242 INFO L168 Benchmark]: TraceAbstraction took 28105.53 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 110.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -118.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:16:55,246 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 961.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 574.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.9 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -199.6 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.44 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 36.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 709.48 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: 41.8 MB). Peak memory consumption was 41.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28105.53 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 110.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -118.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: incompatible size de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: incompatible size: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...