./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/heap-data/cart.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_b4fbee5e-09c6-45f8-a0a5-5832ea7c7d1e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b4fbee5e-09c6-45f8-a0a5-5832ea7c7d1e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b4fbee5e-09c6-45f8-a0a5-5832ea7c7d1e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b4fbee5e-09c6-45f8-a0a5-5832ea7c7d1e/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/heap-data/cart.i -s /tmp/vcloud-vcloud-master/worker/run_dir_b4fbee5e-09c6-45f8-a0a5-5832ea7c7d1e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b4fbee5e-09c6-45f8-a0a5-5832ea7c7d1e/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e1105d102f382446f080488a8ecb609878e241e6 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally 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_b4fbee5e-09c6-45f8-a0a5-5832ea7c7d1e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b4fbee5e-09c6-45f8-a0a5-5832ea7c7d1e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b4fbee5e-09c6-45f8-a0a5-5832ea7c7d1e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b4fbee5e-09c6-45f8-a0a5-5832ea7c7d1e/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/heap-data/cart.i -s /tmp/vcloud-vcloud-master/worker/run_dir_b4fbee5e-09c6-45f8-a0a5-5832ea7c7d1e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b4fbee5e-09c6-45f8-a0a5-5832ea7c7d1e/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e1105d102f382446f080488a8ecb609878e241e6 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:57:12,881 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:57:12,883 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:57:12,893 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:57:12,893 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:57:12,894 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:57:12,896 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:57:12,897 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:57:12,899 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:57:12,900 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:57:12,901 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:57:12,902 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:57:12,902 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:57:12,903 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:57:12,904 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:57:12,905 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:57:12,906 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:57:12,907 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:57:12,909 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:57:12,910 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:57:12,912 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:57:12,913 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:57:12,914 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:57:12,915 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:57:12,917 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:57:12,918 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:57:12,918 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:57:12,919 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:57:12,919 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:57:12,920 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:57:12,920 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:57:12,921 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:57:12,922 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:57:12,922 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:57:12,923 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:57:12,924 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:57:12,924 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:57:12,924 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:57:12,925 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:57:12,925 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:57:12,926 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:57:12,927 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b4fbee5e-09c6-45f8-a0a5-5832ea7c7d1e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:57:12,939 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:57:12,939 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:57:12,940 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:57:12,940 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:57:12,940 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:57:12,941 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:57:12,941 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:57:12,941 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:57:12,941 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:57:12,941 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:57:12,942 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:57:12,942 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:57:12,942 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:57:12,942 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:57:12,942 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:57:12,943 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:57:12,943 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:57:12,943 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:57:12,943 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:57:12,944 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:57:12,944 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:57:12,944 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:57:12,944 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:57:12,945 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:57:12,945 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:57:12,945 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:57:12,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:57:12,945 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:57:12,946 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_b4fbee5e-09c6-45f8-a0a5-5832ea7c7d1e/bin/uautomizer 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 ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e1105d102f382446f080488a8ecb609878e241e6 [2019-11-25 08:57:13,073 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:57:13,082 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:57:13,085 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:57:13,086 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:57:13,087 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:57:13,087 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b4fbee5e-09c6-45f8-a0a5-5832ea7c7d1e/bin/uautomizer/../../sv-benchmarks/c/heap-data/cart.i [2019-11-25 08:57:13,134 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b4fbee5e-09c6-45f8-a0a5-5832ea7c7d1e/bin/uautomizer/data/3d198d50d/41be2579c10344109df0471d00f7f0f5/FLAGe45b93f94 [2019-11-25 08:57:13,582 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:57:13,583 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b4fbee5e-09c6-45f8-a0a5-5832ea7c7d1e/sv-benchmarks/c/heap-data/cart.i [2019-11-25 08:57:13,595 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b4fbee5e-09c6-45f8-a0a5-5832ea7c7d1e/bin/uautomizer/data/3d198d50d/41be2579c10344109df0471d00f7f0f5/FLAGe45b93f94 [2019-11-25 08:57:13,607 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b4fbee5e-09c6-45f8-a0a5-5832ea7c7d1e/bin/uautomizer/data/3d198d50d/41be2579c10344109df0471d00f7f0f5 [2019-11-25 08:57:13,609 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:57:13,609 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:57:13,611 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:57:13,611 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:57:13,625 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:57:13,626 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:57:13" (1/1) ... [2019-11-25 08:57:13,628 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1de307c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:13, skipping insertion in model container [2019-11-25 08:57:13,629 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:57:13" (1/1) ... [2019-11-25 08:57:13,635 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:57:13,687 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:57:14,084 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:57:14,095 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:57:14,148 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:57:14,195 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:57:14,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:14 WrapperNode [2019-11-25 08:57:14,196 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:57:14,197 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:57:14,197 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:57:14,197 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:57:14,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:14" (1/1) ... [2019-11-25 08:57:14,217 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:14" (1/1) ... [2019-11-25 08:57:14,235 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:57:14,236 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:57:14,236 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:57:14,236 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:57:14,243 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:14" (1/1) ... [2019-11-25 08:57:14,243 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:14" (1/1) ... [2019-11-25 08:57:14,247 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:14" (1/1) ... [2019-11-25 08:57:14,247 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:14" (1/1) ... [2019-11-25 08:57:14,253 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:14" (1/1) ... [2019-11-25 08:57:14,262 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:14" (1/1) ... [2019-11-25 08:57:14,263 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:14" (1/1) ... [2019-11-25 08:57:14,265 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:57:14,266 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:57:14,266 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:57:14,266 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:57:14,267 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b4fbee5e-09c6-45f8-a0a5-5832ea7c7d1e/bin/uautomizer/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-25 08:57:14,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-25 08:57:14,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 08:57:14,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 08:57:14,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-25 08:57:14,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-25 08:57:14,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:57:14,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:57:14,585 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:57:14,585 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-25 08:57:14,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:57:14 BoogieIcfgContainer [2019-11-25 08:57:14,587 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:57:14,587 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:57:14,588 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:57:14,590 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:57:14,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:57:13" (1/3) ... [2019-11-25 08:57:14,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41693796 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:57:14, skipping insertion in model container [2019-11-25 08:57:14,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:14" (2/3) ... [2019-11-25 08:57:14,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41693796 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:57:14, skipping insertion in model container [2019-11-25 08:57:14,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:57:14" (3/3) ... [2019-11-25 08:57:14,593 INFO L109 eAbstractionObserver]: Analyzing ICFG cart.i [2019-11-25 08:57:14,602 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:57:14,614 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:57:14,624 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:57:14,644 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:57:14,644 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:57:14,644 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:57:14,645 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:57:14,647 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:57:14,647 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:57:14,647 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:57:14,647 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:57:14,662 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-11-25 08:57:14,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-25 08:57:14,669 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:14,670 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:14,670 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:14,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:14,675 INFO L82 PathProgramCache]: Analyzing trace with hash -680841488, now seen corresponding path program 1 times [2019-11-25 08:57:14,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:14,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271159775] [2019-11-25 08:57:14,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:14,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:14,805 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-25 08:57:14,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271159775] [2019-11-25 08:57:14,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:14,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:57:14,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585735877] [2019-11-25 08:57:14,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-25 08:57:14,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:14,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-25 08:57:14,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-25 08:57:14,827 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2019-11-25 08:57:14,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:14,840 INFO L93 Difference]: Finished difference Result 34 states and 49 transitions. [2019-11-25 08:57:14,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-25 08:57:14,841 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-11-25 08:57:14,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:14,849 INFO L225 Difference]: With dead ends: 34 [2019-11-25 08:57:14,849 INFO L226 Difference]: Without dead ends: 17 [2019-11-25 08:57:14,851 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-25 08:57:14,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-25 08:57:14,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-25 08:57:14,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-25 08:57:14,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2019-11-25 08:57:14,885 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 9 [2019-11-25 08:57:14,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:14,885 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-11-25 08:57:14,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-25 08:57:14,885 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2019-11-25 08:57:14,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-25 08:57:14,886 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:14,886 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:14,886 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:14,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:14,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1910225148, now seen corresponding path program 1 times [2019-11-25 08:57:14,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:14,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648948135] [2019-11-25 08:57:14,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:14,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:14,978 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-25 08:57:14,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648948135] [2019-11-25 08:57:14,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:14,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:57:14,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19182776] [2019-11-25 08:57:14,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:57:14,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:14,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:57:14,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:57:14,981 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand 4 states. [2019-11-25 08:57:15,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:15,052 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2019-11-25 08:57:15,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:57:15,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-25 08:57:15,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:15,053 INFO L225 Difference]: With dead ends: 36 [2019-11-25 08:57:15,053 INFO L226 Difference]: Without dead ends: 21 [2019-11-25 08:57:15,054 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-25 08:57:15,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-25 08:57:15,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-25 08:57:15,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-25 08:57:15,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2019-11-25 08:57:15,059 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 12 [2019-11-25 08:57:15,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:15,059 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-11-25 08:57:15,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:57:15,060 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2019-11-25 08:57:15,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-25 08:57:15,060 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:15,061 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:15,061 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:15,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:15,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1849394690, now seen corresponding path program 1 times [2019-11-25 08:57:15,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:15,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161128390] [2019-11-25 08:57:15,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:15,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:15,123 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:15,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161128390] [2019-11-25 08:57:15,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:15,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:57:15,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041769578] [2019-11-25 08:57:15,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:57:15,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:15,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:57:15,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:57:15,125 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand 4 states. [2019-11-25 08:57:15,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:15,181 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2019-11-25 08:57:15,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:57:15,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-25 08:57:15,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:15,182 INFO L225 Difference]: With dead ends: 36 [2019-11-25 08:57:15,182 INFO L226 Difference]: Without dead ends: 30 [2019-11-25 08:57:15,183 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-25 08:57:15,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-25 08:57:15,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2019-11-25 08:57:15,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-25 08:57:15,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2019-11-25 08:57:15,188 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 16 [2019-11-25 08:57:15,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:15,188 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-11-25 08:57:15,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:57:15,189 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2019-11-25 08:57:15,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-25 08:57:15,190 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:15,190 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:15,190 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:15,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:15,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1690179633, now seen corresponding path program 1 times [2019-11-25 08:57:15,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:15,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871924087] [2019-11-25 08:57:15,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:15,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:15,255 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 08:57:15,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871924087] [2019-11-25 08:57:15,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:15,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:57:15,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722432702] [2019-11-25 08:57:15,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:57:15,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:15,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:57:15,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:15,257 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand 3 states. [2019-11-25 08:57:15,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:15,273 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2019-11-25 08:57:15,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:15,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-25 08:57:15,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:15,275 INFO L225 Difference]: With dead ends: 37 [2019-11-25 08:57:15,275 INFO L226 Difference]: Without dead ends: 27 [2019-11-25 08:57:15,275 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-25 08:57:15,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-25 08:57:15,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-25 08:57:15,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-25 08:57:15,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2019-11-25 08:57:15,280 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 20 [2019-11-25 08:57:15,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:15,280 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-11-25 08:57:15,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:57:15,281 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2019-11-25 08:57:15,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-25 08:57:15,281 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:15,281 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:15,282 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:15,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:15,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1795441037, now seen corresponding path program 1 times [2019-11-25 08:57:15,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:15,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260313475] [2019-11-25 08:57:15,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:15,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:15,568 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:15,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260313475] [2019-11-25 08:57:15,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799386750] [2019-11-25 08:57:15,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b4fbee5e-09c6-45f8-a0a5-5832ea7c7d1e/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:57:15,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:15,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-25 08:57:15,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:57:15,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:57:15,782 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 29 treesize of output 22 [2019-11-25 08:57:15,792 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-25 08:57:15,792 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:15,801 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:15,802 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:57:15,811 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:15,812 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-25 08:57:15,812 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:15 [2019-11-25 08:57:15,841 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:15,842 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-11-25 08:57:15,843 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:15,845 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:15,846 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-25 08:57:15,846 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-11-25 08:57:15,849 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:15,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:57:15,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-11-25 08:57:15,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785869848] [2019-11-25 08:57:15,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 08:57:15,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:15,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 08:57:15,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:57:15,851 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 10 states. [2019-11-25 08:57:16,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:16,176 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2019-11-25 08:57:16,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 08:57:16,176 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-25 08:57:16,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:16,177 INFO L225 Difference]: With dead ends: 48 [2019-11-25 08:57:16,178 INFO L226 Difference]: Without dead ends: 46 [2019-11-25 08:57:16,178 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-11-25 08:57:16,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-25 08:57:16,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2019-11-25 08:57:16,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-25 08:57:16,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2019-11-25 08:57:16,187 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 20 [2019-11-25 08:57:16,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:16,188 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2019-11-25 08:57:16,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 08:57:16,188 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2019-11-25 08:57:16,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-25 08:57:16,189 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:16,189 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:16,390 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:57:16,390 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:16,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:16,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1534874359, now seen corresponding path program 1 times [2019-11-25 08:57:16,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:16,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631615268] [2019-11-25 08:57:16,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:16,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:16,530 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 08:57:16,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631615268] [2019-11-25 08:57:16,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39590137] [2019-11-25 08:57:16,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b4fbee5e-09c6-45f8-a0a5-5832ea7c7d1e/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:57:16,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:16,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-25 08:57:16,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:57:16,611 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 19 treesize of output 1 [2019-11-25 08:57:16,611 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:16,616 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:16,616 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:57:16,616 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2019-11-25 08:57:16,625 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-25 08:57:16,626 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:16,633 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:16,636 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-25 08:57:16,637 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:16,648 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:16,649 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-25 08:57:16,649 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2019-11-25 08:57:16,651 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 08:57:16,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:57:16,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-11-25 08:57:16,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578789132] [2019-11-25 08:57:16,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:57:16,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:16,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:57:16,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:57:16,654 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand 7 states. [2019-11-25 08:57:16,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:16,839 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2019-11-25 08:57:16,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:57:16,840 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-11-25 08:57:16,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:16,841 INFO L225 Difference]: With dead ends: 52 [2019-11-25 08:57:16,841 INFO L226 Difference]: Without dead ends: 42 [2019-11-25 08:57:16,841 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-25 08:57:16,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-25 08:57:16,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2019-11-25 08:57:16,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-25 08:57:16,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2019-11-25 08:57:16,847 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 23 [2019-11-25 08:57:16,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:16,847 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2019-11-25 08:57:16,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:57:16,847 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2019-11-25 08:57:16,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-25 08:57:16,848 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:16,848 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:17,053 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:57:17,054 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:17,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:17,054 INFO L82 PathProgramCache]: Analyzing trace with hash 379469720, now seen corresponding path program 2 times [2019-11-25 08:57:17,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:17,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398981123] [2019-11-25 08:57:17,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:17,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:17,193 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:17,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398981123] [2019-11-25 08:57:17,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777405809] [2019-11-25 08:57:17,194 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b4fbee5e-09c6-45f8-a0a5-5832ea7c7d1e/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:57:17,254 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-25 08:57:17,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:57:17,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-25 08:57:17,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:57:17,268 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-25 08:57:17,268 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:17,275 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:17,278 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-25 08:57:17,279 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:17,300 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:17,301 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:57:17,301 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2019-11-25 08:57:17,345 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-25 08:57:17,368 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:17,375 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:57:17,376 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:57:17,377 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:57:17,381 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2019-11-25 08:57:17,382 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:17,403 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:17,409 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:57:17,412 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-25 08:57:17,412 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:17,434 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:17,440 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:57:17,445 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2019-11-25 08:57:17,446 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:17,457 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:17,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:57:17,468 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-25 08:57:17,469 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:17,475 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:17,478 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-25 08:57:17,478 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:17,483 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:17,483 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:57:17,483 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:105, output treesize:7 [2019-11-25 08:57:17,486 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:17,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:57:17,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-11-25 08:57:17,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047786283] [2019-11-25 08:57:17,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 08:57:17,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:17,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 08:57:17,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:57:17,488 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand 8 states. [2019-11-25 08:57:17,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:17,625 INFO L93 Difference]: Finished difference Result 59 states and 78 transitions. [2019-11-25 08:57:17,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:57:17,626 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-11-25 08:57:17,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:17,626 INFO L225 Difference]: With dead ends: 59 [2019-11-25 08:57:17,626 INFO L226 Difference]: Without dead ends: 36 [2019-11-25 08:57:17,627 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:57:17,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-25 08:57:17,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-25 08:57:17,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-25 08:57:17,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2019-11-25 08:57:17,631 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 24 [2019-11-25 08:57:17,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:17,631 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2019-11-25 08:57:17,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 08:57:17,631 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2019-11-25 08:57:17,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-25 08:57:17,632 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:17,632 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:17,836 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:57:17,836 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:17,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:17,837 INFO L82 PathProgramCache]: Analyzing trace with hash -3886178, now seen corresponding path program 3 times [2019-11-25 08:57:17,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:17,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330312895] [2019-11-25 08:57:17,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:17,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:18,088 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:18,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330312895] [2019-11-25 08:57:18,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700039513] [2019-11-25 08:57:18,089 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b4fbee5e-09c6-45f8-a0a5-5832ea7c7d1e/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:57:18,163 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-25 08:57:18,164 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:57:18,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-25 08:57:18,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:57:18,180 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-25 08:57:18,180 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:18,184 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:18,184 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:57:18,185 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 08:57:18,194 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:18,194 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-25 08:57:18,195 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:18,199 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:18,202 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-25 08:57:18,203 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:18,206 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:18,207 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:57:18,207 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:8 [2019-11-25 08:57:18,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:57:18,287 INFO L392 ElimStorePlain]: Different costs {1=[|v_#memory_int_11|], 2=[|v_#memory_$Pointer$.base_17|, |#memory_$Pointer$.base|, |v_#memory_$Pointer$.base_16|]} [2019-11-25 08:57:18,292 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 39 treesize of output 32 [2019-11-25 08:57:18,296 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:57:18,299 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:57:18,302 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:57:18,304 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2019-11-25 08:57:18,304 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:18,309 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:18,310 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:57:18,327 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:18,332 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:57:18,334 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 28 treesize of output 12 [2019-11-25 08:57:18,335 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:18,351 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:18,354 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-25 08:57:18,366 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:18,370 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 21 treesize of output 17 [2019-11-25 08:57:18,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:57:18,375 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:57:18,377 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2019-11-25 08:57:18,377 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:18,379 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:18,379 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:57:18,386 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:18,386 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:57:18,386 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:92, output treesize:20 [2019-11-25 08:57:18,418 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2019-11-25 08:57:18,448 INFO L343 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2019-11-25 08:57:18,448 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 57 [2019-11-25 08:57:18,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:57:18,452 INFO L392 ElimStorePlain]: Different costs {0=[v_arrayElimArr_2], 1=[v_arrayElimArr_1]} [2019-11-25 08:57:18,654 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:57:18,655 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) 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.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) 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-25 08:57:18,658 INFO L168 Benchmark]: Toolchain (without parser) took 5048.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 940.7 MB in the beginning and 1.0 GB in the end (delta: -69.0 MB). Peak memory consumption was 90.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:57:18,658 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:57:18,659 INFO L168 Benchmark]: CACSL2BoogieTranslator took 585.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -201.5 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2019-11-25 08:57:18,659 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:57:18,659 INFO L168 Benchmark]: Boogie Preprocessor took 29.91 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-25 08:57:18,660 INFO L168 Benchmark]: RCFGBuilder took 321.01 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:57:18,660 INFO L168 Benchmark]: TraceAbstraction took 4069.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 104.7 MB). Peak memory consumption was 104.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:57:18,663 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 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 585.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -201.5 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.91 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 321.01 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4069.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 104.7 MB). Peak memory consumption was 104.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-6b5699a [2019-11-25 08:57:20,422 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:57:20,424 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:57:20,434 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:57:20,435 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:57:20,436 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:57:20,437 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:57:20,439 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:57:20,441 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:57:20,442 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:57:20,443 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:57:20,444 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:57:20,444 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:57:20,445 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:57:20,446 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:57:20,447 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:57:20,448 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:57:20,448 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:57:20,450 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:57:20,454 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:57:20,455 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:57:20,456 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:57:20,457 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:57:20,458 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:57:20,461 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:57:20,461 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:57:20,461 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:57:20,462 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:57:20,463 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:57:20,464 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:57:20,464 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:57:20,465 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:57:20,465 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:57:20,466 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:57:20,467 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:57:20,467 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:57:20,468 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:57:20,468 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:57:20,468 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:57:20,469 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:57:20,470 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:57:20,471 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b4fbee5e-09c6-45f8-a0a5-5832ea7c7d1e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-25 08:57:20,484 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:57:20,484 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:57:20,485 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:57:20,486 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:57:20,486 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:57:20,486 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:57:20,487 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:57:20,487 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:57:20,487 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:57:20,487 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:57:20,487 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:57:20,488 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:57:20,488 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 08:57:20,488 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-25 08:57:20,488 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-25 08:57:20,489 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:57:20,489 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:57:20,489 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:57:20,489 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:57:20,490 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:57:20,490 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:57:20,490 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:57:20,490 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:57:20,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:57:20,491 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:57:20,491 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:57:20,491 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:57:20,492 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-25 08:57:20,492 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-25 08:57:20,492 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:57:20,492 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-25 08:57:20,493 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_b4fbee5e-09c6-45f8-a0a5-5832ea7c7d1e/bin/uautomizer 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 ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e1105d102f382446f080488a8ecb609878e241e6 [2019-11-25 08:57:20,878 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:57:20,888 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:57:20,890 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:57:20,892 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:57:20,892 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:57:20,893 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b4fbee5e-09c6-45f8-a0a5-5832ea7c7d1e/bin/uautomizer/../../sv-benchmarks/c/heap-data/cart.i [2019-11-25 08:57:20,940 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b4fbee5e-09c6-45f8-a0a5-5832ea7c7d1e/bin/uautomizer/data/4e7dbc95b/f62c7f8720a24ab897fc04a680e4321f/FLAGca034f569 [2019-11-25 08:57:21,452 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:57:21,455 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b4fbee5e-09c6-45f8-a0a5-5832ea7c7d1e/sv-benchmarks/c/heap-data/cart.i [2019-11-25 08:57:21,467 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b4fbee5e-09c6-45f8-a0a5-5832ea7c7d1e/bin/uautomizer/data/4e7dbc95b/f62c7f8720a24ab897fc04a680e4321f/FLAGca034f569 [2019-11-25 08:57:21,911 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b4fbee5e-09c6-45f8-a0a5-5832ea7c7d1e/bin/uautomizer/data/4e7dbc95b/f62c7f8720a24ab897fc04a680e4321f [2019-11-25 08:57:21,914 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:57:21,915 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:57:21,916 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:57:21,916 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:57:21,921 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:57:21,922 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:57:21" (1/1) ... [2019-11-25 08:57:21,924 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b89da41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:21, skipping insertion in model container [2019-11-25 08:57:21,925 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:57:21" (1/1) ... [2019-11-25 08:57:21,931 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:57:21,983 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:57:22,407 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:57:22,432 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:57:22,502 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:57:22,565 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:57:22,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:22 WrapperNode [2019-11-25 08:57:22,566 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:57:22,566 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:57:22,566 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:57:22,568 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:57:22,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:22" (1/1) ... [2019-11-25 08:57:22,612 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:22" (1/1) ... [2019-11-25 08:57:22,637 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:57:22,638 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:57:22,638 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:57:22,638 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:57:22,647 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:22" (1/1) ... [2019-11-25 08:57:22,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:22" (1/1) ... [2019-11-25 08:57:22,656 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:22" (1/1) ... [2019-11-25 08:57:22,657 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:22" (1/1) ... [2019-11-25 08:57:22,666 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:22" (1/1) ... [2019-11-25 08:57:22,671 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:22" (1/1) ... [2019-11-25 08:57:22,677 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:22" (1/1) ... [2019-11-25 08:57:22,684 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:57:22,684 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:57:22,685 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:57:22,685 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:57:22,686 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b4fbee5e-09c6-45f8-a0a5-5832ea7c7d1e/bin/uautomizer/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-25 08:57:22,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-25 08:57:22,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 08:57:22,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-25 08:57:22,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-25 08:57:22,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-25 08:57:22,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:57:22,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:57:23,058 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:57:23,058 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-25 08:57:23,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:57:23 BoogieIcfgContainer [2019-11-25 08:57:23,059 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:57:23,060 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:57:23,060 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:57:23,063 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:57:23,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:57:21" (1/3) ... [2019-11-25 08:57:23,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e56e0b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:57:23, skipping insertion in model container [2019-11-25 08:57:23,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:22" (2/3) ... [2019-11-25 08:57:23,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e56e0b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:57:23, skipping insertion in model container [2019-11-25 08:57:23,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:57:23" (3/3) ... [2019-11-25 08:57:23,070 INFO L109 eAbstractionObserver]: Analyzing ICFG cart.i [2019-11-25 08:57:23,079 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:57:23,086 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:57:23,095 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:57:23,112 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:57:23,112 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:57:23,112 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:57:23,112 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:57:23,112 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:57:23,112 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:57:23,113 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:57:23,113 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:57:23,123 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-11-25 08:57:23,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-25 08:57:23,127 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:23,127 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:23,128 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:23,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:23,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1597928625, now seen corresponding path program 1 times [2019-11-25 08:57:23,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:57:23,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [607279042] [2019-11-25 08:57:23,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b4fbee5e-09c6-45f8-a0a5-5832ea7c7d1e/bin/uautomizer/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-25 08:57:23,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:23,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-25 08:57:23,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:57:23,242 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-25 08:57:23,242 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:57:23,245 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-25 08:57:23,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [607279042] [2019-11-25 08:57:23,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:23,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-25 08:57:23,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838353414] [2019-11-25 08:57:23,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-25 08:57:23,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:57:23,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-25 08:57:23,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-25 08:57:23,265 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-11-25 08:57:23,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:23,277 INFO L93 Difference]: Finished difference Result 33 states and 48 transitions. [2019-11-25 08:57:23,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-25 08:57:23,278 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-11-25 08:57:23,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:23,286 INFO L225 Difference]: With dead ends: 33 [2019-11-25 08:57:23,286 INFO L226 Difference]: Without dead ends: 16 [2019-11-25 08:57:23,289 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-25 08:57:23,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-11-25 08:57:23,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-25 08:57:23,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-25 08:57:23,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2019-11-25 08:57:23,319 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 21 transitions. Word has length 9 [2019-11-25 08:57:23,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:23,319 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-11-25 08:57:23,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-25 08:57:23,320 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2019-11-25 08:57:23,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-25 08:57:23,320 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:23,321 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:23,522 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:57:23,523 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:23,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:23,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1565257307, now seen corresponding path program 1 times [2019-11-25 08:57:23,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:57:23,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1021340483] [2019-11-25 08:57:23,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b4fbee5e-09c6-45f8-a0a5-5832ea7c7d1e/bin/uautomizer/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-25 08:57:23,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:23,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 08:57:23,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:57:23,664 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-25 08:57:23,664 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:57:23,672 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-25 08:57:23,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1021340483] [2019-11-25 08:57:23,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:23,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-25 08:57:23,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590643256] [2019-11-25 08:57:23,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:57:23,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:57:23,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:57:23,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:57:23,678 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. Second operand 4 states. [2019-11-25 08:57:23,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:23,898 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2019-11-25 08:57:23,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:57:23,898 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-25 08:57:23,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:23,899 INFO L225 Difference]: With dead ends: 34 [2019-11-25 08:57:23,899 INFO L226 Difference]: Without dead ends: 19 [2019-11-25 08:57:23,900 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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-25 08:57:23,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-11-25 08:57:23,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-11-25 08:57:23,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-25 08:57:23,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2019-11-25 08:57:23,905 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 11 [2019-11-25 08:57:23,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:23,905 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-11-25 08:57:23,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:57:23,906 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2019-11-25 08:57:23,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-25 08:57:23,907 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:23,907 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:24,111 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:57:24,111 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:24,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:24,112 INFO L82 PathProgramCache]: Analyzing trace with hash 2088599158, now seen corresponding path program 1 times [2019-11-25 08:57:24,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:57:24,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [267134409] [2019-11-25 08:57:24,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b4fbee5e-09c6-45f8-a0a5-5832ea7c7d1e/bin/uautomizer/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-25 08:57:24,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:24,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 08:57:24,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:57:24,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:24,216 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:57:24,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:24,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [267134409] [2019-11-25 08:57:24,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:24,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-25 08:57:24,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445577708] [2019-11-25 08:57:24,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:57:24,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:57:24,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:57:24,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:57:24,229 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand 4 states. [2019-11-25 08:57:24,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:24,405 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2019-11-25 08:57:24,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:57:24,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-25 08:57:24,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:24,407 INFO L225 Difference]: With dead ends: 34 [2019-11-25 08:57:24,407 INFO L226 Difference]: Without dead ends: 28 [2019-11-25 08:57:24,408 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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-25 08:57:24,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-25 08:57:24,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2019-11-25 08:57:24,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-25 08:57:24,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2019-11-25 08:57:24,413 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 14 [2019-11-25 08:57:24,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:24,414 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-11-25 08:57:24,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:57:24,414 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2019-11-25 08:57:24,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-25 08:57:24,415 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:24,415 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:24,615 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:57:24,616 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:24,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:24,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1311378947, now seen corresponding path program 1 times [2019-11-25 08:57:24,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:57:24,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [281491511] [2019-11-25 08:57:24,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b4fbee5e-09c6-45f8-a0a5-5832ea7c7d1e/bin/uautomizer/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-25 08:57:24,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:24,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:57:24,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:57:24,700 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-25 08:57:24,701 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:57:24,703 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-25 08:57:24,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [281491511] [2019-11-25 08:57:24,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:24,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-25 08:57:24,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416911209] [2019-11-25 08:57:24,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:57:24,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:57:24,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:57:24,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:24,705 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand 3 states. [2019-11-25 08:57:24,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:24,739 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2019-11-25 08:57:24,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:24,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-25 08:57:24,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:24,743 INFO L225 Difference]: With dead ends: 35 [2019-11-25 08:57:24,743 INFO L226 Difference]: Without dead ends: 25 [2019-11-25 08:57:24,744 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 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-25 08:57:24,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-25 08:57:24,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-11-25 08:57:24,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-25 08:57:24,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2019-11-25 08:57:24,750 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 18 [2019-11-25 08:57:24,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:24,750 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-11-25 08:57:24,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:57:24,750 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2019-11-25 08:57:24,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-25 08:57:24,751 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:24,752 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:24,959 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:57:24,959 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:24,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:24,960 INFO L82 PathProgramCache]: Analyzing trace with hash 502032321, now seen corresponding path program 1 times [2019-11-25 08:57:24,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:57:24,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1488906142] [2019-11-25 08:57:24,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b4fbee5e-09c6-45f8-a0a5-5832ea7c7d1e/bin/uautomizer/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-25 08:57:25,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:25,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-25 08:57:25,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:57:25,174 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:57:25,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:57:25,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:57:25,181 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2019-11-25 08:57:25,182 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:25,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:25,203 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-25 08:57:25,203 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:13 [2019-11-25 08:57:25,405 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 49 treesize of output 40 [2019-11-25 08:57:25,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:57:25,418 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:57:25,429 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:57:25,432 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2019-11-25 08:57:25,433 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:25,449 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:25,450 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:57:25,475 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:25,476 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-25 08:57:25,476 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:30 [2019-11-25 08:57:25,574 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:25,574 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2019-11-25 08:57:25,575 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:25,587 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:25,588 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-25 08:57:25,588 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:9 [2019-11-25 08:57:25,634 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:25,634 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:57:25,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:57:25,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:57:26,148 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-25 08:57:26,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1488906142] [2019-11-25 08:57:26,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:57:26,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-11-25 08:57:26,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240110675] [2019-11-25 08:57:26,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-25 08:57:26,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:57:26,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-25 08:57:26,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-11-25 08:57:26,151 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand 15 states. [2019-11-25 08:57:27,096 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-11-25 08:57:27,358 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2019-11-25 08:57:28,060 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-25 08:57:28,488 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2019-11-25 08:57:29,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:29,322 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2019-11-25 08:57:29,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-25 08:57:29,323 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-11-25 08:57:29,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:29,324 INFO L225 Difference]: With dead ends: 49 [2019-11-25 08:57:29,324 INFO L226 Difference]: Without dead ends: 47 [2019-11-25 08:57:29,325 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=191, Invalid=511, Unknown=0, NotChecked=0, Total=702 [2019-11-25 08:57:29,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-25 08:57:29,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 33. [2019-11-25 08:57:29,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-25 08:57:29,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2019-11-25 08:57:29,334 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 18 [2019-11-25 08:57:29,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:29,334 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2019-11-25 08:57:29,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-25 08:57:29,335 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2019-11-25 08:57:29,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-25 08:57:29,337 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:29,337 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:29,545 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:57:29,545 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:29,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:29,546 INFO L82 PathProgramCache]: Analyzing trace with hash 972646004, now seen corresponding path program 1 times [2019-11-25 08:57:29,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:57:29,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2071851286] [2019-11-25 08:57:29,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b4fbee5e-09c6-45f8-a0a5-5832ea7c7d1e/bin/uautomizer/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-25 08:57:29,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:29,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-25 08:57:29,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:57:29,721 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 19 treesize of output 1 [2019-11-25 08:57:29,721 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:29,742 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:29,747 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 19 treesize of output 1 [2019-11-25 08:57:29,747 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:29,757 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:29,757 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:57:29,758 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:18 [2019-11-25 08:57:29,815 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-25 08:57:29,816 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:29,824 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:29,831 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-25 08:57:29,831 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:29,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:29,837 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-25 08:57:29,837 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-11-25 08:57:29,852 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:29,853 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:57:29,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:57:29,923 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_15|, |v_#memory_$Pointer$.base_15|], 6=[|v_#memory_$Pointer$.base_16|, |v_#memory_$Pointer$.offset_16|]} [2019-11-25 08:57:29,936 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 64 treesize of output 44 [2019-11-25 08:57:29,936 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:29,945 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 64 treesize of output 44 [2019-11-25 08:57:29,945 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:29,980 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:29,994 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 44 treesize of output 24 [2019-11-25 08:57:29,995 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:30,000 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 44 treesize of output 24 [2019-11-25 08:57:30,000 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:30,036 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:30,060 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:30,061 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 27 [2019-11-25 08:57:30,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 08:57:30,062 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:30,066 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-25 08:57:30,066 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:30,075 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:30,078 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 8 treesize of output 4 [2019-11-25 08:57:30,078 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:30,084 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:30,084 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-25 08:57:30,084 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:129, output treesize:7 [2019-11-25 08:57:30,101 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-25 08:57:30,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2071851286] [2019-11-25 08:57:30,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:57:30,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2019-11-25 08:57:30,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181429036] [2019-11-25 08:57:30,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-25 08:57:30,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:57:30,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-25 08:57:30,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-25 08:57:30,103 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 12 states. [2019-11-25 08:57:30,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:30,828 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2019-11-25 08:57:30,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 08:57:30,829 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-11-25 08:57:30,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:30,830 INFO L225 Difference]: With dead ends: 57 [2019-11-25 08:57:30,830 INFO L226 Difference]: Without dead ends: 47 [2019-11-25 08:57:30,830 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2019-11-25 08:57:30,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-25 08:57:30,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2019-11-25 08:57:30,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-25 08:57:30,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2019-11-25 08:57:30,837 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 21 [2019-11-25 08:57:30,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:30,838 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2019-11-25 08:57:30,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-25 08:57:30,838 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2019-11-25 08:57:30,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-25 08:57:30,839 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:30,839 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:31,039 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:57:31,040 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:31,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:31,040 INFO L82 PathProgramCache]: Analyzing trace with hash 803189644, now seen corresponding path program 2 times [2019-11-25 08:57:31,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:57:31,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [146112529] [2019-11-25 08:57:31,041 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b4fbee5e-09c6-45f8-a0a5-5832ea7c7d1e/bin/uautomizer/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-25 08:57:31,198 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-25 08:57:31,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:57:31,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-25 08:57:31,202 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:57:31,212 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-25 08:57:31,213 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:31,229 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:31,232 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-25 08:57:31,233 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:31,240 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:31,240 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:57:31,240 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-11-25 08:57:31,283 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-25 08:57:31,371 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:31,384 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:57:31,389 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-25 08:57:31,390 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:31,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:31,434 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:57:31,451 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:31,455 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 20 treesize of output 16 [2019-11-25 08:57:31,458 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:57:31,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:57:31,464 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-25 08:57:31,464 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:31,466 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:31,466 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:57:31,492 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:31,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:57:31,509 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-25 08:57:31,509 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:31,517 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:31,520 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 20 treesize of output 16 [2019-11-25 08:57:31,522 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:57:31,524 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:57:31,527 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-25 08:57:31,527 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:31,529 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:31,529 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:57:31,535 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:31,535 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:57:31,536 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:108, output treesize:10 [2019-11-25 08:57:31,549 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:31,549 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 08:57:31,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:57:31,574 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:31,582 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-25 08:57:31,673 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:31,679 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:57:31,686 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:31,730 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:31,734 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-25 08:57:31,739 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:31,771 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:31,774 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:57:31,779 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:31,793 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:31,794 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-11-25 08:57:31,794 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:177, output treesize:35 [2019-11-25 08:57:31,844 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2019-11-25 08:57:31,848 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:31,849 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:31,850 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:57:31,854 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:31,856 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2019-11-25 08:57:31,858 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:31,860 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:31,860 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:57:31,864 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:31,864 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-25 08:57:31,864 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:33, output treesize:7 [2019-11-25 08:57:31,866 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:31,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [146112529] [2019-11-25 08:57:31,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:57:31,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-11-25 08:57:31,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682923148] [2019-11-25 08:57:31,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-25 08:57:31,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 08:57:31,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-25 08:57:31,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-25 08:57:31,868 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand 9 states. [2019-11-25 08:57:32,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:32,334 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2019-11-25 08:57:32,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 08:57:32,335 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-11-25 08:57:32,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:32,335 INFO L225 Difference]: With dead ends: 64 [2019-11-25 08:57:32,335 INFO L226 Difference]: Without dead ends: 37 [2019-11-25 08:57:32,336 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-25 08:57:32,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-25 08:57:32,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-11-25 08:57:32,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-25 08:57:32,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2019-11-25 08:57:32,341 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 22 [2019-11-25 08:57:32,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:32,342 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2019-11-25 08:57:32,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-25 08:57:32,342 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2019-11-25 08:57:32,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-25 08:57:32,343 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:32,343 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:32,546 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:57:32,546 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:32,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:32,546 INFO L82 PathProgramCache]: Analyzing trace with hash 349213841, now seen corresponding path program 3 times [2019-11-25 08:57:32,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 08:57:32,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1819344903] [2019-11-25 08:57:32,547 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b4fbee5e-09c6-45f8-a0a5-5832ea7c7d1e/bin/uautomizer/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-25 08:57:32,754 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-25 08:57:32,755 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:57:32,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-25 08:57:32,760 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:57:32,763 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-25 08:57:32,764 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:32,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:32,766 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:57:32,766 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 08:57:32,799 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:32,799 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-25 08:57:32,800 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:32,832 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:32,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:57:32,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:57:32,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:57:32,841 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2019-11-25 08:57:32,841 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:32,856 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:32,860 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-25 08:57:32,860 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:32,873 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:32,873 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:57:32,874 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:52, output treesize:21 [2019-11-25 08:57:32,994 INFO L392 ElimStorePlain]: Different costs {1=[|v_#memory_int_20|], 2=[|#memory_$Pointer$.base|, |v_#memory_$Pointer$.base_24|, |v_#memory_$Pointer$.base_25|]} [2019-11-25 08:57:33,007 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 49 treesize of output 40 [2019-11-25 08:57:33,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:57:33,026 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:57:33,038 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:57:33,042 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2019-11-25 08:57:33,042 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:33,062 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:33,062 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:57:33,121 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:33,124 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 08:57:33,166 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:33,170 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-25 08:57:33,194 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:33,198 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 26 treesize of output 22 [2019-11-25 08:57:33,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:57:33,201 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:57:33,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:57:33,211 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 08:57:33,214 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2019-11-25 08:57:33,214 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-25 08:57:33,216 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:33,216 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:57:33,230 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:57:33,231 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:57:33,231 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:109, output treesize:34 [2019-11-25 08:57:33,262 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2019-11-25 08:57:33,290 INFO L343 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2019-11-25 08:57:33,290 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 57 [2019-11-25 08:57:33,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 08:57:33,295 INFO L392 ElimStorePlain]: Different costs {0=[v_arrayElimArr_1], 1=[v_arrayElimArr_2]} [2019-11-25 08:57:33,498 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-25 08:57:33,499 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) 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-25 08:57:33,503 INFO L168 Benchmark]: Toolchain (without parser) took 11587.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 209.7 MB). Free memory was 956.4 MB in the beginning and 931.8 MB in the end (delta: 24.6 MB). Peak memory consumption was 234.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:57:33,503 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:57:33,503 INFO L168 Benchmark]: CACSL2BoogieTranslator took 649.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -183.6 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2019-11-25 08:57:33,504 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:57:33,504 INFO L168 Benchmark]: Boogie Preprocessor took 46.32 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-25 08:57:33,504 INFO L168 Benchmark]: RCFGBuilder took 375.02 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: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:57:33,505 INFO L168 Benchmark]: TraceAbstraction took 10441.22 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.5 MB). Free memory was 1.1 GB in the beginning and 931.8 MB in the end (delta: 177.6 MB). Peak memory consumption was 231.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:57:33,507 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 649.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -183.6 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 71.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.32 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 375.02 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: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10441.22 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.5 MB). Free memory was 1.1 GB in the beginning and 931.8 MB in the end (delta: 177.6 MB). Peak memory consumption was 231.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...