./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-tiling/mbpr2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_25b586a6-d536-4739-9b61-b00c668aa0b7/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_25b586a6-d536-4739-9b61-b00c668aa0b7/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_25b586a6-d536-4739-9b61-b00c668aa0b7/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_25b586a6-d536-4739-9b61-b00c668aa0b7/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/array-tiling/mbpr2.c -s /tmp/vcloud-vcloud-master/worker/working_dir_25b586a6-d536-4739-9b61-b00c668aa0b7/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_25b586a6-d536-4739-9b61-b00c668aa0b7/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b6961d3ae59e069e59ed9be8398063e9b96e7ae1 ................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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/working_dir_25b586a6-d536-4739-9b61-b00c668aa0b7/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_25b586a6-d536-4739-9b61-b00c668aa0b7/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_25b586a6-d536-4739-9b61-b00c668aa0b7/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_25b586a6-d536-4739-9b61-b00c668aa0b7/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/array-tiling/mbpr2.c -s /tmp/vcloud-vcloud-master/worker/working_dir_25b586a6-d536-4739-9b61-b00c668aa0b7/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_25b586a6-d536-4739-9b61-b00c668aa0b7/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b6961d3ae59e069e59ed9be8398063e9b96e7ae1 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalStateException: Do not try to interpolate when trace is feasible --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:23:44,164 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:23:44,166 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:23:44,178 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:23:44,178 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:23:44,179 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:23:44,180 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:23:44,182 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:23:44,183 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:23:44,185 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:23:44,186 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:23:44,187 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:23:44,188 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:23:44,188 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:23:44,189 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:23:44,190 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:23:44,191 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:23:44,192 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:23:44,193 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:23:44,195 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:23:44,197 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:23:44,198 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:23:44,199 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:23:44,200 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:23:44,203 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:23:44,203 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:23:44,203 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:23:44,204 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:23:44,204 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:23:44,205 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:23:44,206 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:23:44,207 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:23:44,208 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:23:44,209 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:23:44,210 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:23:44,210 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:23:44,211 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:23:44,211 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:23:44,211 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:23:44,213 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:23:44,213 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:23:44,214 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_25b586a6-d536-4739-9b61-b00c668aa0b7/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:23:44,227 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:23:44,228 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:23:44,228 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:23:44,229 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:23:44,229 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:23:44,229 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:23:44,229 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:23:44,229 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:23:44,229 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:23:44,230 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:23:44,230 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:23:44,230 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:23:44,231 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:23:44,231 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:23:44,231 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:23:44,232 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:23:44,232 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:23:44,232 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:23:44,232 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:23:44,232 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:23:44,232 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:23:44,233 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:23:44,233 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:23:44,233 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:23:44,233 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:23:44,233 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:23:44,233 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:23:44,234 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:23:44,234 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:23:44,234 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:23:44,235 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:23:44,235 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:23:44,235 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:23:44,235 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:23:44,235 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:23:44,235 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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/working_dir_25b586a6-d536-4739-9b61-b00c668aa0b7/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b6961d3ae59e069e59ed9be8398063e9b96e7ae1 [2019-10-22 11:23:44,261 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:23:44,273 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:23:44,277 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:23:44,280 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:23:44,281 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:23:44,281 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_25b586a6-d536-4739-9b61-b00c668aa0b7/bin/utaipan/../../sv-benchmarks/c/array-tiling/mbpr2.c [2019-10-22 11:23:44,332 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_25b586a6-d536-4739-9b61-b00c668aa0b7/bin/utaipan/data/ce1248790/fdad12cdf4bf4f61bfb094140023eabc/FLAGdd7d5ad26 [2019-10-22 11:23:44,727 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:23:44,728 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_25b586a6-d536-4739-9b61-b00c668aa0b7/sv-benchmarks/c/array-tiling/mbpr2.c [2019-10-22 11:23:44,734 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_25b586a6-d536-4739-9b61-b00c668aa0b7/bin/utaipan/data/ce1248790/fdad12cdf4bf4f61bfb094140023eabc/FLAGdd7d5ad26 [2019-10-22 11:23:44,746 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_25b586a6-d536-4739-9b61-b00c668aa0b7/bin/utaipan/data/ce1248790/fdad12cdf4bf4f61bfb094140023eabc [2019-10-22 11:23:44,748 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:23:44,749 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:23:44,750 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:23:44,751 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:23:44,754 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:23:44,755 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:23:44" (1/1) ... [2019-10-22 11:23:44,758 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@446b27e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:44, skipping insertion in model container [2019-10-22 11:23:44,758 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:23:44" (1/1) ... [2019-10-22 11:23:44,766 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:23:44,783 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:23:45,008 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:23:45,012 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:23:45,032 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:23:45,052 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:23:45,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:45 WrapperNode [2019-10-22 11:23:45,052 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:23:45,053 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:23:45,053 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:23:45,054 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:23:45,062 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:45" (1/1) ... [2019-10-22 11:23:45,071 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:45" (1/1) ... [2019-10-22 11:23:45,092 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:23:45,093 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:23:45,093 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:23:45,093 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:23:45,102 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:45" (1/1) ... [2019-10-22 11:23:45,103 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:45" (1/1) ... [2019-10-22 11:23:45,104 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:45" (1/1) ... [2019-10-22 11:23:45,104 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:45" (1/1) ... [2019-10-22 11:23:45,110 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:45" (1/1) ... [2019-10-22 11:23:45,114 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:45" (1/1) ... [2019-10-22 11:23:45,116 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:45" (1/1) ... [2019-10-22 11:23:45,117 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:23:45,118 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:23:45,118 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:23:45,118 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:23:45,119 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25b586a6-d536-4739-9b61-b00c668aa0b7/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:23:45,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 11:23:45,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:23:45,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:23:45,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 11:23:45,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:23:45,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:23:45,488 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:23:45,489 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-10-22 11:23:45,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:23:45 BoogieIcfgContainer [2019-10-22 11:23:45,490 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:23:45,491 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:23:45,491 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:23:45,494 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:23:45,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:23:44" (1/3) ... [2019-10-22 11:23:45,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cc16c63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:23:45, skipping insertion in model container [2019-10-22 11:23:45,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:45" (2/3) ... [2019-10-22 11:23:45,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cc16c63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:23:45, skipping insertion in model container [2019-10-22 11:23:45,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:23:45" (3/3) ... [2019-10-22 11:23:45,499 INFO L109 eAbstractionObserver]: Analyzing ICFG mbpr2.c [2019-10-22 11:23:45,508 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:23:45,516 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 11:23:45,531 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 11:23:45,559 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:23:45,559 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:23:45,559 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:23:45,559 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:23:45,560 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:23:45,560 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:23:45,560 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:23:45,560 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:23:45,575 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-10-22 11:23:45,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 11:23:45,582 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:45,583 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:45,585 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:45,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:45,591 INFO L82 PathProgramCache]: Analyzing trace with hash -297663993, now seen corresponding path program 1 times [2019-10-22 11:23:45,600 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:45,600 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841333217] [2019-10-22 11:23:45,601 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:45,601 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:45,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:45,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:45,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:45,742 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841333217] [2019-10-22 11:23:45,743 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:45,744 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:23:45,744 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580727573] [2019-10-22 11:23:45,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:23:45,750 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:45,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:23:45,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:23:45,768 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2019-10-22 11:23:45,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:45,786 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2019-10-22 11:23:45,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:23:45,788 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-10-22 11:23:45,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:45,798 INFO L225 Difference]: With dead ends: 46 [2019-10-22 11:23:45,798 INFO L226 Difference]: Without dead ends: 22 [2019-10-22 11:23:45,801 INFO L600 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-10-22 11:23:45,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-22 11:23:45,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-22 11:23:45,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-22 11:23:45,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2019-10-22 11:23:45,839 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 13 [2019-10-22 11:23:45,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:45,839 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-10-22 11:23:45,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:23:45,839 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2019-10-22 11:23:45,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 11:23:45,840 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:45,840 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:45,840 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:45,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:45,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1049690042, now seen corresponding path program 1 times [2019-10-22 11:23:45,841 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:45,841 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113530489] [2019-10-22 11:23:45,841 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:45,841 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:45,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:45,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:45,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:45,932 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113530489] [2019-10-22 11:23:45,933 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:45,933 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:23:45,933 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269732817] [2019-10-22 11:23:45,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:23:45,935 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:45,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:23:45,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:23:45,935 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand 4 states. [2019-10-22 11:23:46,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:46,018 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2019-10-22 11:23:46,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:23:46,018 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-22 11:23:46,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:46,019 INFO L225 Difference]: With dead ends: 44 [2019-10-22 11:23:46,019 INFO L226 Difference]: Without dead ends: 30 [2019-10-22 11:23:46,020 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:23:46,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-22 11:23:46,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-10-22 11:23:46,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-22 11:23:46,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2019-10-22 11:23:46,025 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 13 [2019-10-22 11:23:46,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:46,025 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2019-10-22 11:23:46,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:23:46,026 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2019-10-22 11:23:46,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 11:23:46,026 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:46,027 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:46,027 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:46,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:46,027 INFO L82 PathProgramCache]: Analyzing trace with hash -2028678864, now seen corresponding path program 1 times [2019-10-22 11:23:46,027 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:46,028 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464360597] [2019-10-22 11:23:46,028 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:46,028 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:46,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:46,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:46,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 11:23:46,128 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464360597] [2019-10-22 11:23:46,128 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:46,128 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:23:46,129 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289193271] [2019-10-22 11:23:46,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:23:46,129 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:23:46,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:23:46,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:23:46,130 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 3 states. [2019-10-22 11:23:46,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:46,151 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2019-10-22 11:23:46,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:46,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-22 11:23:46,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:46,154 INFO L225 Difference]: With dead ends: 37 [2019-10-22 11:23:46,154 INFO L226 Difference]: Without dead ends: 24 [2019-10-22 11:23:46,154 INFO L600 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-10-22 11:23:46,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-22 11:23:46,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-10-22 11:23:46,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-22 11:23:46,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2019-10-22 11:23:46,162 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 21 [2019-10-22 11:23:46,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:46,162 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-10-22 11:23:46,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:23:46,163 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2019-10-22 11:23:46,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 11:23:46,163 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:46,163 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:46,164 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:46,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:46,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1873261422, now seen corresponding path program 1 times [2019-10-22 11:23:46,164 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:23:46,164 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783789058] [2019-10-22 11:23:46,164 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:46,165 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:23:46,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:23:46,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:46,544 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 18 [2019-10-22 11:23:46,702 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 29 [2019-10-22 11:23:47,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:47,358 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783789058] [2019-10-22 11:23:47,359 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693996513] [2019-10-22 11:23:47,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25b586a6-d536-4739-9b61-b00c668aa0b7/bin/utaipan/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-10-22 11:23:47,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:47,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-22 11:23:47,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:23:47,602 INFO L375 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 16 treesize of output 12 [2019-10-22 11:23:47,602 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:47,613 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:47,614 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:23:47,614 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-10-22 11:23:47,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:23:47,658 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:47,659 INFO L375 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 1 case distinctions, treesize of input 27 treesize of output 20 [2019-10-22 11:23:47,659 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:47,665 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:47,666 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:23:47,666 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-10-22 11:23:47,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:23:47,732 INFO L375 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 24 treesize of output 23 [2019-10-22 11:23:47,732 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:47,743 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:47,743 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:23:47,743 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-10-22 11:23:47,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:23:47,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:23:47,839 INFO L341 Elim1Store]: treesize reduction 22, result has 53.2 percent of original size [2019-10-22 11:23:47,839 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 55 [2019-10-22 11:23:47,841 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:47,860 INFO L567 ElimStorePlain]: treesize reduction 26, result has 52.7 percent of original size [2019-10-22 11:23:47,861 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:23:47,862 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:29 [2019-10-22 11:23:47,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:47,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:47,972 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:23:47,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:48,109 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2019-10-22 11:23:48,115 INFO L375 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 32 treesize of output 30 [2019-10-22 11:23:48,116 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-10-22 11:23:48,121 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:48,121 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-10-22 11:23:48,125 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:48,125 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-22 11:23:48,125 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:14 [2019-10-22 11:23:48,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 11:23:48,173 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [128062422] [2019-10-22 11:23:48,178 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 22 [2019-10-22 11:23:48,220 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-10-22 11:23:48,221 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-22 11:23:48,501 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:23:48,502 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inappropriate decl info IMPLEMENTATION at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Boogie2SmtSymbolTable.getBoogieVar(Boogie2SmtSymbolTable.java:222) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.getBoogieVar(NonrelationalStatementProcessor.java:348) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleHavocStatement(NonrelationalStatementProcessor.java:325) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:159) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:138) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:107) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:422) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:413) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:140) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.restoreOriginalStateVariables(PoormanCachedPostOperation.java:322) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:120) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:323) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:323) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateAbstractPost(FixpointEngine.java:249) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateFixpoint(FixpointEngine.java:134) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.run(FixpointEngine.java:105) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.tool.AbstractInterpreter.runWithoutTimeoutAndResults(AbstractInterpreter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.generateFixpoints(CegarAbsIntRunner.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.(CegarAbsIntRunner.java:158) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAbstractInterpretation.getOrConstructRunner(IpTcStrategyModuleAbstractInterpretation.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAbstractInterpretation.construct(IpTcStrategyModuleAbstractInterpretation.java:81) 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.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) 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:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) 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-10-22 11:23:48,506 INFO L168 Benchmark]: Toolchain (without parser) took 3756.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 938.3 MB in the beginning and 1.1 GB in the end (delta: -127.7 MB). Peak memory consumption was 4.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:48,507 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 957.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:23:48,507 INFO L168 Benchmark]: CACSL2BoogieTranslator took 302.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 938.3 MB in the beginning and 1.1 GB in the end (delta: -190.5 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:48,508 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.20 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:48,508 INFO L168 Benchmark]: Boogie Preprocessor took 24.95 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:48,509 INFO L168 Benchmark]: RCFGBuilder took 372.24 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.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:48,509 INFO L168 Benchmark]: TraceAbstraction took 3014.07 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: 36.3 MB). Peak memory consumption was 36.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:23:48,512 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 957.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 302.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 938.3 MB in the beginning and 1.1 GB in the end (delta: -190.5 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.20 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.95 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 372.24 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.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3014.07 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: 36.3 MB). Peak memory consumption was 36.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inappropriate decl info IMPLEMENTATION de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inappropriate decl info IMPLEMENTATION: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Boogie2SmtSymbolTable.getBoogieVar(Boogie2SmtSymbolTable.java:222) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-10-22 11:23:50,572 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:23:50,573 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:23:50,582 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:23:50,583 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:23:50,583 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:23:50,584 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:23:50,586 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:23:50,587 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:23:50,588 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:23:50,589 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:23:50,590 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:23:50,590 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:23:50,591 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:23:50,591 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:23:50,592 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:23:50,593 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:23:50,593 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:23:50,595 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:23:50,596 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:23:50,598 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:23:50,599 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:23:50,600 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:23:50,600 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:23:50,602 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:23:50,603 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:23:50,603 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:23:50,604 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:23:50,604 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:23:50,605 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:23:50,605 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:23:50,606 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:23:50,606 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:23:50,607 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:23:50,608 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:23:50,608 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:23:50,608 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:23:50,609 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:23:50,609 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:23:50,609 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:23:50,610 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:23:50,611 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_25b586a6-d536-4739-9b61-b00c668aa0b7/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-10-22 11:23:50,622 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:23:50,622 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:23:50,623 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:23:50,623 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:23:50,623 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:23:50,623 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:23:50,623 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:23:50,623 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:23:50,624 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:23:50,624 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:23:50,624 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:23:50,624 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:23:50,625 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:23:50,625 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:23:50,625 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:23:50,625 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:23:50,625 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-10-22 11:23:50,625 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-10-22 11:23:50,625 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:23:50,626 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:23:50,626 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 11:23:50,626 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:23:50,626 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:23:50,627 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:23:50,627 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:23:50,627 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:23:50,627 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:23:50,627 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:23:50,627 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:23:50,627 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:23:50,628 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-10-22 11:23:50,628 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-10-22 11:23:50,628 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:23:50,628 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:23:50,628 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/working_dir_25b586a6-d536-4739-9b61-b00c668aa0b7/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b6961d3ae59e069e59ed9be8398063e9b96e7ae1 [2019-10-22 11:23:50,655 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:23:50,664 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:23:50,667 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:23:50,668 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:23:50,669 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:23:50,669 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_25b586a6-d536-4739-9b61-b00c668aa0b7/bin/utaipan/../../sv-benchmarks/c/array-tiling/mbpr2.c [2019-10-22 11:23:50,715 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_25b586a6-d536-4739-9b61-b00c668aa0b7/bin/utaipan/data/03c3c08f2/150833db308f4a37958a16efc3806779/FLAG65b5b678b [2019-10-22 11:23:51,092 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:23:51,093 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_25b586a6-d536-4739-9b61-b00c668aa0b7/sv-benchmarks/c/array-tiling/mbpr2.c [2019-10-22 11:23:51,098 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_25b586a6-d536-4739-9b61-b00c668aa0b7/bin/utaipan/data/03c3c08f2/150833db308f4a37958a16efc3806779/FLAG65b5b678b [2019-10-22 11:23:51,108 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_25b586a6-d536-4739-9b61-b00c668aa0b7/bin/utaipan/data/03c3c08f2/150833db308f4a37958a16efc3806779 [2019-10-22 11:23:51,110 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:23:51,111 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:23:51,112 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:23:51,112 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:23:51,115 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:23:51,116 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:23:51" (1/1) ... [2019-10-22 11:23:51,118 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@313b155 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:51, skipping insertion in model container [2019-10-22 11:23:51,118 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:23:51" (1/1) ... [2019-10-22 11:23:51,125 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:23:51,139 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:23:51,307 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:23:51,312 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:23:51,337 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:23:51,356 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:23:51,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:51 WrapperNode [2019-10-22 11:23:51,356 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:23:51,357 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:23:51,357 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:23:51,357 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:23:51,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:51" (1/1) ... [2019-10-22 11:23:51,423 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:51" (1/1) ... [2019-10-22 11:23:51,442 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:23:51,443 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:23:51,443 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:23:51,443 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:23:51,451 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:51" (1/1) ... [2019-10-22 11:23:51,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:51" (1/1) ... [2019-10-22 11:23:51,453 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:51" (1/1) ... [2019-10-22 11:23:51,453 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:51" (1/1) ... [2019-10-22 11:23:51,471 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:51" (1/1) ... [2019-10-22 11:23:51,476 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:51" (1/1) ... [2019-10-22 11:23:51,477 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:51" (1/1) ... [2019-10-22 11:23:51,479 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:23:51,479 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:23:51,479 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:23:51,479 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:23:51,480 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25b586a6-d536-4739-9b61-b00c668aa0b7/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:23:51,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-10-22 11:23:51,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:23:51,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:23:51,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:23:51,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-10-22 11:23:51,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:23:51,834 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:23:51,834 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-10-22 11:23:51,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:23:51 BoogieIcfgContainer [2019-10-22 11:23:51,836 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:23:51,836 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:23:51,837 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:23:51,839 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:23:51,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:23:51" (1/3) ... [2019-10-22 11:23:51,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@549e02fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:23:51, skipping insertion in model container [2019-10-22 11:23:51,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:23:51" (2/3) ... [2019-10-22 11:23:51,841 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@549e02fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:23:51, skipping insertion in model container [2019-10-22 11:23:51,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:23:51" (3/3) ... [2019-10-22 11:23:51,842 INFO L109 eAbstractionObserver]: Analyzing ICFG mbpr2.c [2019-10-22 11:23:51,858 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:23:51,876 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 11:23:51,889 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 11:23:51,914 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:23:51,914 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:23:51,914 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:23:51,915 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:23:51,915 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:23:51,915 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:23:51,915 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:23:51,915 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:23:51,927 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-10-22 11:23:51,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 11:23:51,933 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:51,934 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:51,936 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:51,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:51,940 INFO L82 PathProgramCache]: Analyzing trace with hash -297663993, now seen corresponding path program 1 times [2019-10-22 11:23:51,947 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:23:51,947 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1911849084] [2019-10-22 11:23:51,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25b586a6-d536-4739-9b61-b00c668aa0b7/bin/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:23:52,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:52,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 1 conjunts are in the unsatisfiable core [2019-10-22 11:23:52,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:23:52,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:52,033 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:23:52,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:52,038 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1911849084] [2019-10-22 11:23:52,038 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:52,039 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-10-22 11:23:52,039 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718694408] [2019-10-22 11:23:52,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:23:52,043 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:23:52,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:23:52,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:23:52,056 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2019-10-22 11:23:52,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:52,069 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2019-10-22 11:23:52,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:23:52,070 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2019-10-22 11:23:52,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:52,079 INFO L225 Difference]: With dead ends: 46 [2019-10-22 11:23:52,079 INFO L226 Difference]: Without dead ends: 22 [2019-10-22 11:23:52,082 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 24 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-10-22 11:23:52,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-22 11:23:52,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-22 11:23:52,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-22 11:23:52,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2019-10-22 11:23:52,112 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 13 [2019-10-22 11:23:52,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:52,112 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2019-10-22 11:23:52,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:23:52,113 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2019-10-22 11:23:52,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-22 11:23:52,113 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:52,113 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:52,314 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:23:52,314 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:52,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:52,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1049690042, now seen corresponding path program 1 times [2019-10-22 11:23:52,315 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:23:52,315 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1403186165] [2019-10-22 11:23:52,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25b586a6-d536-4739-9b61-b00c668aa0b7/bin/utaipan/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:23:52,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:52,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 11:23:52,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:23:52,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:52,441 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:23:52,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:52,713 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1403186165] [2019-10-22 11:23:52,713 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:52,713 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-10-22 11:23:52,713 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991137393] [2019-10-22 11:23:52,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:23:52,727 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:23:52,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:23:52,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:23:52,727 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand 6 states. [2019-10-22 11:23:53,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:53,333 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2019-10-22 11:23:53,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:23:53,340 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-10-22 11:23:53,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:53,340 INFO L225 Difference]: With dead ends: 49 [2019-10-22 11:23:53,341 INFO L226 Difference]: Without dead ends: 35 [2019-10-22 11:23:53,342 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:23:53,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-22 11:23:53,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 24. [2019-10-22 11:23:53,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-22 11:23:53,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2019-10-22 11:23:53,347 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 13 [2019-10-22 11:23:53,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:53,347 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2019-10-22 11:23:53,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:23:53,348 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2019-10-22 11:23:53,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 11:23:53,348 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:53,349 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:53,551 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:23:53,551 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:53,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:53,551 INFO L82 PathProgramCache]: Analyzing trace with hash -2028678864, now seen corresponding path program 1 times [2019-10-22 11:23:53,552 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:23:53,552 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1363157833] [2019-10-22 11:23:53,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25b586a6-d536-4739-9b61-b00c668aa0b7/bin/utaipan/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:23:53,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:53,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 11:23:53,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:23:53,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 11:23:53,693 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:23:53,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 11:23:53,708 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1363157833] [2019-10-22 11:23:53,708 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:23:53,708 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-10-22 11:23:53,708 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499863283] [2019-10-22 11:23:53,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:23:53,709 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:23:53,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:23:53,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:23:53,711 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand 4 states. [2019-10-22 11:23:53,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:23:53,736 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2019-10-22 11:23:53,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:23:53,737 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-10-22 11:23:53,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:23:53,738 INFO L225 Difference]: With dead ends: 37 [2019-10-22 11:23:53,738 INFO L226 Difference]: Without dead ends: 24 [2019-10-22 11:23:53,738 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:23:53,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-22 11:23:53,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-10-22 11:23:53,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-22 11:23:53,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2019-10-22 11:23:53,744 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 21 [2019-10-22 11:23:53,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:23:53,744 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-10-22 11:23:53,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:23:53,745 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2019-10-22 11:23:53,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 11:23:53,745 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:23:53,745 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:23:53,946 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:23:53,946 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:23:53,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:23:53,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1873261422, now seen corresponding path program 1 times [2019-10-22 11:23:53,947 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:23:53,947 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [661401541] [2019-10-22 11:23:53,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25b586a6-d536-4739-9b61-b00c668aa0b7/bin/utaipan/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:23:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:54,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-22 11:23:54,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:23:54,112 INFO L375 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 16 treesize of output 12 [2019-10-22 11:23:54,113 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:54,122 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:54,122 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:23:54,123 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-10-22 11:23:54,154 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:23:54,155 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:54,156 INFO L375 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 1 case distinctions, treesize of input 27 treesize of output 20 [2019-10-22 11:23:54,157 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:54,164 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:54,164 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:23:54,165 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:16 [2019-10-22 11:23:54,215 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:23:54,216 INFO L375 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 29 treesize of output 28 [2019-10-22 11:23:54,217 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:54,236 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:54,237 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:23:54,237 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2019-10-22 11:23:54,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:23:54,279 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:54,280 INFO L375 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 1 case distinctions, treesize of input 32 treesize of output 23 [2019-10-22 11:23:54,281 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:54,293 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:54,293 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:23:54,294 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:25 [2019-10-22 11:23:54,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:54,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:54,377 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:23:54,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:54,574 INFO L375 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 13 [2019-10-22 11:23:54,590 INFO L375 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 28 treesize of output 26 [2019-10-22 11:23:54,591 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:23:54,617 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:54,617 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:23:54,646 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:54,647 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:23:54,647 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:26 [2019-10-22 11:23:54,855 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 11:23:54,856 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [661401541] [2019-10-22 11:23:54,856 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341006133] [2019-10-22 11:23:54,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25b586a6-d536-4739-9b61-b00c668aa0b7/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:23:54,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:23:54,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 11:23:54,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:23:54,930 INFO L375 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 16 treesize of output 12 [2019-10-22 11:23:54,930 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:54,947 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:54,948 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:23:54,948 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-10-22 11:23:54,958 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:23:54,960 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:54,960 INFO L375 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 1 case distinctions, treesize of input 27 treesize of output 20 [2019-10-22 11:23:54,961 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:54,974 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:54,974 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:23:54,974 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:16 [2019-10-22 11:23:54,999 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-22 11:23:54,999 INFO L375 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 1 case distinctions, treesize of input 26 treesize of output 25 [2019-10-22 11:23:55,000 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:55,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:55,022 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:23:55,022 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2019-10-22 11:23:55,191 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 23 [2019-10-22 11:23:55,191 INFO L341 Elim1Store]: treesize reduction 98, result has 25.2 percent of original size [2019-10-22 11:23:55,191 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 47 treesize of output 53 [2019-10-22 11:23:55,193 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:23:55,234 INFO L567 ElimStorePlain]: treesize reduction 26, result has 50.0 percent of original size [2019-10-22 11:23:55,235 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:23:55,235 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:26 [2019-10-22 11:23:55,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:55,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:23:55,370 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:23:55,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:23:55,478 INFO L375 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 13 [2019-10-22 11:23:55,483 INFO L375 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 28 treesize of output 26 [2019-10-22 11:23:55,484 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:23:55,509 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:55,510 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:23:55,528 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:23:55,529 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:23:55,529 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:26 [2019-10-22 11:23:55,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 11:23:55,628 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-22 11:23:55,628 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 10, 7] total 17 [2019-10-22 11:23:55,628 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476355795] [2019-10-22 11:23:55,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-22 11:23:55,629 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:23:55,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-22 11:23:55,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-10-22 11:23:55,630 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 17 states. [2019-10-22 11:24:00,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:00,516 INFO L93 Difference]: Finished difference Result 95 states and 110 transitions. [2019-10-22 11:24:00,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-22 11:24:00,531 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 21 [2019-10-22 11:24:00,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:00,531 INFO L225 Difference]: With dead ends: 95 [2019-10-22 11:24:00,532 INFO L226 Difference]: Without dead ends: 76 [2019-10-22 11:24:00,532 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 56 SyntacticMatches, 10 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=184, Invalid=518, Unknown=0, NotChecked=0, Total=702 [2019-10-22 11:24:00,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-22 11:24:00,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 37. [2019-10-22 11:24:00,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-22 11:24:00,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2019-10-22 11:24:00,543 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 21 [2019-10-22 11:24:00,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:00,544 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2019-10-22 11:24:00,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-22 11:24:00,544 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2019-10-22 11:24:00,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 11:24:00,544 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:00,544 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:00,945 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:24:00,946 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:00,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:00,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1873201840, now seen corresponding path program 1 times [2019-10-22 11:24:00,946 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:24:00,946 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1863421617] [2019-10-22 11:24:00,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25b586a6-d536-4739-9b61-b00c668aa0b7/bin/utaipan/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:24:00,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:00,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 11:24:00,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:01,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:24:01,001 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:01,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 11:24:01,007 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1863421617] [2019-10-22 11:24:01,007 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:01,008 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2019-10-22 11:24:01,008 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036312571] [2019-10-22 11:24:01,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:24:01,008 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:24:01,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:24:01,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:24:01,009 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 5 states. [2019-10-22 11:24:01,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:01,053 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2019-10-22 11:24:01,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:24:01,053 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-10-22 11:24:01,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:01,054 INFO L225 Difference]: With dead ends: 51 [2019-10-22 11:24:01,054 INFO L226 Difference]: Without dead ends: 49 [2019-10-22 11:24:01,054 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:24:01,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-22 11:24:01,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 39. [2019-10-22 11:24:01,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-22 11:24:01,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2019-10-22 11:24:01,061 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 21 [2019-10-22 11:24:01,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:01,062 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2019-10-22 11:24:01,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:24:01,062 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2019-10-22 11:24:01,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 11:24:01,063 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:01,063 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:01,264 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:24:01,264 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:01,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:01,265 INFO L82 PathProgramCache]: Analyzing trace with hash -906787479, now seen corresponding path program 2 times [2019-10-22 11:24:01,265 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:24:01,265 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1237388741] [2019-10-22 11:24:01,265 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25b586a6-d536-4739-9b61-b00c668aa0b7/bin/utaipan/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:24:01,346 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 11:24:01,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 11:24:01,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 11:24:01,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:01,626 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2019-10-22 11:24:02,200 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:02,201 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:03,387 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:03,387 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1237388741] [2019-10-22 11:24:03,387 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866197103] [2019-10-22 11:24:03,387 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25b586a6-d536-4739-9b61-b00c668aa0b7/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:24:03,435 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 11:24:03,435 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 11:24:03,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 11:24:03,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:03,989 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2019-10-22 11:24:05,218 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:05,219 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:06,348 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:06,349 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-22 11:24:06,349 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 10, 9] total 24 [2019-10-22 11:24:06,349 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738591495] [2019-10-22 11:24:06,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-22 11:24:06,350 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:24:06,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-22 11:24:06,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2019-10-22 11:24:06,351 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 24 states. [2019-10-22 11:24:07,831 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2019-10-22 11:24:11,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:11,230 INFO L93 Difference]: Finished difference Result 174 states and 195 transitions. [2019-10-22 11:24:11,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-22 11:24:11,237 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 25 [2019-10-22 11:24:11,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:11,238 INFO L225 Difference]: With dead ends: 174 [2019-10-22 11:24:11,238 INFO L226 Difference]: Without dead ends: 159 [2019-10-22 11:24:11,238 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=358, Invalid=902, Unknown=0, NotChecked=0, Total=1260 [2019-10-22 11:24:11,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-10-22 11:24:11,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 57. [2019-10-22 11:24:11,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-22 11:24:11,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2019-10-22 11:24:11,247 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 25 [2019-10-22 11:24:11,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:11,247 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2019-10-22 11:24:11,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-22 11:24:11,248 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2019-10-22 11:24:11,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-22 11:24:11,248 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:11,248 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:11,649 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:24:11,649 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:11,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:11,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1045428993, now seen corresponding path program 1 times [2019-10-22 11:24:11,649 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:24:11,649 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1151425159] [2019-10-22 11:24:11,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25b586a6-d536-4739-9b61-b00c668aa0b7/bin/utaipan/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:24:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:11,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-22 11:24:11,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:11,747 INFO L375 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 16 treesize of output 12 [2019-10-22 11:24:11,747 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:11,756 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:11,756 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:24:11,756 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-10-22 11:24:11,786 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:24:11,787 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:11,788 INFO L375 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 1 case distinctions, treesize of input 25 treesize of output 20 [2019-10-22 11:24:11,788 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:11,795 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:11,795 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:24:11,795 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:13 [2019-10-22 11:24:11,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:11,856 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 11:24:11,856 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:11,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:12,001 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2019-10-22 11:24:12,007 INFO L375 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 30 treesize of output 26 [2019-10-22 11:24:12,007 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:12,011 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:12,011 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:24:12,014 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:12,015 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:24:12,015 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:10 [2019-10-22 11:24:12,039 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 11:24:12,040 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1151425159] [2019-10-22 11:24:12,040 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631248495] [2019-10-22 11:24:12,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25b586a6-d536-4739-9b61-b00c668aa0b7/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:24:12,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:12,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-22 11:24:12,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:12,115 INFO L375 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 16 treesize of output 12 [2019-10-22 11:24:12,115 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:12,123 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:12,124 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:24:12,124 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-10-22 11:24:12,132 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:24:12,133 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:12,133 INFO L375 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 1 case distinctions, treesize of input 25 treesize of output 20 [2019-10-22 11:24:12,133 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:12,138 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:12,139 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:24:12,139 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:13 [2019-10-22 11:24:12,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:12,155 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 11:24:12,155 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:12,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:12,209 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2019-10-22 11:24:12,213 INFO L375 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 30 treesize of output 26 [2019-10-22 11:24:12,213 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:12,216 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:12,216 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:24:12,219 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:12,219 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:24:12,220 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:10 [2019-10-22 11:24:12,222 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 11:24:12,222 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-22 11:24:12,222 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9, 8] total 14 [2019-10-22 11:24:12,222 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852920773] [2019-10-22 11:24:12,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-22 11:24:12,223 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:24:12,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-22 11:24:12,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2019-10-22 11:24:12,224 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 14 states. [2019-10-22 11:24:12,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:12,849 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2019-10-22 11:24:12,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-22 11:24:12,849 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-10-22 11:24:12,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:12,850 INFO L225 Difference]: With dead ends: 92 [2019-10-22 11:24:12,850 INFO L226 Difference]: Without dead ends: 90 [2019-10-22 11:24:12,851 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 88 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2019-10-22 11:24:12,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-22 11:24:12,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 67. [2019-10-22 11:24:12,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-22 11:24:12,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2019-10-22 11:24:12,862 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 27 [2019-10-22 11:24:12,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:12,862 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2019-10-22 11:24:12,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-22 11:24:12,863 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2019-10-22 11:24:12,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-22 11:24:12,863 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:12,864 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:13,264 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:24:13,265 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:13,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:13,265 INFO L82 PathProgramCache]: Analyzing trace with hash 603963938, now seen corresponding path program 3 times [2019-10-22 11:24:13,265 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:24:13,265 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [370780812] [2019-10-22 11:24:13,266 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25b586a6-d536-4739-9b61-b00c668aa0b7/bin/utaipan/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:24:13,360 ERROR L273 tionRefinementEngine]: Caught known exception: Array theory solver does not yet support write-chains connecting two different constant arrays [2019-10-22 11:24:13,360 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1410637778] [2019-10-22 11:24:13,360 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25b586a6-d536-4739-9b61-b00c668aa0b7/bin/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:24:13,439 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-22 11:24:13,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 11:24:13,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-22 11:24:13,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:13,484 INFO L375 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 16 treesize of output 12 [2019-10-22 11:24:13,484 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:13,501 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:13,501 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:24:13,501 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-10-22 11:24:13,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:24:13,535 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:13,536 INFO L375 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 1 case distinctions, treesize of input 38 treesize of output 28 [2019-10-22 11:24:13,536 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:13,550 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:13,550 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:24:13,550 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:27 [2019-10-22 11:24:13,592 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:24:13,593 INFO L375 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 24 treesize of output 23 [2019-10-22 11:24:13,594 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:13,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:13,616 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:24:13,616 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:33 [2019-10-22 11:24:13,659 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:24:13,661 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:24:13,662 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:24:13,663 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:13,664 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 34 [2019-10-22 11:24:13,665 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:13,681 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:13,681 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:24:13,681 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-10-22 11:24:13,713 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:24:13,758 INFO L341 Elim1Store]: treesize reduction 58, result has 22.7 percent of original size [2019-10-22 11:24:13,759 INFO L375 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 3 case distinctions, treesize of input 35 treesize of output 37 [2019-10-22 11:24:13,760 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:13,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:13,787 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:24:13,788 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:39 [2019-10-22 11:24:13,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:24:14,029 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 31 [2019-10-22 11:24:14,029 INFO L341 Elim1Store]: treesize reduction 141, result has 30.2 percent of original size [2019-10-22 11:24:14,029 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 58 treesize of output 86 [2019-10-22 11:24:14,035 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:14,090 INFO L567 ElimStorePlain]: treesize reduction 56, result has 41.1 percent of original size [2019-10-22 11:24:14,091 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:24:14,091 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:64, output treesize:39 [2019-10-22 11:24:14,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:24:14,320 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 29 [2019-10-22 11:24:14,320 INFO L341 Elim1Store]: treesize reduction 86, result has 44.9 percent of original size [2019-10-22 11:24:14,320 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 95 [2019-10-22 11:24:14,321 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:18,478 WARN L191 SmtUtils]: Spent 4.16 s on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2019-10-22 11:24:18,478 INFO L567 ElimStorePlain]: treesize reduction 27, result has 70.0 percent of original size [2019-10-22 11:24:18,479 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-22 11:24:18,479 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:63 [2019-10-22 11:24:18,531 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:24:18,674 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 31 [2019-10-22 11:24:18,674 INFO L341 Elim1Store]: treesize reduction 139, result has 31.2 percent of original size [2019-10-22 11:24:18,675 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 58 treesize of output 88 [2019-10-22 11:24:18,676 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:24:18,719 INFO L567 ElimStorePlain]: treesize reduction 56, result has 39.8 percent of original size [2019-10-22 11:24:18,719 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:24:18,720 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:64, output treesize:37 [2019-10-22 11:24:18,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:18,808 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 11:24:18,808 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:18,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:19,134 INFO L375 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 22 treesize of output 20 [2019-10-22 11:24:19,137 INFO L375 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 72 treesize of output 70 [2019-10-22 11:24:19,138 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:24:19,208 INFO L567 ElimStorePlain]: treesize reduction 23, result has 67.1 percent of original size [2019-10-22 11:24:19,209 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:24:19,243 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:24:19,244 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:24:19,244 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:47 [2019-10-22 11:24:19,417 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-22 11:24:19,417 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [370780812] [2019-10-22 11:24:19,617 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:24:19,618 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: Do not try to interpolate when trace is feasible at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:328) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) 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:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) 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-10-22 11:24:19,621 INFO L168 Benchmark]: Toolchain (without parser) took 28510.39 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 276.8 MB). Free memory was 951.0 MB in the beginning and 1.2 GB in the end (delta: -271.6 MB). Peak memory consumption was 5.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:19,621 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:24:19,622 INFO L168 Benchmark]: CACSL2BoogieTranslator took 244.83 ms. Allocated memory is still 1.0 GB. Free memory was 951.0 MB in the beginning and 940.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:19,623 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 940.2 MB in the beginning and 1.1 GB in the end (delta: -153.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:19,623 INFO L168 Benchmark]: Boogie Preprocessor took 36.11 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:19,623 INFO L168 Benchmark]: RCFGBuilder took 356.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:19,623 INFO L168 Benchmark]: TraceAbstraction took 27783.80 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 178.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -157.2 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:19,625 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 244.83 ms. Allocated memory is still 1.0 GB. Free memory was 951.0 MB in the beginning and 940.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 85.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 940.2 MB in the beginning and 1.1 GB in the end (delta: -153.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.11 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 356.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27783.80 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 178.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -157.2 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: Do not try to interpolate when trace is feasible de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: Do not try to interpolate when trace is feasible : de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:328) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...