./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-properties/simple_built_from_end.i --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_11a51008-1012-42bf-9141-cb048153bdd3/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_11a51008-1012-42bf-9141-cb048153bdd3/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_11a51008-1012-42bf-9141-cb048153bdd3/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_11a51008-1012-42bf-9141-cb048153bdd3/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-properties/simple_built_from_end.i -s /tmp/vcloud-vcloud-master/worker/working_dir_11a51008-1012-42bf-9141-cb048153bdd3/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_11a51008-1012-42bf-9141-cb048153bdd3/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 41b5142f2d6582efd6d9a128e4dfef83faaab097 ........................................................................................................................................................................................................................................................................................................................................................................................................................... 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_11a51008-1012-42bf-9141-cb048153bdd3/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_11a51008-1012-42bf-9141-cb048153bdd3/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_11a51008-1012-42bf-9141-cb048153bdd3/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_11a51008-1012-42bf-9141-cb048153bdd3/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-properties/simple_built_from_end.i -s /tmp/vcloud-vcloud-master/worker/working_dir_11a51008-1012-42bf-9141-cb048153bdd3/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_11a51008-1012-42bf-9141-cb048153bdd3/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 41b5142f2d6582efd6d9a128e4dfef83faaab097 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: expected NNF --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:26:28,581 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:26:28,582 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:26:28,592 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:26:28,592 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:26:28,593 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:26:28,594 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:26:28,596 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:26:28,597 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:26:28,598 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:26:28,599 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:26:28,600 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:26:28,600 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:26:28,600 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:26:28,601 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:26:28,602 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:26:28,603 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:26:28,603 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:26:28,605 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:26:28,607 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:26:28,608 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:26:28,609 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:26:28,610 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:26:28,610 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:26:28,613 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:26:28,613 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:26:28,613 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:26:28,614 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:26:28,614 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:26:28,615 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:26:28,615 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:26:28,616 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:26:28,617 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:26:28,618 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:26:28,618 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:26:28,619 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:26:28,619 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:26:28,619 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:26:28,620 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:26:28,620 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:26:28,621 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:26:28,622 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_11a51008-1012-42bf-9141-cb048153bdd3/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:26:28,634 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:26:28,634 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:26:28,635 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:26:28,635 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:26:28,636 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:26:28,636 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:26:28,636 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:26:28,636 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:26:28,636 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:26:28,636 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:26:28,636 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:26:28,637 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:26:28,637 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:26:28,637 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:26:28,638 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:26:28,638 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:26:28,638 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:26:28,638 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:26:28,638 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:26:28,638 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:26:28,639 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:26:28,639 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:26:28,639 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:26:28,639 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:26:28,639 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:26:28,639 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:26:28,639 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:26:28,640 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:26:28,640 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:26:28,640 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:26:28,640 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:26:28,640 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:26:28,640 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:26:28,641 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:26:28,641 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:26:28,641 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_11a51008-1012-42bf-9141-cb048153bdd3/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 -> 41b5142f2d6582efd6d9a128e4dfef83faaab097 [2019-10-22 11:26:28,665 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:26:28,675 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:26:28,678 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:26:28,680 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:26:28,680 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:26:28,681 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_11a51008-1012-42bf-9141-cb048153bdd3/bin/utaipan/../../sv-benchmarks/c/list-properties/simple_built_from_end.i [2019-10-22 11:26:28,731 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_11a51008-1012-42bf-9141-cb048153bdd3/bin/utaipan/data/23ad19429/e2e1b8104fd241749c3cf63e9c222405/FLAG051d40819 [2019-10-22 11:26:29,175 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:26:29,175 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_11a51008-1012-42bf-9141-cb048153bdd3/sv-benchmarks/c/list-properties/simple_built_from_end.i [2019-10-22 11:26:29,185 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_11a51008-1012-42bf-9141-cb048153bdd3/bin/utaipan/data/23ad19429/e2e1b8104fd241749c3cf63e9c222405/FLAG051d40819 [2019-10-22 11:26:29,198 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_11a51008-1012-42bf-9141-cb048153bdd3/bin/utaipan/data/23ad19429/e2e1b8104fd241749c3cf63e9c222405 [2019-10-22 11:26:29,201 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:26:29,202 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:26:29,204 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:26:29,204 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:26:29,208 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:26:29,209 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:26:29" (1/1) ... [2019-10-22 11:26:29,212 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37cd258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:29, skipping insertion in model container [2019-10-22 11:26:29,212 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:26:29" (1/1) ... [2019-10-22 11:26:29,220 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:26:29,254 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:26:29,606 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:26:29,614 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:26:29,650 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:26:29,695 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:26:29,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:29 WrapperNode [2019-10-22 11:26:29,696 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:26:29,697 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:26:29,697 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:26:29,697 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:26:29,706 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:26:29" (1/1) ... [2019-10-22 11:26:29,718 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:26:29" (1/1) ... [2019-10-22 11:26:29,745 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:26:29,746 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:26:29,746 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:26:29,746 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:26:29,754 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:29" (1/1) ... [2019-10-22 11:26:29,754 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:29" (1/1) ... [2019-10-22 11:26:29,757 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:29" (1/1) ... [2019-10-22 11:26:29,757 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:29" (1/1) ... [2019-10-22 11:26:29,762 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:29" (1/1) ... [2019-10-22 11:26:29,769 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:29" (1/1) ... [2019-10-22 11:26:29,771 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:29" (1/1) ... [2019-10-22 11:26:29,773 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:26:29,774 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:26:29,774 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:26:29,774 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:26:29,775 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_11a51008-1012-42bf-9141-cb048153bdd3/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:26:29,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 11:26:29,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 11:26:29,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:26:29,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:26:29,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:26:29,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:26:29,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:26:30,171 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:26:30,171 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 11:26:30,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:26:30 BoogieIcfgContainer [2019-10-22 11:26:30,173 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:26:30,173 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:26:30,174 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:26:30,177 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:26:30,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:26:29" (1/3) ... [2019-10-22 11:26:30,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35e80ab9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:26:30, skipping insertion in model container [2019-10-22 11:26:30,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:29" (2/3) ... [2019-10-22 11:26:30,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35e80ab9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:26:30, skipping insertion in model container [2019-10-22 11:26:30,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:26:30" (3/3) ... [2019-10-22 11:26:30,181 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_built_from_end.i [2019-10-22 11:26:30,191 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:26:30,199 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 11:26:30,211 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 11:26:30,242 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:26:30,242 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:26:30,242 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:26:30,243 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:26:30,243 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:26:30,243 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:26:30,243 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:26:30,243 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:26:30,261 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-10-22 11:26:30,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-10-22 11:26:30,270 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:30,271 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-10-22 11:26:30,274 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:30,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:30,281 INFO L82 PathProgramCache]: Analyzing trace with hash 890037006, now seen corresponding path program 1 times [2019-10-22 11:26:30,289 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:30,290 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883971056] [2019-10-22 11:26:30,290 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:30,291 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:30,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:30,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:30,414 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:26:30,415 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883971056] [2019-10-22 11:26:30,416 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:30,417 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 11:26:30,418 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774257914] [2019-10-22 11:26:30,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:26:30,424 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:30,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:26:30,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:26:30,441 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2019-10-22 11:26:30,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:30,457 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2019-10-22 11:26:30,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:26:30,458 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-10-22 11:26:30,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:30,468 INFO L225 Difference]: With dead ends: 23 [2019-10-22 11:26:30,469 INFO L226 Difference]: Without dead ends: 11 [2019-10-22 11:26:30,471 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:26:30,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-10-22 11:26:30,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-10-22 11:26:30,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-10-22 11:26:30,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-10-22 11:26:30,502 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 6 [2019-10-22 11:26:30,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:30,502 INFO L462 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-10-22 11:26:30,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:26:30,503 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-10-22 11:26:30,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-10-22 11:26:30,503 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:30,503 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:30,504 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:30,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:30,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1806862075, now seen corresponding path program 1 times [2019-10-22 11:26:30,504 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:30,504 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739531993] [2019-10-22 11:26:30,504 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:30,505 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:30,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:30,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:30,541 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:26:30,542 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739531993] [2019-10-22 11:26:30,542 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:30,542 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:26:30,542 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180535974] [2019-10-22 11:26:30,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:30,544 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:30,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:30,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:30,545 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 3 states. [2019-10-22 11:26:30,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:30,561 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2019-10-22 11:26:30,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:30,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-10-22 11:26:30,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:30,562 INFO L225 Difference]: With dead ends: 21 [2019-10-22 11:26:30,563 INFO L226 Difference]: Without dead ends: 15 [2019-10-22 11:26:30,563 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:26:30,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-10-22 11:26:30,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2019-10-22 11:26:30,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-22 11:26:30,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-10-22 11:26:30,567 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 7 [2019-10-22 11:26:30,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:30,567 INFO L462 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-10-22 11:26:30,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:30,567 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-10-22 11:26:30,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 11:26:30,568 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:30,568 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:30,568 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:30,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:30,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1217762572, now seen corresponding path program 1 times [2019-10-22 11:26:30,569 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:30,573 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083386021] [2019-10-22 11:26:30,574 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:30,574 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:30,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:30,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:30,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:30,651 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083386021] [2019-10-22 11:26:30,651 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:30,651 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:26:30,652 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432825059] [2019-10-22 11:26:30,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:26:30,652 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:26:30,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:26:30,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:26:30,653 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 4 states. [2019-10-22 11:26:30,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:30,723 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2019-10-22 11:26:30,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:26:30,724 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-22 11:26:30,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:30,724 INFO L225 Difference]: With dead ends: 20 [2019-10-22 11:26:30,724 INFO L226 Difference]: Without dead ends: 18 [2019-10-22 11:26:30,725 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:26:30,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-10-22 11:26:30,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2019-10-22 11:26:30,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-22 11:26:30,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-10-22 11:26:30,730 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2019-10-22 11:26:30,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:30,730 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-10-22 11:26:30,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:26:30,731 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-10-22 11:26:30,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-22 11:26:30,731 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:30,731 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:30,731 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:30,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:30,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1228764301, now seen corresponding path program 1 times [2019-10-22 11:26:30,732 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:26:30,732 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111764215] [2019-10-22 11:26:30,732 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:30,732 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:26:30,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:26:30,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:30,806 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:30,806 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111764215] [2019-10-22 11:26:30,807 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981108988] [2019-10-22 11:26:30,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_11a51008-1012-42bf-9141-cb048153bdd3/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:26:30,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:30,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-22 11:26:30,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:26:30,942 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 11 treesize of output 7 [2019-10-22 11:26:30,943 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:30,953 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:30,958 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 11 treesize of output 7 [2019-10-22 11:26:30,958 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:30,966 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:30,967 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:26:30,967 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-10-22 11:26:30,994 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 7 [2019-10-22 11:26:30,994 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:31,002 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:31,006 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 7 [2019-10-22 11:26:31,007 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:31,012 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:31,012 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:26:31,013 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-10-22 11:26:31,015 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:31,015 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:26:31,026 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:31,026 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [456932253] [2019-10-22 11:26:31,032 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 15 [2019-10-22 11:26:31,070 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-10-22 11:26:31,070 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-22 11:26:31,345 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:26:31,346 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:26:31,351 INFO L168 Benchmark]: Toolchain (without parser) took 2148.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 935.6 MB in the beginning and 1.0 GB in the end (delta: -88.5 MB). Peak memory consumption was 56.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:31,351 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 1.0 GB. Free memory is still 958.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:26:31,352 INFO L168 Benchmark]: CACSL2BoogieTranslator took 492.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 935.6 MB in the beginning and 1.1 GB in the end (delta: -186.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:31,352 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:26:31,353 INFO L168 Benchmark]: Boogie Preprocessor took 27.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:31,354 INFO L168 Benchmark]: RCFGBuilder took 399.05 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: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:31,354 INFO L168 Benchmark]: TraceAbstraction took 1175.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 74.3 MB). Peak memory consumption was 74.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:26:31,357 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.36 ms. Allocated memory is still 1.0 GB. Free memory is still 958.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 492.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 935.6 MB in the beginning and 1.1 GB in the end (delta: -186.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 399.05 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: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1175.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 74.3 MB). Peak memory consumption was 74.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:26:33,458 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:26:33,460 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:26:33,469 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:26:33,470 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:26:33,471 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:26:33,472 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:26:33,473 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:26:33,475 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:26:33,476 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:26:33,476 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:26:33,477 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:26:33,478 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:26:33,478 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:26:33,479 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:26:33,480 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:26:33,481 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:26:33,482 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:26:33,483 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:26:33,485 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:26:33,486 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:26:33,487 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:26:33,488 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:26:33,489 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:26:33,491 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:26:33,491 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:26:33,492 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:26:33,492 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:26:33,493 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:26:33,494 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:26:33,494 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:26:33,495 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:26:33,495 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:26:33,496 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:26:33,497 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:26:33,497 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:26:33,498 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:26:33,498 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:26:33,498 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:26:33,499 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:26:33,500 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:26:33,500 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_11a51008-1012-42bf-9141-cb048153bdd3/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-10-22 11:26:33,513 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:26:33,513 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:26:33,514 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:26:33,514 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:26:33,514 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:26:33,514 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:26:33,514 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:26:33,514 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:26:33,515 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:26:33,515 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:26:33,515 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:26:33,516 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:26:33,516 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:26:33,516 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:26:33,516 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:26:33,516 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:26:33,516 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-10-22 11:26:33,517 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-10-22 11:26:33,517 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:26:33,517 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:26:33,517 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 11:26:33,518 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:26:33,518 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:26:33,518 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:26:33,518 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:26:33,518 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:26:33,518 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:26:33,519 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:26:33,519 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:26:33,519 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:26:33,519 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-10-22 11:26:33,519 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-10-22 11:26:33,519 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:26:33,520 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:26:33,520 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_11a51008-1012-42bf-9141-cb048153bdd3/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 -> 41b5142f2d6582efd6d9a128e4dfef83faaab097 [2019-10-22 11:26:33,553 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:26:33,567 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:26:33,572 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:26:33,573 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:26:33,574 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:26:33,574 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_11a51008-1012-42bf-9141-cb048153bdd3/bin/utaipan/../../sv-benchmarks/c/list-properties/simple_built_from_end.i [2019-10-22 11:26:33,628 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_11a51008-1012-42bf-9141-cb048153bdd3/bin/utaipan/data/31c99f517/3bad21270af44c7aa4e8ebe8871b1928/FLAG6ce3534cd [2019-10-22 11:26:34,072 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:26:34,072 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_11a51008-1012-42bf-9141-cb048153bdd3/sv-benchmarks/c/list-properties/simple_built_from_end.i [2019-10-22 11:26:34,092 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_11a51008-1012-42bf-9141-cb048153bdd3/bin/utaipan/data/31c99f517/3bad21270af44c7aa4e8ebe8871b1928/FLAG6ce3534cd [2019-10-22 11:26:34,397 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_11a51008-1012-42bf-9141-cb048153bdd3/bin/utaipan/data/31c99f517/3bad21270af44c7aa4e8ebe8871b1928 [2019-10-22 11:26:34,401 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:26:34,403 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:26:34,404 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:26:34,407 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:26:34,411 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:26:34,412 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:26:34" (1/1) ... [2019-10-22 11:26:34,415 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f1c8bcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:34, skipping insertion in model container [2019-10-22 11:26:34,415 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:26:34" (1/1) ... [2019-10-22 11:26:34,423 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:26:34,462 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:26:34,805 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:26:34,818 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:26:34,939 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:26:34,993 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:26:34,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:34 WrapperNode [2019-10-22 11:26:34,995 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:26:34,995 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:26:34,996 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:26:34,996 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:26:35,004 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:26:34" (1/1) ... [2019-10-22 11:26:35,020 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:26:34" (1/1) ... [2019-10-22 11:26:35,038 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:26:35,038 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:26:35,039 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:26:35,039 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:26:35,047 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:34" (1/1) ... [2019-10-22 11:26:35,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:34" (1/1) ... [2019-10-22 11:26:35,051 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:34" (1/1) ... [2019-10-22 11:26:35,051 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:34" (1/1) ... [2019-10-22 11:26:35,059 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:34" (1/1) ... [2019-10-22 11:26:35,063 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:34" (1/1) ... [2019-10-22 11:26:35,065 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:34" (1/1) ... [2019-10-22 11:26:35,068 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:26:35,068 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:26:35,068 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:26:35,068 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:26:35,069 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_11a51008-1012-42bf-9141-cb048153bdd3/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:26:35,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-10-22 11:26:35,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 11:26:35,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 11:26:35,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 11:26:35,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-10-22 11:26:35,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:26:35,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:26:35,403 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:26:35,403 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 11:26:35,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:26:35 BoogieIcfgContainer [2019-10-22 11:26:35,404 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:26:35,405 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:26:35,405 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:26:35,407 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:26:35,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:26:34" (1/3) ... [2019-10-22 11:26:35,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67a0cd07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:26:35, skipping insertion in model container [2019-10-22 11:26:35,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:26:34" (2/3) ... [2019-10-22 11:26:35,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67a0cd07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:26:35, skipping insertion in model container [2019-10-22 11:26:35,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:26:35" (3/3) ... [2019-10-22 11:26:35,410 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_built_from_end.i [2019-10-22 11:26:35,419 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:26:35,424 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 11:26:35,432 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 11:26:35,453 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:26:35,453 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:26:35,453 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:26:35,453 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:26:35,453 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:26:35,453 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:26:35,454 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:26:35,454 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:26:35,464 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2019-10-22 11:26:35,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-10-22 11:26:35,468 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:35,468 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-10-22 11:26:35,470 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:35,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:35,473 INFO L82 PathProgramCache]: Analyzing trace with hash 890006222, now seen corresponding path program 1 times [2019-10-22 11:26:35,480 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:26:35,480 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [988291596] [2019-10-22 11:26:35,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_11a51008-1012-42bf-9141-cb048153bdd3/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:26:35,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:35,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 1 conjunts are in the unsatisfiable core [2019-10-22 11:26:35,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:26:35,576 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:26:35,577 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:26:35,578 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:26:35,579 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [988291596] [2019-10-22 11:26:35,580 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:35,580 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-10-22 11:26:35,580 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968466360] [2019-10-22 11:26:35,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:26:35,584 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:26:35,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:26:35,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:26:35,599 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2019-10-22 11:26:35,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:35,610 INFO L93 Difference]: Finished difference Result 22 states and 29 transitions. [2019-10-22 11:26:35,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:26:35,612 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-10-22 11:26:35,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:35,620 INFO L225 Difference]: With dead ends: 22 [2019-10-22 11:26:35,620 INFO L226 Difference]: Without dead ends: 10 [2019-10-22 11:26:35,623 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 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:26:35,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-10-22 11:26:35,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-10-22 11:26:35,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-10-22 11:26:35,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2019-10-22 11:26:35,650 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 6 [2019-10-22 11:26:35,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:35,650 INFO L462 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-10-22 11:26:35,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:26:35,650 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2019-10-22 11:26:35,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-10-22 11:26:35,651 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:35,651 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-10-22 11:26:35,851 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:26:35,852 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:35,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:35,852 INFO L82 PathProgramCache]: Analyzing trace with hash 889648730, now seen corresponding path program 1 times [2019-10-22 11:26:35,852 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:26:35,852 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2005189468] [2019-10-22 11:26:35,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_11a51008-1012-42bf-9141-cb048153bdd3/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:26:35,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:35,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 11:26:35,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:26:35,929 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:26:35,929 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:26:35,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:35,931 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2005189468] [2019-10-22 11:26:35,931 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:35,931 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-10-22 11:26:35,932 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538091021] [2019-10-22 11:26:35,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:26:35,933 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:26:35,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:26:35,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:26:35,934 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 3 states. [2019-10-22 11:26:35,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:35,973 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2019-10-22 11:26:35,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:26:35,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-10-22 11:26:35,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:35,975 INFO L225 Difference]: With dead ends: 19 [2019-10-22 11:26:35,975 INFO L226 Difference]: Without dead ends: 13 [2019-10-22 11:26:35,976 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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:26:35,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-10-22 11:26:35,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2019-10-22 11:26:35,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-10-22 11:26:35,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-10-22 11:26:35,979 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 6 [2019-10-22 11:26:35,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:35,979 INFO L462 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-10-22 11:26:35,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:26:35,980 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-10-22 11:26:35,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-10-22 11:26:35,981 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:35,981 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:36,181 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:26:36,182 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:36,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:36,182 INFO L82 PathProgramCache]: Analyzing trace with hash 671286241, now seen corresponding path program 1 times [2019-10-22 11:26:36,183 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:26:36,183 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [392217220] [2019-10-22 11:26:36,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_11a51008-1012-42bf-9141-cb048153bdd3/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:26:36,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:36,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 11:26:36,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:26:36,321 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2019-10-22 11:26:36,322 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:36,330 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:36,331 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:26:36,331 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:11 [2019-10-22 11:26:36,354 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 9 [2019-10-22 11:26:36,356 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:36,359 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:36,359 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:26:36,359 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2019-10-22 11:26:36,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:36,369 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:26:36,388 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_int|], 2=[|v_#memory_int_6|]} [2019-10-22 11:26:36,393 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-22 11:26:36,397 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-22 11:26:36,406 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2019-10-22 11:26:36,407 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:36,409 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:36,409 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_6| vanished before elimination [2019-10-22 11:26:36,409 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:26:36,410 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:1 [2019-10-22 11:26:36,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:36,411 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [392217220] [2019-10-22 11:26:36,411 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:26:36,411 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 6 [2019-10-22 11:26:36,411 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054716753] [2019-10-22 11:26:36,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:26:36,412 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:26:36,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:26:36,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:26:36,412 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2019-10-22 11:26:36,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:36,542 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2019-10-22 11:26:36,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:26:36,543 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-10-22 11:26:36,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:36,544 INFO L225 Difference]: With dead ends: 18 [2019-10-22 11:26:36,544 INFO L226 Difference]: Without dead ends: 16 [2019-10-22 11:26:36,544 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:26:36,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-10-22 11:26:36,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 13. [2019-10-22 11:26:36,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-22 11:26:36,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-10-22 11:26:36,548 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 9 [2019-10-22 11:26:36,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:36,548 INFO L462 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-10-22 11:26:36,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:26:36,548 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-10-22 11:26:36,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 11:26:36,549 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:36,551 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:36,752 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:26:36,753 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:36,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:36,754 INFO L82 PathProgramCache]: Analyzing trace with hash 925471903, now seen corresponding path program 1 times [2019-10-22 11:26:36,754 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:26:36,754 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [246945998] [2019-10-22 11:26:36,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_11a51008-1012-42bf-9141-cb048153bdd3/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:26:36,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:36,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 11:26:36,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:26:36,847 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 11 treesize of output 7 [2019-10-22 11:26:36,847 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:36,857 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:36,862 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 11 treesize of output 7 [2019-10-22 11:26:36,862 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:36,872 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:36,872 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:26:36,873 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-10-22 11:26:36,899 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 7 [2019-10-22 11:26:36,900 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:36,909 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:36,912 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 7 [2019-10-22 11:26:36,913 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:36,919 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:36,919 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:26:36,919 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-10-22 11:26:36,921 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:36,921 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:26:36,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:36,948 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [246945998] [2019-10-22 11:26:36,948 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051307546] [2019-10-22 11:26:36,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_11a51008-1012-42bf-9141-cb048153bdd3/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:26:37,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:26:37,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-22 11:26:37,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:26:37,022 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 11 treesize of output 7 [2019-10-22 11:26:37,022 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:37,034 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:37,039 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 11 treesize of output 7 [2019-10-22 11:26:37,040 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:37,049 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:37,050 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:26:37,050 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2019-10-22 11:26:37,072 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 7 [2019-10-22 11:26:37,073 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:37,083 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:37,087 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 7 [2019-10-22 11:26:37,088 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:37,095 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:37,096 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:26:37,096 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-10-22 11:26:37,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:37,098 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:26:37,107 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:37,110 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-22 11:26:37,111 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5, 4] total 6 [2019-10-22 11:26:37,111 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430504553] [2019-10-22 11:26:37,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:26:37,113 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:26:37,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:26:37,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:26:37,115 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 6 states. [2019-10-22 11:26:37,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:37,249 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2019-10-22 11:26:37,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:26:37,251 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-10-22 11:26:37,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:37,252 INFO L225 Difference]: With dead ends: 27 [2019-10-22 11:26:37,252 INFO L226 Difference]: Without dead ends: 18 [2019-10-22 11:26:37,252 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:26:37,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-10-22 11:26:37,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2019-10-22 11:26:37,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-22 11:26:37,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-10-22 11:26:37,258 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2019-10-22 11:26:37,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:37,259 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-10-22 11:26:37,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:26:37,259 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-10-22 11:26:37,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 11:26:37,259 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:37,259 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:26:37,661 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:26:37,662 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:37,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:37,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1819205402, now seen corresponding path program 2 times [2019-10-22 11:26:37,664 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:26:37,664 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [848632201] [2019-10-22 11:26:37,664 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_11a51008-1012-42bf-9141-cb048153bdd3/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:26:37,769 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 11:26:37,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 11:26:37,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-22 11:26:37,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:26:37,783 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-22 11:26:37,783 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:37,789 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:37,789 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:26:37,789 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-22 11:26:37,804 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2019-10-22 11:26:37,805 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:37,812 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:37,813 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:26:37,813 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:18 [2019-10-22 11:26:37,838 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:37,839 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-10-22 11:26:37,840 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:37,853 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:37,853 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:26:37,853 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:20 [2019-10-22 11:26:37,884 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_11|, |v_#memory_$Pointer$.offset_11|], 1=[|v_#memory_int_10|]} [2019-10-22 11:26:37,896 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-22 11:26:37,896 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:37,937 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:37,943 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-22 11:26:37,944 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:37,978 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:37,985 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-10-22 11:26:37,986 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:38,004 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:38,005 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:26:38,006 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:57, output treesize:39 [2019-10-22 11:26:38,056 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 29 treesize of output 17 [2019-10-22 11:26:38,058 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:38,073 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:38,078 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-22 11:26:38,079 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:38,091 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:38,092 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:26:38,093 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:26 [2019-10-22 11:26:38,138 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2019-10-22 11:26:38,139 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:38,145 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:38,146 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:26:38,147 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-10-22 11:26:38,164 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:38,164 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:26:38,246 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:26:38,253 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:38,254 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:26:38,254 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:22 [2019-10-22 11:26:42,406 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_int|], 4=[|v_#memory_int_12|]} [2019-10-22 11:26:42,414 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-22 11:26:42,422 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:42,422 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 8 [2019-10-22 11:26:42,423 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:42,442 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:42,447 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 79 treesize of output 71 [2019-10-22 11:26:42,448 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:42,476 INFO L567 ElimStorePlain]: treesize reduction 45, result has 31.8 percent of original size [2019-10-22 11:26:42,477 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-22 11:26:42,477 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:20 [2019-10-22 11:26:42,520 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:42,520 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [848632201] [2019-10-22 11:26:42,520 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695246507] [2019-10-22 11:26:42,521 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_11a51008-1012-42bf-9141-cb048153bdd3/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:26:42,571 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 11:26:42,571 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 11:26:42,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-22 11:26:42,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:26:42,577 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-22 11:26:42,577 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:42,579 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:42,579 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:26:42,580 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-22 11:26:42,610 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-22 11:26:42,611 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 1 case distinctions, treesize of input 22 treesize of output 7 [2019-10-22 11:26:42,611 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:42,617 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:42,617 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:26:42,618 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:15 [2019-10-22 11:26:42,658 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:42,658 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-10-22 11:26:42,659 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:42,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:42,667 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:26:42,668 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:15 [2019-10-22 11:26:42,707 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_14|, |v_#memory_$Pointer$.base_14|], 4=[|v_#memory_int_14|]} [2019-10-22 11:26:42,716 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-22 11:26:42,716 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:42,774 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:42,781 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-22 11:26:42,781 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:42,811 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:42,817 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2019-10-22 11:26:42,818 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:42,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:42,837 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:26:42,837 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:55, output treesize:34 [2019-10-22 11:26:42,890 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 31 treesize of output 19 [2019-10-22 11:26:42,890 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:42,902 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:42,906 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-10-22 11:26:42,907 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:42,916 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:42,916 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:26:42,917 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:21 [2019-10-22 11:26:42,963 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2019-10-22 11:26:42,964 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:42,970 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:42,971 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:26:42,971 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:5 [2019-10-22 11:26:42,982 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:42,982 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:26:43,005 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:26:43,011 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:43,012 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:26:43,012 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:22 [2019-10-22 11:26:49,198 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_int|], 4=[|v_#memory_int_16|]} [2019-10-22 11:26:49,210 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-22 11:26:49,229 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:49,230 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 8 [2019-10-22 11:26:49,230 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:49,240 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:49,245 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 79 treesize of output 71 [2019-10-22 11:26:49,246 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:49,297 INFO L567 ElimStorePlain]: treesize reduction 45, result has 31.8 percent of original size [2019-10-22 11:26:49,298 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-22 11:26:49,298 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:50, output treesize:20 [2019-10-22 11:26:49,330 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:49,331 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-22 11:26:49,331 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8] total 18 [2019-10-22 11:26:49,331 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313815481] [2019-10-22 11:26:49,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-22 11:26:49,332 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:26:49,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-22 11:26:49,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=242, Unknown=2, NotChecked=0, Total=306 [2019-10-22 11:26:49,333 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 18 states. [2019-10-22 11:26:49,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:26:49,930 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-10-22 11:26:49,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 11:26:49,931 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 15 [2019-10-22 11:26:49,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:26:49,931 INFO L225 Difference]: With dead ends: 24 [2019-10-22 11:26:49,931 INFO L226 Difference]: Without dead ends: 22 [2019-10-22 11:26:49,932 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=165, Invalid=433, Unknown=2, NotChecked=0, Total=600 [2019-10-22 11:26:49,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-22 11:26:49,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2019-10-22 11:26:49,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-22 11:26:49,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-10-22 11:26:49,935 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 15 [2019-10-22 11:26:49,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:26:49,935 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-10-22 11:26:49,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-22 11:26:49,935 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-10-22 11:26:49,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 11:26:49,936 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:26:49,936 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-10-22 11:26:50,336 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:26:50,337 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:26:50,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:26:50,337 INFO L82 PathProgramCache]: Analyzing trace with hash -2045993606, now seen corresponding path program 3 times [2019-10-22 11:26:50,337 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:26:50,337 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1739369671] [2019-10-22 11:26:50,338 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_11a51008-1012-42bf-9141-cb048153bdd3/bin/utaipan/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:26:50,433 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-22 11:26:50,433 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 11:26:50,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-22 11:26:50,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:26:50,444 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-22 11:26:50,445 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:50,450 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:50,451 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:26:50,451 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-22 11:26:50,464 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 11 treesize of output 7 [2019-10-22 11:26:50,465 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:50,472 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:50,475 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 11 treesize of output 7 [2019-10-22 11:26:50,475 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:50,483 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:50,484 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:26:50,484 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:25 [2019-10-22 11:26:50,503 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:50,503 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-10-22 11:26:50,503 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:50,511 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:50,511 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:26:50,512 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:22 [2019-10-22 11:26:50,554 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 23 treesize of output 11 [2019-10-22 11:26:50,555 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:50,612 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:50,620 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 21 treesize of output 20 [2019-10-22 11:26:50,621 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:50,658 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:50,667 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 23 treesize of output 11 [2019-10-22 11:26:50,668 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:50,687 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:50,692 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 21 treesize of output 20 [2019-10-22 11:26:50,692 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:50,708 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:50,709 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:26:50,709 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:75, output treesize:46 [2019-10-22 11:26:50,788 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-22 11:26:50,813 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:50,813 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 75 [2019-10-22 11:26:50,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:50,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:50,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:50,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:50,818 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:26:50,854 INFO L567 ElimStorePlain]: treesize reduction 36, result has 52.0 percent of original size [2019-10-22 11:26:50,861 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:50,861 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2019-10-22 11:26:50,862 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:50,867 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:50,867 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:26:50,867 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:88, output treesize:7 [2019-10-22 11:26:50,869 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:50,869 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:26:50,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:50,973 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:26:50,982 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:51,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:51,027 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:51,030 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:26:51,043 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:51,044 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-10-22 11:26:51,044 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:105, output treesize:45 [2019-10-22 11:26:51,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:53,301 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:53,687 WARN L191 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-10-22 11:26:53,687 INFO L567 ElimStorePlain]: treesize reduction 128, result has 46.4 percent of original size [2019-10-22 11:26:53,694 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:53,892 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-10-22 11:26:53,892 INFO L567 ElimStorePlain]: treesize reduction 28, result has 81.5 percent of original size [2019-10-22 11:26:53,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:26:53,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:53,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:26:53,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:53,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:53,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:53,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:53,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:26:53,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:53,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:53,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:53,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:53,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:26:53,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:53,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:53,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:53,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:53,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:26:53,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:53,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:53,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:53,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:53,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:26:53,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:53,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:53,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:53,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:53,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:26:53,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:53,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:53,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:53,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:53,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:26:53,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:53,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:26:53,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:26:53,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:26:53,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:26:53,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:26:53,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:26:53,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:26:53,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:26:53,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:26:53,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:26:53,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:26:53,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:26:53,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:26:53,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:26:53,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:26:53,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:26:53,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:26:53,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:26:53,935 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 18 dim-0 vars, and 8 xjuncts. [2019-10-22 11:26:53,935 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:99, output treesize:334 [2019-10-22 11:26:53,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:26:53,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:53,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:26:53,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:53,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:53,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:53,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:53,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:26:53,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:26:53,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:53,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:26:53,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:53,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:53,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:53,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:26:53,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:26:53,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:26:56,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:56,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:56,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:26:56,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:56,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:56,160 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:56,161 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1739369671] [2019-10-22 11:26:56,161 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468411995] [2019-10-22 11:26:56,161 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_11a51008-1012-42bf-9141-cb048153bdd3/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:26:56,212 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-22 11:26:56,212 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 11:26:56,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-22 11:26:56,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:26:56,218 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-22 11:26:56,218 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:56,224 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:56,224 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:26:56,224 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-22 11:26:56,229 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 11 treesize of output 7 [2019-10-22 11:26:56,229 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:56,238 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:56,243 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 11 treesize of output 7 [2019-10-22 11:26:56,243 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:56,253 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:56,253 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:26:56,253 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:25 [2019-10-22 11:26:56,267 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:56,267 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-10-22 11:26:56,268 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:56,276 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:56,276 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:26:56,277 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:25 [2019-10-22 11:26:56,321 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 23 treesize of output 11 [2019-10-22 11:26:56,321 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:56,368 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:56,373 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 19 treesize of output 18 [2019-10-22 11:26:56,373 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:56,400 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:56,407 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 23 treesize of output 11 [2019-10-22 11:26:56,407 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:56,421 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:56,424 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 19 treesize of output 18 [2019-10-22 11:26:56,424 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:56,434 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:56,435 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:26:56,435 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:74, output treesize:41 [2019-10-22 11:26:56,574 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-22 11:26:56,594 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-10-22 11:26:56,594 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 45 [2019-10-22 11:26:56,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:56,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:56,596 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:26:56,614 INFO L567 ElimStorePlain]: treesize reduction 8, result has 81.4 percent of original size [2019-10-22 11:26:56,620 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:56,620 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2019-10-22 11:26:56,620 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:56,627 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:56,628 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:26:56,628 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:72, output treesize:7 [2019-10-22 11:26:56,629 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:26:56,629 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:26:56,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:56,637 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:56,641 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:26:56,676 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:56,680 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:56,682 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:26:56,694 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:26:56,695 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-10-22 11:26:56,695 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:105, output treesize:45 [2019-10-22 11:26:56,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:58,800 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~t~0.base_20 (_ BitVec 32)) (v_DerPreprocessor_10 (_ BitVec 32))) (or (not (= (select |c_#valid| v_ULTIMATE.start_main_~t~0.base_20) (_ bv0 1))) (= (select (select (store |c_#memory_$Pointer$.base| v_ULTIMATE.start_main_~t~0.base_20 (store (store (select |c_#memory_$Pointer$.base| v_ULTIMATE.start_main_~t~0.base_20) (_ bv0 32) v_DerPreprocessor_10) (_ bv4 32) c_ULTIMATE.start_main_~p~0.base)) c_ULTIMATE.start_main_~p~0.base) (bvadd c_ULTIMATE.start_main_~p~0.offset (_ bv4 32))) (_ bv0 32)))) (forall ((v_DerPreprocessor_8 (_ BitVec 32)) (v_ULTIMATE.start_main_~t~0.base_20 (_ BitVec 32))) (or (not (= (select |c_#valid| v_ULTIMATE.start_main_~t~0.base_20) (_ bv0 1))) (= (select (select (store |c_#memory_$Pointer$.offset| v_ULTIMATE.start_main_~t~0.base_20 (store (store (select |c_#memory_$Pointer$.offset| v_ULTIMATE.start_main_~t~0.base_20) (_ bv0 32) v_DerPreprocessor_8) (_ bv4 32) c_ULTIMATE.start_main_~p~0.offset)) c_ULTIMATE.start_main_~p~0.base) (bvadd c_ULTIMATE.start_main_~p~0.offset (_ bv4 32))) (_ bv0 32))))) is different from false [2019-10-22 11:26:58,825 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:58,980 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-10-22 11:26:58,980 INFO L567 ElimStorePlain]: treesize reduction 24, result has 81.4 percent of original size [2019-10-22 11:26:58,986 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:26:59,149 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-10-22 11:26:59,149 INFO L567 ElimStorePlain]: treesize reduction 134, result has 43.0 percent of original size [2019-10-22 11:26:59,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:59,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:26:59,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:59,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:59,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:26:59,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:59,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:59,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:59,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:59,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:59,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:26:59,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:59,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:26:59,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:59,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:59,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:26:59,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:59,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:59,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:59,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:26:59,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:59,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:59,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:59,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:26:59,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:59,165 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 6 xjuncts. [2019-10-22 11:26:59,166 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:95, output treesize:275 [2019-10-22 11:26:59,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:59,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:59,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:59,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:59,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:59,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:26:59,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:59,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:59,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:26:59,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:59,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:59,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:59,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:59,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:26:59,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:59,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:59,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:59,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:59,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 11:26:59,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:59,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:59,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:59,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:59,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:26:59,542 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2019-10-22 11:26:59,542 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-22 11:26:59,542 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8] total 19 [2019-10-22 11:26:59,543 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964620685] [2019-10-22 11:26:59,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-22 11:26:59,543 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:26:59,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-22 11:26:59,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=252, Unknown=2, NotChecked=32, Total=342 [2019-10-22 11:26:59,544 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 19 states. [2019-10-22 11:27:00,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:27:00,258 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2019-10-22 11:27:00,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:27:00,262 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2019-10-22 11:27:00,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:27:00,263 INFO L225 Difference]: With dead ends: 36 [2019-10-22 11:27:00,263 INFO L226 Difference]: Without dead ends: 24 [2019-10-22 11:27:00,263 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=65, Invalid=279, Unknown=2, NotChecked=34, Total=380 [2019-10-22 11:27:00,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-22 11:27:00,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-10-22 11:27:00,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-22 11:27:00,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2019-10-22 11:27:00,265 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 18 [2019-10-22 11:27:00,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:27:00,265 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-10-22 11:27:00,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-22 11:27:00,266 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2019-10-22 11:27:00,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 11:27:00,266 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:27:00,266 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2019-10-22 11:27:00,667 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:27:00,667 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:27:00,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:27:00,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1299552385, now seen corresponding path program 4 times [2019-10-22 11:27:00,668 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:27:00,668 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [235813449] [2019-10-22 11:27:00,668 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_11a51008-1012-42bf-9141-cb048153bdd3/bin/utaipan/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:27:00,778 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-22 11:27:00,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 11:27:00,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-22 11:27:00,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:27:00,784 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-22 11:27:00,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:27:00,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:27:00,787 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:27:00,788 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-22 11:27:00,803 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2019-10-22 11:27:00,803 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:27:00,809 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:27:00,809 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:27:00,809 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:18 [2019-10-22 11:27:00,833 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:27:00,834 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2019-10-22 11:27:00,834 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:27:00,858 INFO L567 ElimStorePlain]: treesize reduction 14, result has 68.2 percent of original size [2019-10-22 11:27:00,858 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:27:00,858 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2019-10-22 11:27:00,874 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_27|, |v_#memory_$Pointer$.offset_27|], 1=[|v_#memory_int_22|]} [2019-10-22 11:27:00,883 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-22 11:27:00,883 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:27:00,919 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:27:00,924 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-22 11:27:00,924 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:27:00,946 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:27:00,950 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2019-10-22 11:27:00,950 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 11:27:00,963 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:27:00,964 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:27:00,964 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:71, output treesize:55 [2019-10-22 11:27:01,006 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:27:01,006 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2019-10-22 11:27:01,006 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:27:01,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:27:01,022 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:27:01,022 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:65, output treesize:56 [2019-10-22 11:27:01,050 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_28|, |v_#memory_$Pointer$.offset_28|, |v_#memory_$Pointer$.base_29|, |v_#memory_$Pointer$.offset_29|], 3=[|v_#memory_int_23|]} [2019-10-22 11:27:01,059 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:27:01,201 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-10-22 11:27:01,201 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:27:01,205 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:27:01,303 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:27:01,311 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 39 [2019-10-22 11:27:01,311 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 11:27:01,517 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-10-22 11:27:01,517 INFO L567 ElimStorePlain]: treesize reduction 4, result has 96.0 percent of original size [2019-10-22 11:27:01,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:27:01,538 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2019-10-22 11:27:01,539 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-22 11:27:01,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:27:01,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 11:27:01,597 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-10-22 11:27:01,598 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-22 11:27:01,634 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:27:01,634 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:27:01,635 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:123, output treesize:85 [2019-10-22 11:27:01,706 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-22 11:27:01,735 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-10-22 11:27:01,736 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 62 [2019-10-22 11:27:01,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:27:01,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:27:01,738 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:27:01,797 INFO L567 ElimStorePlain]: treesize reduction 4, result has 94.4 percent of original size [2019-10-22 11:27:01,811 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:27:01,811 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2019-10-22 11:27:01,812 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 11:27:01,832 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:27:01,832 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-22 11:27:01,833 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:118, output treesize:43 [2019-10-22 11:27:01,895 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2019-10-22 11:27:01,896 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:27:01,906 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:27:01,907 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 11:27:01,907 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:3 [2019-10-22 11:27:01,930 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:27:01,930 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:27:02,066 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_24|], 3=[|v_#memory_$Pointer$.base_28|, |v_#memory_$Pointer$.offset_28|]} [2019-10-22 11:27:02,070 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:27:02,143 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:27:02,146 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:27:02,188 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:27:02,190 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 11:27:02,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 11:27:02,203 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-22 11:27:02,203 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:95, output treesize:58 [2019-10-22 11:27:05,078 INFO L392 ElimStorePlain]: Different costs {3=[|v_#memory_$Pointer$.base_27|, |v_#memory_$Pointer$.offset_27|], 4=[|v_#memory_int_25|]} [2019-10-22 11:27:05,101 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 11:27:05,604 WARN L191 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2019-10-22 11:27:05,604 INFO L567 ElimStorePlain]: treesize reduction 446, result has 27.6 percent of original size [2019-10-22 11:27:05,805 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:27:05,806 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:275) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:335) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) 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:27:05,809 INFO L168 Benchmark]: Toolchain (without parser) took 31406.92 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 266.3 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -115.9 MB). Peak memory consumption was 150.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:05,809 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:27:05,809 INFO L168 Benchmark]: CACSL2BoogieTranslator took 591.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -158.8 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:05,810 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:27:05,810 INFO L168 Benchmark]: Boogie Preprocessor took 29.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:05,810 INFO L168 Benchmark]: RCFGBuilder took 336.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:05,810 INFO L168 Benchmark]: TraceAbstraction took 30403.18 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 136.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.4 MB). Peak memory consumption was 153.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:27:05,812 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 591.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -158.8 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 336.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 30403.18 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 136.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.4 MB). Peak memory consumption was 153.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...