./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.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_7a54732e-1485-463a-8018-d6e46dee6a3c/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7a54732e-1485-463a-8018-d6e46dee6a3c/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7a54732e-1485-463a-8018-d6e46dee6a3c/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7a54732e-1485-463a-8018-d6e46dee6a3c/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i -s /tmp/vcloud-vcloud-master/worker/working_dir_7a54732e-1485-463a-8018-d6e46dee6a3c/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7a54732e-1485-463a-8018-d6e46dee6a3c/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 3607a70e53f56c4b4860f9fca9676a925474c3df ....................................................................................................................................................................................................................................................................................................................................................................................................... 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_7a54732e-1485-463a-8018-d6e46dee6a3c/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7a54732e-1485-463a-8018-d6e46dee6a3c/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7a54732e-1485-463a-8018-d6e46dee6a3c/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7a54732e-1485-463a-8018-d6e46dee6a3c/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i -s /tmp/vcloud-vcloud-master/worker/working_dir_7a54732e-1485-463a-8018-d6e46dee6a3c/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7a54732e-1485-463a-8018-d6e46dee6a3c/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 3607a70e53f56c4b4860f9fca9676a925474c3df ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:21:48,238 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:21:48,239 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:21:48,248 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:21:48,248 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:21:48,249 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:21:48,250 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:21:48,252 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:21:48,253 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:21:48,254 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:21:48,254 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:21:48,255 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:21:48,256 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:21:48,256 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:21:48,257 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:21:48,258 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:21:48,258 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:21:48,259 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:21:48,260 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:21:48,262 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:21:48,263 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:21:48,264 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:21:48,265 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:21:48,265 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:21:48,267 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:21:48,267 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:21:48,268 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:21:48,268 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:21:48,269 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:21:48,282 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:21:48,282 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:21:48,282 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:21:48,283 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:21:48,283 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:21:48,284 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:21:48,284 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:21:48,285 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:21:48,285 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:21:48,285 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:21:48,286 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:21:48,286 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:21:48,287 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7a54732e-1485-463a-8018-d6e46dee6a3c/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:21:48,303 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:21:48,303 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:21:48,304 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:21:48,304 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:21:48,304 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:21:48,304 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:21:48,304 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:21:48,304 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:21:48,304 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:21:48,310 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:21:48,310 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:21:48,311 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:21:48,311 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:21:48,311 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:21:48,312 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:21:48,312 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:21:48,312 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:21:48,312 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:21:48,312 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:21:48,312 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:21:48,312 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:21:48,312 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:21:48,313 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:21:48,313 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:21:48,313 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:21:48,313 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:21:48,313 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:21:48,313 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:21:48,313 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:21:48,314 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:21:48,314 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:21:48,314 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:21:48,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:21:48,314 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:21:48,314 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:21:48,314 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_7a54732e-1485-463a-8018-d6e46dee6a3c/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 -> 3607a70e53f56c4b4860f9fca9676a925474c3df [2019-10-22 11:21:48,348 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:21:48,365 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:21:48,368 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:21:48,369 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:21:48,370 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:21:48,370 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7a54732e-1485-463a-8018-d6e46dee6a3c/bin/utaipan/../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2019-10-22 11:21:48,416 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7a54732e-1485-463a-8018-d6e46dee6a3c/bin/utaipan/data/8f17e7907/95f02ebc46bf4efca6267543919f959f/FLAG991b702f7 [2019-10-22 11:21:48,764 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:21:48,764 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7a54732e-1485-463a-8018-d6e46dee6a3c/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2019-10-22 11:21:48,770 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7a54732e-1485-463a-8018-d6e46dee6a3c/bin/utaipan/data/8f17e7907/95f02ebc46bf4efca6267543919f959f/FLAG991b702f7 [2019-10-22 11:21:48,782 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7a54732e-1485-463a-8018-d6e46dee6a3c/bin/utaipan/data/8f17e7907/95f02ebc46bf4efca6267543919f959f [2019-10-22 11:21:48,784 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:21:48,785 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:21:48,786 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:21:48,786 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:21:48,789 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:21:48,789 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:21:48" (1/1) ... [2019-10-22 11:21:48,792 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6459d9bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:48, skipping insertion in model container [2019-10-22 11:21:48,792 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:21:48" (1/1) ... [2019-10-22 11:21:48,799 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:21:48,819 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:21:48,993 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:21:48,996 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:21:49,096 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:21:49,108 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:21:49,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:49 WrapperNode [2019-10-22 11:21:49,108 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:21:49,109 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:21:49,109 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:21:49,109 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:21:49,116 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:21:49" (1/1) ... [2019-10-22 11:21:49,121 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:21:49" (1/1) ... [2019-10-22 11:21:49,143 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:21:49,144 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:21:49,144 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:21:49,144 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:21:49,156 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:49" (1/1) ... [2019-10-22 11:21:49,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:49" (1/1) ... [2019-10-22 11:21:49,159 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:49" (1/1) ... [2019-10-22 11:21:49,159 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:49" (1/1) ... [2019-10-22 11:21:49,163 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:49" (1/1) ... [2019-10-22 11:21:49,183 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:49" (1/1) ... [2019-10-22 11:21:49,184 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:49" (1/1) ... [2019-10-22 11:21:49,186 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:21:49,187 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:21:49,187 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:21:49,187 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:21:49,188 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7a54732e-1485-463a-8018-d6e46dee6a3c/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:21:49,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:21:49,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:21:49,574 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:21:49,575 INFO L284 CfgBuilder]: Removed 42 assume(true) statements. [2019-10-22 11:21:49,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:49 BoogieIcfgContainer [2019-10-22 11:21:49,576 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:21:49,577 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:21:49,577 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:21:49,579 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:21:49,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:21:48" (1/3) ... [2019-10-22 11:21:49,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79406a7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:21:49, skipping insertion in model container [2019-10-22 11:21:49,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:49" (2/3) ... [2019-10-22 11:21:49,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79406a7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:21:49, skipping insertion in model container [2019-10-22 11:21:49,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:49" (3/3) ... [2019-10-22 11:21:49,585 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2019-10-22 11:21:49,596 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:21:49,603 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2019-10-22 11:21:49,614 INFO L249 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2019-10-22 11:21:49,643 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:21:49,643 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:21:49,644 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:21:49,644 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:21:49,644 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:21:49,644 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:21:49,644 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:21:49,644 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:21:49,662 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2019-10-22 11:21:49,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-22 11:21:49,671 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:49,672 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:49,675 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:49,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:49,680 INFO L82 PathProgramCache]: Analyzing trace with hash -374051301, now seen corresponding path program 1 times [2019-10-22 11:21:49,692 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:49,693 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827923371] [2019-10-22 11:21:49,693 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:49,694 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:49,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:49,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:49,841 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:21:49,842 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827923371] [2019-10-22 11:21:49,842 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:49,842 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:49,843 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548671289] [2019-10-22 11:21:49,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:49,848 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:49,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:49,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:49,862 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 3 states. [2019-10-22 11:21:49,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:49,963 INFO L93 Difference]: Finished difference Result 171 states and 230 transitions. [2019-10-22 11:21:49,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:49,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-10-22 11:21:49,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:49,974 INFO L225 Difference]: With dead ends: 171 [2019-10-22 11:21:49,974 INFO L226 Difference]: Without dead ends: 83 [2019-10-22 11:21:49,977 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:21:49,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-22 11:21:50,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-10-22 11:21:50,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-10-22 11:21:50,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2019-10-22 11:21:50,012 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 10 [2019-10-22 11:21:50,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:50,013 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2019-10-22 11:21:50,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:50,013 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2019-10-22 11:21:50,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 11:21:50,013 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:50,013 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:50,014 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:50,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:50,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1314109022, now seen corresponding path program 1 times [2019-10-22 11:21:50,015 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:50,015 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140606290] [2019-10-22 11:21:50,015 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:50,016 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:50,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:50,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:50,057 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:21:50,058 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140606290] [2019-10-22 11:21:50,058 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:50,058 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:21:50,058 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608021542] [2019-10-22 11:21:50,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:21:50,060 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:50,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:21:50,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:50,060 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand 5 states. [2019-10-22 11:21:50,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:50,204 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2019-10-22 11:21:50,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:21:50,204 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-10-22 11:21:50,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:50,205 INFO L225 Difference]: With dead ends: 83 [2019-10-22 11:21:50,205 INFO L226 Difference]: Without dead ends: 67 [2019-10-22 11:21:50,206 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:21:50,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-22 11:21:50,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-10-22 11:21:50,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-22 11:21:50,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2019-10-22 11:21:50,214 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 12 [2019-10-22 11:21:50,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:50,215 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2019-10-22 11:21:50,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:21:50,215 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2019-10-22 11:21:50,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 11:21:50,215 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:50,216 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:50,216 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:50,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:50,217 INFO L82 PathProgramCache]: Analyzing trace with hash -168637, now seen corresponding path program 1 times [2019-10-22 11:21:50,217 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:50,217 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721880008] [2019-10-22 11:21:50,217 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:50,217 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:50,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:50,269 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:21:50,269 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721880008] [2019-10-22 11:21:50,270 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:50,270 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:21:50,270 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058376872] [2019-10-22 11:21:50,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:50,271 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:50,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:50,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:50,271 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 4 states. [2019-10-22 11:21:50,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:50,415 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2019-10-22 11:21:50,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:21:50,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-22 11:21:50,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:50,416 INFO L225 Difference]: With dead ends: 88 [2019-10-22 11:21:50,416 INFO L226 Difference]: Without dead ends: 80 [2019-10-22 11:21:50,417 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:21:50,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-10-22 11:21:50,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2019-10-22 11:21:50,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-22 11:21:50,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2019-10-22 11:21:50,427 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 15 [2019-10-22 11:21:50,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:50,427 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2019-10-22 11:21:50,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:50,427 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2019-10-22 11:21:50,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 11:21:50,428 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:50,428 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:50,428 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:50,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:50,429 INFO L82 PathProgramCache]: Analyzing trace with hash -749433183, now seen corresponding path program 1 times [2019-10-22 11:21:50,429 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:50,430 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119510108] [2019-10-22 11:21:50,430 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:50,430 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:50,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:50,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:50,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 11:21:50,495 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119510108] [2019-10-22 11:21:50,496 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544322315] [2019-10-22 11:21:50,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7a54732e-1485-463a-8018-d6e46dee6a3c/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:21:50,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:50,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-22 11:21:50,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:21:50,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:50,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 11:21:50,604 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:21:50,645 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 11:21:50,646 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [64214332] [2019-10-22 11:21:50,652 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 27 [2019-10-22 11:21:50,702 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-10-22 11:21:50,704 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-22 11:21:50,981 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 11:21:50,982 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:21:50,987 INFO L168 Benchmark]: Toolchain (without parser) took 2201.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 943.1 MB in the beginning and 992.7 MB in the end (delta: -49.5 MB). Peak memory consumption was 96.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:50,988 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 960.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:21:50,988 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 941.8 MB in the beginning and 1.1 GB in the end (delta: -201.2 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:50,989 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:50,990 INFO L168 Benchmark]: Boogie Preprocessor took 42.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:50,990 INFO L168 Benchmark]: RCFGBuilder took 389.00 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: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:50,991 INFO L168 Benchmark]: TraceAbstraction took 1408.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 992.7 MB in the end (delta: 117.1 MB). Peak memory consumption was 117.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:50,994 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 960.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 322.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 941.8 MB in the beginning and 1.1 GB in the end (delta: -201.2 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 389.00 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: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1408.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 992.7 MB in the end (delta: 117.1 MB). Peak memory consumption was 117.1 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:21:53,024 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:21:53,026 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:21:53,034 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:21:53,035 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:21:53,036 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:21:53,037 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:21:53,038 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:21:53,040 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:21:53,040 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:21:53,041 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:21:53,042 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:21:53,042 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:21:53,043 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:21:53,044 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:21:53,045 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:21:53,045 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:21:53,046 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:21:53,047 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:21:53,049 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:21:53,050 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:21:53,051 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:21:53,052 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:21:53,053 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:21:53,055 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:21:53,055 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:21:53,055 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:21:53,056 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:21:53,057 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:21:53,058 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:21:53,058 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:21:53,058 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:21:53,059 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:21:53,060 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:21:53,060 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:21:53,061 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:21:53,061 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:21:53,062 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:21:53,062 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:21:53,062 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:21:53,063 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:21:53,064 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7a54732e-1485-463a-8018-d6e46dee6a3c/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-10-22 11:21:53,075 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:21:53,075 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:21:53,076 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:21:53,076 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:21:53,076 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:21:53,076 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:21:53,077 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:21:53,077 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:21:53,077 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:21:53,078 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:21:53,078 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:21:53,078 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:21:53,078 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:21:53,078 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:21:53,078 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:21:53,079 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:21:53,079 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-10-22 11:21:53,079 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-10-22 11:21:53,079 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:21:53,079 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:21:53,079 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 11:21:53,079 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:21:53,080 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:21:53,080 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:21:53,080 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:21:53,080 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:21:53,080 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:21:53,080 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:21:53,081 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:21:53,081 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:21:53,081 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-10-22 11:21:53,082 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-10-22 11:21:53,082 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:21:53,082 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:21:53,082 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_7a54732e-1485-463a-8018-d6e46dee6a3c/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 -> 3607a70e53f56c4b4860f9fca9676a925474c3df [2019-10-22 11:21:53,108 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:21:53,117 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:21:53,120 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:21:53,122 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:21:53,122 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:21:53,123 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7a54732e-1485-463a-8018-d6e46dee6a3c/bin/utaipan/../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2019-10-22 11:21:53,174 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7a54732e-1485-463a-8018-d6e46dee6a3c/bin/utaipan/data/f2dcf9f57/921180279ab44114bff1c9cd578fc468/FLAGc8e550d32 [2019-10-22 11:21:53,546 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:21:53,547 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7a54732e-1485-463a-8018-d6e46dee6a3c/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2019-10-22 11:21:53,556 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7a54732e-1485-463a-8018-d6e46dee6a3c/bin/utaipan/data/f2dcf9f57/921180279ab44114bff1c9cd578fc468/FLAGc8e550d32 [2019-10-22 11:21:53,572 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7a54732e-1485-463a-8018-d6e46dee6a3c/bin/utaipan/data/f2dcf9f57/921180279ab44114bff1c9cd578fc468 [2019-10-22 11:21:53,574 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:21:53,576 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:21:53,577 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:21:53,581 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:21:53,584 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:21:53,585 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:21:53" (1/1) ... [2019-10-22 11:21:53,588 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@edd508b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:53, skipping insertion in model container [2019-10-22 11:21:53,588 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:21:53" (1/1) ... [2019-10-22 11:21:53,595 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:21:53,612 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:21:53,790 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:21:53,798 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:21:53,824 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:21:53,843 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:21:53,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:53 WrapperNode [2019-10-22 11:21:53,844 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:21:53,844 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:21:53,845 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:21:53,845 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:21:53,905 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:21:53" (1/1) ... [2019-10-22 11:21:53,912 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:21:53" (1/1) ... [2019-10-22 11:21:53,937 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:21:53,938 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:21:53,938 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:21:53,938 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:21:53,948 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:53" (1/1) ... [2019-10-22 11:21:53,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:53" (1/1) ... [2019-10-22 11:21:53,951 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:53" (1/1) ... [2019-10-22 11:21:53,952 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:53" (1/1) ... [2019-10-22 11:21:53,963 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:53" (1/1) ... [2019-10-22 11:21:53,977 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:53" (1/1) ... [2019-10-22 11:21:53,979 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:53" (1/1) ... [2019-10-22 11:21:53,988 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:21:53,988 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:21:53,988 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:21:53,988 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:21:53,989 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7a54732e-1485-463a-8018-d6e46dee6a3c/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:21:54,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:21:54,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:21:54,351 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:21:54,351 INFO L284 CfgBuilder]: Removed 42 assume(true) statements. [2019-10-22 11:21:54,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:54 BoogieIcfgContainer [2019-10-22 11:21:54,353 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:21:54,354 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:21:54,354 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:21:54,357 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:21:54,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:21:53" (1/3) ... [2019-10-22 11:21:54,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3390fb95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:21:54, skipping insertion in model container [2019-10-22 11:21:54,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:21:53" (2/3) ... [2019-10-22 11:21:54,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3390fb95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:21:54, skipping insertion in model container [2019-10-22 11:21:54,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:54" (3/3) ... [2019-10-22 11:21:54,360 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2019-10-22 11:21:54,369 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:21:54,376 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2019-10-22 11:21:54,392 INFO L249 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2019-10-22 11:21:54,432 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:21:54,441 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:21:54,441 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:21:54,441 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:21:54,441 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:21:54,441 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:21:54,441 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:21:54,441 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:21:54,460 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2019-10-22 11:21:54,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-22 11:21:54,467 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:54,468 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:54,471 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:54,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:54,476 INFO L82 PathProgramCache]: Analyzing trace with hash -374051301, now seen corresponding path program 1 times [2019-10-22 11:21:54,483 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:21:54,484 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1288966636] [2019-10-22 11:21:54,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7a54732e-1485-463a-8018-d6e46dee6a3c/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:21:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:54,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 11:21:54,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:21:54,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:54,701 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:21:54,701 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:21:54,961 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:21:54,962 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1288966636] [2019-10-22 11:21:54,964 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:54,964 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 5] imperfect sequences [] total 10 [2019-10-22 11:21:54,965 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614555610] [2019-10-22 11:21:54,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 11:21:54,968 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:21:54,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 11:21:54,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:21:54,979 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 10 states. [2019-10-22 11:21:55,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:55,727 INFO L93 Difference]: Finished difference Result 185 states and 239 transitions. [2019-10-22 11:21:55,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:21:55,729 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-10-22 11:21:55,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:55,739 INFO L225 Difference]: With dead ends: 185 [2019-10-22 11:21:55,739 INFO L226 Difference]: Without dead ends: 81 [2019-10-22 11:21:55,743 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-10-22 11:21:55,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-10-22 11:21:55,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-10-22 11:21:55,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-22 11:21:55,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2019-10-22 11:21:55,791 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 10 [2019-10-22 11:21:55,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:55,792 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2019-10-22 11:21:55,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 11:21:55,792 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2019-10-22 11:21:55,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 11:21:55,793 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:55,793 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:55,994 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:55,995 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:55,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:55,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1314109022, now seen corresponding path program 1 times [2019-10-22 11:21:55,996 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:21:55,996 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1397631123] [2019-10-22 11:21:55,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7a54732e-1485-463a-8018-d6e46dee6a3c/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:21:56,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:56,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 11:21:56,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:21:56,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:56,089 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:21:56,089 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:21:56,141 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:21:56,141 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1397631123] [2019-10-22 11:21:56,142 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:56,142 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 9 [2019-10-22 11:21:56,142 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244223377] [2019-10-22 11:21:56,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:21:56,144 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:21:56,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:21:56,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:21:56,145 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand 9 states. [2019-10-22 11:21:56,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:56,818 INFO L93 Difference]: Finished difference Result 193 states and 202 transitions. [2019-10-22 11:21:56,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-22 11:21:56,818 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2019-10-22 11:21:56,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:56,820 INFO L225 Difference]: With dead ends: 193 [2019-10-22 11:21:56,820 INFO L226 Difference]: Without dead ends: 183 [2019-10-22 11:21:56,821 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2019-10-22 11:21:56,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-10-22 11:21:56,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 90. [2019-10-22 11:21:56,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-10-22 11:21:56,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2019-10-22 11:21:56,836 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 12 [2019-10-22 11:21:56,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:56,836 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2019-10-22 11:21:56,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:21:56,836 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2019-10-22 11:21:56,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-22 11:21:56,837 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:56,837 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:57,038 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:57,038 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:57,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:57,039 INFO L82 PathProgramCache]: Analyzing trace with hash 138543875, now seen corresponding path program 1 times [2019-10-22 11:21:57,040 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:21:57,040 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2122690301] [2019-10-22 11:21:57,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7a54732e-1485-463a-8018-d6e46dee6a3c/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:21:57,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:57,112 WARN L254 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-22 11:21:57,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:21:57,290 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 17 [2019-10-22 11:21:57,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:57,372 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:21:57,372 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:21:57,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:57,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:57,572 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:21:57,572 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2122690301] [2019-10-22 11:21:57,572 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:57,572 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9, 7] imperfect sequences [] total 14 [2019-10-22 11:21:57,573 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136706580] [2019-10-22 11:21:57,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-22 11:21:57,573 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:21:57,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-22 11:21:57,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-10-22 11:21:57,574 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand 14 states. [2019-10-22 11:21:58,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:58,455 INFO L93 Difference]: Finished difference Result 142 states and 154 transitions. [2019-10-22 11:21:58,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-22 11:21:58,456 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-10-22 11:21:58,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:58,457 INFO L225 Difference]: With dead ends: 142 [2019-10-22 11:21:58,457 INFO L226 Difference]: Without dead ends: 130 [2019-10-22 11:21:58,458 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=206, Invalid=444, Unknown=0, NotChecked=0, Total=650 [2019-10-22 11:21:58,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-10-22 11:21:58,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 88. [2019-10-22 11:21:58,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-10-22 11:21:58,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2019-10-22 11:21:58,479 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 14 [2019-10-22 11:21:58,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:58,481 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2019-10-22 11:21:58,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-22 11:21:58,482 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2019-10-22 11:21:58,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 11:21:58,482 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:58,482 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:58,683 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:21:58,683 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:58,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:58,684 INFO L82 PathProgramCache]: Analyzing trace with hash 655326592, now seen corresponding path program 1 times [2019-10-22 11:21:58,684 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:21:58,684 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1595988714] [2019-10-22 11:21:58,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7a54732e-1485-463a-8018-d6e46dee6a3c/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:21:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:58,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-22 11:21:58,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:21:59,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:59,079 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:21:59,079 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:21:59,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:59,315 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:21:59,315 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1595988714] [2019-10-22 11:21:59,316 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329602262] [2019-10-22 11:21:59,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7a54732e-1485-463a-8018-d6e46dee6a3c/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:21:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:59,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-22 11:21:59,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:21:59,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:59,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:21:59,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:00,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:00,295 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:22:00,295 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:22:00,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:00,316 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:22:00,316 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-22 11:22:00,317 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 15, 7] total 23 [2019-10-22 11:22:00,317 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417842764] [2019-10-22 11:22:00,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-22 11:22:00,317 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:22:00,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-22 11:22:00,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2019-10-22 11:22:00,318 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand 23 states. [2019-10-22 11:22:00,709 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 19 [2019-10-22 11:22:01,262 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-10-22 11:22:02,816 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 22 [2019-10-22 11:22:03,036 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 24 [2019-10-22 11:22:06,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:06,407 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2019-10-22 11:22:06,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 11:22:06,408 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 25 [2019-10-22 11:22:06,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:06,408 INFO L225 Difference]: With dead ends: 98 [2019-10-22 11:22:06,409 INFO L226 Difference]: Without dead ends: 78 [2019-10-22 11:22:06,409 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 72 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=238, Invalid=574, Unknown=0, NotChecked=0, Total=812 [2019-10-22 11:22:06,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-22 11:22:06,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 51. [2019-10-22 11:22:06,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-22 11:22:06,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2019-10-22 11:22:06,416 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 25 [2019-10-22 11:22:06,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:06,417 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2019-10-22 11:22:06,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-22 11:22:06,417 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2019-10-22 11:22:06,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-22 11:22:06,418 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:06,418 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:06,818 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:22:06,819 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:06,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:06,819 INFO L82 PathProgramCache]: Analyzing trace with hash 971238760, now seen corresponding path program 1 times [2019-10-22 11:22:06,820 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:22:06,820 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1028503727] [2019-10-22 11:22:06,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7a54732e-1485-463a-8018-d6e46dee6a3c/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:22:06,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:06,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:22:06,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:22:06,874 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:22:06,874 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:22:06,876 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:22:06,877 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1028503727] [2019-10-22 11:22:06,877 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:06,877 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-10-22 11:22:06,877 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862436675] [2019-10-22 11:22:06,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:22:06,879 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:22:06,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:22:06,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:22:06,880 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 3 states. [2019-10-22 11:22:06,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:06,940 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2019-10-22 11:22:06,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:22:06,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-10-22 11:22:06,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:06,943 INFO L225 Difference]: With dead ends: 81 [2019-10-22 11:22:06,943 INFO L226 Difference]: Without dead ends: 51 [2019-10-22 11:22:06,943 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 69 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:22:06,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-22 11:22:06,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-10-22 11:22:06,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-22 11:22:06,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2019-10-22 11:22:06,955 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 36 [2019-10-22 11:22:06,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:06,956 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2019-10-22 11:22:06,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:22:06,956 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2019-10-22 11:22:06,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-22 11:22:06,957 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:06,957 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:07,157 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:22:07,158 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:07,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:07,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1604778036, now seen corresponding path program 1 times [2019-10-22 11:22:07,158 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:22:07,158 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1148212755] [2019-10-22 11:22:07,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7a54732e-1485-463a-8018-d6e46dee6a3c/bin/utaipan/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:22:07,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:07,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 11:22:07,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:22:07,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:22:07,287 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:22:07,287 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:22:07,408 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:22:07,408 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1148212755] [2019-10-22 11:22:07,408 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:07,408 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2019-10-22 11:22:07,408 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563325417] [2019-10-22 11:22:07,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-22 11:22:07,411 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:22:07,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-22 11:22:07,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-10-22 11:22:07,411 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 11 states. [2019-10-22 11:22:07,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:07,681 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2019-10-22 11:22:07,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 11:22:07,682 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2019-10-22 11:22:07,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:07,682 INFO L225 Difference]: With dead ends: 60 [2019-10-22 11:22:07,682 INFO L226 Difference]: Without dead ends: 58 [2019-10-22 11:22:07,683 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-10-22 11:22:07,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-10-22 11:22:07,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2019-10-22 11:22:07,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-22 11:22:07,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2019-10-22 11:22:07,689 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 37 [2019-10-22 11:22:07,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:07,690 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2019-10-22 11:22:07,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-22 11:22:07,690 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2019-10-22 11:22:07,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-22 11:22:07,690 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:22:07,690 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:22:07,891 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:22:07,891 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:22:07,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:22:07,892 INFO L82 PathProgramCache]: Analyzing trace with hash -298270705, now seen corresponding path program 1 times [2019-10-22 11:22:07,892 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:22:07,892 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1288051371] [2019-10-22 11:22:07,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7a54732e-1485-463a-8018-d6e46dee6a3c/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:22:07,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:22:07,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 11:22:07,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:22:07,988 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:22:07,988 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:22:08,011 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:22:08,011 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1288051371] [2019-10-22 11:22:08,011 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:22:08,012 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-10-22 11:22:08,012 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984869810] [2019-10-22 11:22:08,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 11:22:08,012 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:22:08,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 11:22:08,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:22:08,012 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 8 states. [2019-10-22 11:22:08,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:22:08,199 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2019-10-22 11:22:08,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-22 11:22:08,200 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2019-10-22 11:22:08,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:22:08,200 INFO L225 Difference]: With dead ends: 77 [2019-10-22 11:22:08,200 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 11:22:08,201 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2019-10-22 11:22:08,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 11:22:08,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 11:22:08,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 11:22:08,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 11:22:08,202 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2019-10-22 11:22:08,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:22:08,202 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 11:22:08,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 11:22:08,202 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 11:22:08,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 11:22:08,403 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-10-22 11:22:08,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 11:22:08,998 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 26 [2019-10-22 11:22:09,493 WARN L191 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 33 [2019-10-22 11:22:09,754 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 26 [2019-10-22 11:22:09,963 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 27 [2019-10-22 11:22:10,177 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 29 [2019-10-22 11:22:10,345 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 26 [2019-10-22 11:22:10,723 WARN L191 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 33 [2019-10-22 11:22:10,912 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 25 [2019-10-22 11:22:11,295 WARN L191 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 34 [2019-10-22 11:22:11,515 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 25 [2019-10-22 11:22:11,808 WARN L191 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 29 [2019-10-22 11:22:12,030 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 26 [2019-10-22 11:22:12,505 WARN L191 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 34 [2019-10-22 11:22:12,652 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2019-10-22 11:22:12,792 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 29 [2019-10-22 11:22:12,795 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 11:22:12,795 INFO L443 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2019-10-22 11:22:12,796 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 11:22:12,796 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 11:22:12,796 INFO L443 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2019-10-22 11:22:12,796 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-10-22 11:22:12,796 INFO L439 ceAbstractionStarter]: At program point L4-2(lines 3 8) the Hoare annotation is: (let ((.cse0 (bvadd ULTIMATE.start_main_~cp~0 (_ bv4294967295 32)))) (and (bvsle ULTIMATE.start_main_~urilen~0 (_ bv1000000 32)) (bvsle ULTIMATE.start_main_~scheme~0 (_ bv1000000 32)) (bvsgt ULTIMATE.start_main_~tokenlen~0 (_ bv0 32)) (bvslt .cse0 ULTIMATE.start_main_~urilen~0) (= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt (bvadd ULTIMATE.start_main_~urilen~0 (_ bv4294967295 32)) ULTIMATE.start_main_~cp~0)) (bvsge .cse0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~scheme~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~tokenlen~0 (_ bv1000000 32)))) [2019-10-22 11:22:12,796 INFO L443 ceAbstractionStarter]: For program point L4-3(lines 4 6) no Hoare annotation was computed. [2019-10-22 11:22:12,796 INFO L439 ceAbstractionStarter]: At program point L4-5(lines 30 66) the Hoare annotation is: (let ((.cse0 (bvadd ULTIMATE.start_main_~cp~0 (_ bv4294967295 32)))) (and (bvsle ULTIMATE.start_main_~urilen~0 (_ bv1000000 32)) (bvsle ULTIMATE.start_main_~scheme~0 (_ bv1000000 32)) (bvsgt ULTIMATE.start_main_~tokenlen~0 (_ bv0 32)) (bvslt .cse0 ULTIMATE.start_main_~urilen~0) (= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt (bvadd ULTIMATE.start_main_~urilen~0 (_ bv4294967295 32)) ULTIMATE.start_main_~cp~0)) (bvsge .cse0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~scheme~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~tokenlen~0 (_ bv1000000 32)))) [2019-10-22 11:22:12,796 INFO L443 ceAbstractionStarter]: For program point L4-6(lines 4 6) no Hoare annotation was computed. [2019-10-22 11:22:12,797 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 11:22:12,797 INFO L439 ceAbstractionStarter]: At program point L4-8(lines 3 8) the Hoare annotation is: (let ((.cse0 (bvadd ULTIMATE.start_main_~cp~0 (_ bv4294967295 32)))) (and (bvsle ULTIMATE.start_main_~urilen~0 (_ bv1000000 32)) (bvsle ULTIMATE.start_main_~scheme~0 (_ bv1000000 32)) (bvsgt ULTIMATE.start_main_~tokenlen~0 (_ bv0 32)) (bvslt .cse0 ULTIMATE.start_main_~urilen~0) (= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt (bvadd ULTIMATE.start_main_~urilen~0 (_ bv4294967295 32)) ULTIMATE.start_main_~cp~0)) (bvsge .cse0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~scheme~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~tokenlen~0 (_ bv1000000 32)))) [2019-10-22 11:22:12,797 INFO L443 ceAbstractionStarter]: For program point L4-9(lines 4 6) no Hoare annotation was computed. [2019-10-22 11:22:12,797 INFO L443 ceAbstractionStarter]: For program point L4-12(lines 4 6) no Hoare annotation was computed. [2019-10-22 11:22:12,797 INFO L439 ceAbstractionStarter]: At program point L4-14(lines 3 8) the Hoare annotation is: (let ((.cse0 (bvadd ULTIMATE.start_main_~urilen~0 (_ bv4294967295 32))) (.cse1 (bvadd ULTIMATE.start_main_~cp~0 (_ bv4294967295 32)))) (and (bvsle ULTIMATE.start_main_~urilen~0 (_ bv1000000 32)) (bvsle ULTIMATE.start_main_~scheme~0 (_ bv1000000 32)) (not (= .cse0 ULTIMATE.start_main_~cp~0)) (bvsgt ULTIMATE.start_main_~tokenlen~0 (_ bv0 32)) (bvslt .cse1 ULTIMATE.start_main_~urilen~0) (= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt .cse0 ULTIMATE.start_main_~cp~0)) (bvsge .cse1 (_ bv0 32)) (bvsge ULTIMATE.start_main_~scheme~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~tokenlen~0 (_ bv1000000 32)))) [2019-10-22 11:22:12,797 INFO L443 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2019-10-22 11:22:12,797 INFO L443 ceAbstractionStarter]: For program point L4-15(lines 4 6) no Hoare annotation was computed. [2019-10-22 11:22:12,797 INFO L443 ceAbstractionStarter]: For program point L21-1(lines 11 69) no Hoare annotation was computed. [2019-10-22 11:22:12,797 INFO L439 ceAbstractionStarter]: At program point L4-17(lines 3 8) the Hoare annotation is: (let ((.cse0 (bvadd ULTIMATE.start_main_~urilen~0 (_ bv4294967295 32))) (.cse1 (bvadd ULTIMATE.start_main_~cp~0 (_ bv4294967295 32)))) (and (bvsle ULTIMATE.start_main_~urilen~0 (_ bv1000000 32)) (not (= .cse0 ULTIMATE.start_main_~cp~0)) (bvsle ULTIMATE.start_main_~scheme~0 (_ bv1000000 32)) (bvsgt ULTIMATE.start_main_~tokenlen~0 (_ bv0 32)) (bvslt .cse1 ULTIMATE.start_main_~urilen~0) (= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt .cse0 ULTIMATE.start_main_~cp~0)) (bvsge .cse1 (_ bv0 32)) (bvsge ULTIMATE.start_main_~scheme~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~tokenlen~0 (_ bv1000000 32)))) [2019-10-22 11:22:12,798 INFO L443 ceAbstractionStarter]: For program point L4-18(lines 4 6) no Hoare annotation was computed. [2019-10-22 11:22:12,798 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 11:22:12,798 INFO L439 ceAbstractionStarter]: At program point L4-20(lines 3 8) the Hoare annotation is: (let ((.cse1 (bvadd ULTIMATE.start_main_~urilen~0 (_ bv4294967295 32)))) (let ((.cse0 (let ((.cse2 (bvadd ULTIMATE.start_main_~cp~0 (_ bv4294967295 32)))) (and (bvsle ULTIMATE.start_main_~urilen~0 (_ bv1000000 32)) (bvsle ULTIMATE.start_main_~scheme~0 (_ bv1000000 32)) (bvslt .cse2 ULTIMATE.start_main_~urilen~0) (= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt .cse1 ULTIMATE.start_main_~cp~0)) (bvsge .cse2 (_ bv0 32)) (bvsge ULTIMATE.start_main_~scheme~0 (_ bv0 32)))))) (or (and .cse0 (bvsgt ULTIMATE.start_main_~tokenlen~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~tokenlen~0 (_ bv1000000 32))) (and (= .cse1 ULTIMATE.start_main_~cp~0) .cse0)))) [2019-10-22 11:22:12,798 INFO L443 ceAbstractionStarter]: For program point L4-21(lines 4 6) no Hoare annotation was computed. [2019-10-22 11:22:12,798 INFO L439 ceAbstractionStarter]: At program point L4-23(line 41) the Hoare annotation is: (let ((.cse1 (bvadd ULTIMATE.start_main_~urilen~0 (_ bv4294967295 32)))) (let ((.cse0 (let ((.cse2 (bvadd ULTIMATE.start_main_~cp~0 (_ bv4294967295 32)))) (and (bvsle ULTIMATE.start_main_~urilen~0 (_ bv1000000 32)) (bvsle ULTIMATE.start_main_~scheme~0 (_ bv1000000 32)) (bvslt .cse2 ULTIMATE.start_main_~urilen~0) (= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt .cse1 ULTIMATE.start_main_~cp~0)) (bvsge .cse2 (_ bv0 32)) (bvsge ULTIMATE.start_main_~scheme~0 (_ bv0 32)))))) (or (and .cse0 (bvsgt ULTIMATE.start_main_~tokenlen~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~tokenlen~0 (_ bv1000000 32))) (and (= .cse1 ULTIMATE.start_main_~cp~0) .cse0)))) [2019-10-22 11:22:12,798 INFO L443 ceAbstractionStarter]: For program point L4-24(lines 4 6) no Hoare annotation was computed. [2019-10-22 11:22:12,798 INFO L439 ceAbstractionStarter]: At program point L4-26(lines 3 8) the Hoare annotation is: (let ((.cse0 (bvadd ULTIMATE.start_main_~urilen~0 (_ bv4294967295 32))) (.cse1 (bvadd ULTIMATE.start_main_~cp~0 (_ bv4294967295 32)))) (and (bvsle ULTIMATE.start_main_~urilen~0 (_ bv1000000 32)) (bvsle ULTIMATE.start_main_~scheme~0 (_ bv1000000 32)) (not (= .cse0 ULTIMATE.start_main_~cp~0)) (bvsgt ULTIMATE.start_main_~tokenlen~0 (_ bv0 32)) (bvslt .cse1 ULTIMATE.start_main_~urilen~0) (= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt .cse0 ULTIMATE.start_main_~cp~0)) (bvsge .cse1 (_ bv0 32)) (bvsge ULTIMATE.start_main_~scheme~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~tokenlen~0 (_ bv1000000 32)))) [2019-10-22 11:22:12,799 INFO L443 ceAbstractionStarter]: For program point L4-27(lines 4 6) no Hoare annotation was computed. [2019-10-22 11:22:12,799 INFO L439 ceAbstractionStarter]: At program point L4-29(line 44) the Hoare annotation is: (let ((.cse0 (bvadd ULTIMATE.start_main_~urilen~0 (_ bv4294967295 32))) (.cse1 (bvadd ULTIMATE.start_main_~cp~0 (_ bv4294967295 32)))) (and (bvsle ULTIMATE.start_main_~urilen~0 (_ bv1000000 32)) (not (= .cse0 ULTIMATE.start_main_~cp~0)) (bvsle ULTIMATE.start_main_~scheme~0 (_ bv1000000 32)) (bvsgt ULTIMATE.start_main_~tokenlen~0 (_ bv0 32)) (bvslt .cse1 ULTIMATE.start_main_~urilen~0) (= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt .cse0 ULTIMATE.start_main_~cp~0)) (bvsge .cse1 (_ bv0 32)) (bvsge ULTIMATE.start_main_~scheme~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~tokenlen~0 (_ bv1000000 32)))) [2019-10-22 11:22:12,799 INFO L443 ceAbstractionStarter]: For program point L4-30(lines 4 6) no Hoare annotation was computed. [2019-10-22 11:22:12,799 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-10-22 11:22:12,799 INFO L443 ceAbstractionStarter]: For program point L5-1(line 5) no Hoare annotation was computed. [2019-10-22 11:22:12,799 INFO L439 ceAbstractionStarter]: At program point L4-32(lines 3 8) the Hoare annotation is: (let ((.cse0 (bvadd ULTIMATE.start_main_~urilen~0 (_ bv4294967295 32)))) (and (= (_ bv0 32) ULTIMATE.start_main_~c~0) (bvsle ULTIMATE.start_main_~urilen~0 (_ bv1000000 32)) (bvsge (bvadd ULTIMATE.start_main_~cp~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle ULTIMATE.start_main_~scheme~0 (_ bv1000000 32)) (not (= .cse0 ULTIMATE.start_main_~cp~0)) (bvsgt ULTIMATE.start_main_~tokenlen~0 (_ bv0 32)) (bvslt (bvadd ULTIMATE.start_main_~cp~0 (_ bv4294967295 32)) ULTIMATE.start_main_~urilen~0) (= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt .cse0 ULTIMATE.start_main_~cp~0)) (bvsge ULTIMATE.start_main_~scheme~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~tokenlen~0 (_ bv1000000 32)) (bvsge ULTIMATE.start_main_~cp~0 (_ bv0 32)))) [2019-10-22 11:22:12,799 INFO L443 ceAbstractionStarter]: For program point L5-2(line 5) no Hoare annotation was computed. [2019-10-22 11:22:12,799 INFO L443 ceAbstractionStarter]: For program point L4-33(lines 4 6) no Hoare annotation was computed. [2019-10-22 11:22:12,799 INFO L443 ceAbstractionStarter]: For program point L5-3(line 5) no Hoare annotation was computed. [2019-10-22 11:22:12,800 INFO L443 ceAbstractionStarter]: For program point L5-4(line 5) no Hoare annotation was computed. [2019-10-22 11:22:12,800 INFO L443 ceAbstractionStarter]: For program point L5-5(line 5) no Hoare annotation was computed. [2019-10-22 11:22:12,800 INFO L443 ceAbstractionStarter]: For program point L4-36(lines 4 6) no Hoare annotation was computed. [2019-10-22 11:22:12,800 INFO L443 ceAbstractionStarter]: For program point L5-6(line 5) no Hoare annotation was computed. [2019-10-22 11:22:12,800 INFO L443 ceAbstractionStarter]: For program point L5-7(line 5) no Hoare annotation was computed. [2019-10-22 11:22:12,800 INFO L439 ceAbstractionStarter]: At program point L4-38(lines 3 8) the Hoare annotation is: (let ((.cse0 (bvadd ULTIMATE.start_main_~c~0 (_ bv1 32))) (.cse1 (bvadd ULTIMATE.start_main_~urilen~0 (_ bv4294967295 32)))) (and (bvsle ULTIMATE.start_main_~scheme~0 (_ bv1000000 32)) (= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (bvsge ULTIMATE.start_main_~scheme~0 (_ bv0 32)) (bvslt .cse0 ULTIMATE.start_main_~tokenlen~0) (bvsle ULTIMATE.start_main_~urilen~0 (_ bv1000000 32)) (bvsge (bvadd ULTIMATE.start_main_~cp~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle (_ bv0 32) .cse0) (not (= .cse1 ULTIMATE.start_main_~cp~0)) (bvslt (bvadd ULTIMATE.start_main_~cp~0 (_ bv4294967295 32)) ULTIMATE.start_main_~urilen~0) (not (bvslt .cse1 ULTIMATE.start_main_~cp~0)) (bvsle ULTIMATE.start_main_~tokenlen~0 (_ bv1000000 32)) (bvsle (_ bv0 32) ULTIMATE.start_main_~c~0) (bvsge ULTIMATE.start_main_~cp~0 (_ bv0 32)))) [2019-10-22 11:22:12,800 INFO L443 ceAbstractionStarter]: For program point L5-8(line 5) no Hoare annotation was computed. [2019-10-22 11:22:12,800 INFO L443 ceAbstractionStarter]: For program point L4-39(lines 4 6) no Hoare annotation was computed. [2019-10-22 11:22:12,800 INFO L443 ceAbstractionStarter]: For program point L5-9(line 5) no Hoare annotation was computed. [2019-10-22 11:22:12,800 INFO L443 ceAbstractionStarter]: For program point L5-10(line 5) no Hoare annotation was computed. [2019-10-22 11:22:12,801 INFO L439 ceAbstractionStarter]: At program point L4-41(lines 55 61) the Hoare annotation is: (let ((.cse0 (bvadd ULTIMATE.start_main_~c~0 (_ bv1 32))) (.cse1 (bvadd ULTIMATE.start_main_~urilen~0 (_ bv4294967295 32)))) (and (bvsle ULTIMATE.start_main_~scheme~0 (_ bv1000000 32)) (= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (bvsge ULTIMATE.start_main_~scheme~0 (_ bv0 32)) (bvslt .cse0 ULTIMATE.start_main_~tokenlen~0) (bvsle ULTIMATE.start_main_~urilen~0 (_ bv1000000 32)) (bvsge (bvadd ULTIMATE.start_main_~cp~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle (_ bv0 32) .cse0) (not (= .cse1 ULTIMATE.start_main_~cp~0)) (bvslt (bvadd ULTIMATE.start_main_~cp~0 (_ bv4294967295 32)) ULTIMATE.start_main_~urilen~0) (not (bvslt .cse1 ULTIMATE.start_main_~cp~0)) (bvsle ULTIMATE.start_main_~tokenlen~0 (_ bv1000000 32)) (bvsle (_ bv0 32) ULTIMATE.start_main_~c~0) (bvsge ULTIMATE.start_main_~cp~0 (_ bv0 32)))) [2019-10-22 11:22:12,802 INFO L443 ceAbstractionStarter]: For program point L5-11(line 5) no Hoare annotation was computed. [2019-10-22 11:22:12,802 INFO L443 ceAbstractionStarter]: For program point L4-42(lines 4 6) no Hoare annotation was computed. [2019-10-22 11:22:12,802 INFO L443 ceAbstractionStarter]: For program point L5-12(line 5) no Hoare annotation was computed. [2019-10-22 11:22:12,802 INFO L443 ceAbstractionStarter]: For program point L5-13(line 5) no Hoare annotation was computed. [2019-10-22 11:22:12,802 INFO L439 ceAbstractionStarter]: At program point L4-44(lines 3 8) the Hoare annotation is: (let ((.cse0 (bvadd ULTIMATE.start_main_~urilen~0 (_ bv4294967295 32))) (.cse1 (bvadd ULTIMATE.start_main_~cp~0 (_ bv4294967295 32)))) (and (bvsle ULTIMATE.start_main_~scheme~0 (_ bv1000000 32)) (= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (bvsge ULTIMATE.start_main_~scheme~0 (_ bv0 32)) (or (bvslt .cse0 ULTIMATE.start_main_~scheme~0) (bvslt (bvadd ULTIMATE.start_main_~scheme~0 (_ bv4294967295 32)) ULTIMATE.start_main_~urilen~0)) (bvsle ULTIMATE.start_main_~urilen~0 (_ bv1000000 32)) (bvsge (bvadd ULTIMATE.start_main_~cp~0 (_ bv4294967294 32)) (_ bv0 32)) (not (= .cse0 ULTIMATE.start_main_~cp~0)) (bvsgt ULTIMATE.start_main_~tokenlen~0 (_ bv0 32)) (not (= ULTIMATE.start_main_~cp~0 ULTIMATE.start_main_~urilen~0)) (bvsge .cse1 (_ bv0 32)) (bvsle (_ bv0 32) ULTIMATE.start_main_~c~0) (bvsle ULTIMATE.start_main_~tokenlen~0 (_ bv1000000 32)) (not (bvslt .cse0 .cse1)))) [2019-10-22 11:22:12,802 INFO L443 ceAbstractionStarter]: For program point L5-14(line 5) no Hoare annotation was computed. [2019-10-22 11:22:12,802 INFO L443 ceAbstractionStarter]: For program point L4-45(lines 4 6) no Hoare annotation was computed. [2019-10-22 11:22:12,802 INFO L439 ceAbstractionStarter]: At program point L55(lines 55 61) the Hoare annotation is: (let ((.cse0 (bvadd ULTIMATE.start_main_~urilen~0 (_ bv4294967295 32)))) (and (bvsle ULTIMATE.start_main_~urilen~0 (_ bv1000000 32)) (bvsge (bvadd ULTIMATE.start_main_~cp~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle ULTIMATE.start_main_~scheme~0 (_ bv1000000 32)) (not (= .cse0 ULTIMATE.start_main_~cp~0)) (bvsgt ULTIMATE.start_main_~tokenlen~0 (_ bv0 32)) (bvslt (bvadd ULTIMATE.start_main_~cp~0 (_ bv4294967295 32)) ULTIMATE.start_main_~urilen~0) (= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt .cse0 ULTIMATE.start_main_~cp~0)) (bvsge ULTIMATE.start_main_~scheme~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~tokenlen~0 (_ bv1000000 32)) (bvsle (_ bv0 32) ULTIMATE.start_main_~c~0) (bvsge ULTIMATE.start_main_~cp~0 (_ bv0 32)))) [2019-10-22 11:22:12,802 INFO L443 ceAbstractionStarter]: For program point L22(lines 11 69) no Hoare annotation was computed. [2019-10-22 11:22:12,803 INFO L443 ceAbstractionStarter]: For program point L5-15(line 5) no Hoare annotation was computed. [2019-10-22 11:22:12,803 INFO L439 ceAbstractionStarter]: At program point L4-47(lines 3 8) the Hoare annotation is: (let ((.cse0 (bvadd ULTIMATE.start_main_~urilen~0 (_ bv4294967295 32))) (.cse1 (bvadd ULTIMATE.start_main_~cp~0 (_ bv4294967295 32)))) (and (bvsle ULTIMATE.start_main_~scheme~0 (_ bv1000000 32)) (= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (bvsge ULTIMATE.start_main_~scheme~0 (_ bv0 32)) (or (bvslt .cse0 ULTIMATE.start_main_~scheme~0) (bvslt (bvadd ULTIMATE.start_main_~scheme~0 (_ bv4294967295 32)) ULTIMATE.start_main_~urilen~0)) (bvsle ULTIMATE.start_main_~urilen~0 (_ bv1000000 32)) (bvsge (bvadd ULTIMATE.start_main_~cp~0 (_ bv4294967294 32)) (_ bv0 32)) (not (= .cse0 ULTIMATE.start_main_~cp~0)) (bvsgt ULTIMATE.start_main_~tokenlen~0 (_ bv0 32)) (not (= ULTIMATE.start_main_~cp~0 ULTIMATE.start_main_~urilen~0)) (bvsge .cse1 (_ bv0 32)) (bvsle (_ bv0 32) ULTIMATE.start_main_~c~0) (bvsle ULTIMATE.start_main_~tokenlen~0 (_ bv1000000 32)) (not (bvslt .cse0 .cse1)))) [2019-10-22 11:22:12,803 INFO L443 ceAbstractionStarter]: For program point L5-16(line 5) no Hoare annotation was computed. [2019-10-22 11:22:12,803 INFO L443 ceAbstractionStarter]: For program point L4-48(lines 4 6) no Hoare annotation was computed. [2019-10-22 11:22:12,803 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 11:22:12,803 INFO L443 ceAbstractionStarter]: For program point L5-17(line 5) no Hoare annotation was computed. [2019-10-22 11:22:12,803 INFO L439 ceAbstractionStarter]: At program point L4-50(lines 3 8) the Hoare annotation is: (let ((.cse0 (bvadd ULTIMATE.start_main_~urilen~0 (_ bv4294967295 32)))) (and (bvsle ULTIMATE.start_main_~urilen~0 (_ bv1000000 32)) (bvsge (bvadd ULTIMATE.start_main_~cp~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle ULTIMATE.start_main_~scheme~0 (_ bv1000000 32)) (not (= .cse0 ULTIMATE.start_main_~cp~0)) (bvsgt ULTIMATE.start_main_~tokenlen~0 (_ bv0 32)) (bvslt (bvadd ULTIMATE.start_main_~cp~0 (_ bv4294967295 32)) ULTIMATE.start_main_~urilen~0) (= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt .cse0 ULTIMATE.start_main_~cp~0)) (bvsge ULTIMATE.start_main_~scheme~0 (_ bv0 32)) (bvsle (_ bv0 32) ULTIMATE.start_main_~c~0) (bvsle ULTIMATE.start_main_~tokenlen~0 (_ bv1000000 32)) (bvsge ULTIMATE.start_main_~cp~0 (_ bv0 32)))) [2019-10-22 11:22:12,803 INFO L443 ceAbstractionStarter]: For program point L4-51(lines 4 6) no Hoare annotation was computed. [2019-10-22 11:22:12,803 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 11:22:12,804 INFO L443 ceAbstractionStarter]: For program point L23(lines 11 69) no Hoare annotation was computed. [2019-10-22 11:22:12,804 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 11:22:12,804 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 11:22:12,804 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 11:22:12,804 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 11:22:12,804 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 11:22:12,804 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 11:22:12,804 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 11:22:12,804 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 11:22:12,804 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 11:22:12,805 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 65) no Hoare annotation was computed. [2019-10-22 11:22:12,805 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 11:22:12,806 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 11:22:12,806 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 11:22:12,806 INFO L439 ceAbstractionStarter]: At program point L33-1(lines 3 38) the Hoare annotation is: (let ((.cse0 (bvadd ULTIMATE.start_main_~cp~0 (_ bv4294967295 32)))) (and (bvsle ULTIMATE.start_main_~urilen~0 (_ bv1000000 32)) (bvsle ULTIMATE.start_main_~scheme~0 (_ bv1000000 32)) (bvsgt ULTIMATE.start_main_~tokenlen~0 (_ bv0 32)) (bvslt .cse0 ULTIMATE.start_main_~urilen~0) (= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt (bvadd ULTIMATE.start_main_~urilen~0 (_ bv4294967295 32)) ULTIMATE.start_main_~cp~0)) (bvsge .cse0 (_ bv0 32)) (bvsge ULTIMATE.start_main_~scheme~0 (_ bv0 32)) (bvsle ULTIMATE.start_main_~tokenlen~0 (_ bv1000000 32)))) [2019-10-22 11:22:12,806 INFO L443 ceAbstractionStarter]: For program point L33-2(lines 33 38) no Hoare annotation was computed. [2019-10-22 11:22:12,806 INFO L439 ceAbstractionStarter]: At program point L67(lines 11 69) the Hoare annotation is: (let ((.cse0 (bvsle ULTIMATE.start_main_~urilen~0 (_ bv1000000 32))) (.cse1 (or (bvslt (bvadd ULTIMATE.start_main_~urilen~0 (_ bv4294967295 32)) ULTIMATE.start_main_~scheme~0) (not (bvsge ULTIMATE.start_main_~scheme~0 (_ bv0 32))) (bvslt (bvadd ULTIMATE.start_main_~scheme~0 (_ bv4294967295 32)) ULTIMATE.start_main_~urilen~0)))) (or (and .cse0 (bvsle ULTIMATE.start_main_~scheme~0 (_ bv1000000 32)) .cse1) (and .cse0 .cse1 (not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))))) [2019-10-22 11:22:12,806 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-10-22 11:22:12,806 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 11:22:12,806 INFO L443 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2019-10-22 11:22:12,807 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-22 11:22:12,807 INFO L439 ceAbstractionStarter]: At program point L51-1(lines 3 63) the Hoare annotation is: (and (bvsle ULTIMATE.start_main_~urilen~0 (_ bv1000000 32)) (bvsge (bvadd ULTIMATE.start_main_~cp~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsle ULTIMATE.start_main_~scheme~0 (_ bv1000000 32)) (bvsgt ULTIMATE.start_main_~tokenlen~0 (_ bv0 32)) (bvslt (bvadd ULTIMATE.start_main_~cp~0 (_ bv4294967295 32)) ULTIMATE.start_main_~urilen~0) (= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt (bvadd ULTIMATE.start_main_~urilen~0 (_ bv4294967295 32)) ULTIMATE.start_main_~cp~0)) (bvsge ULTIMATE.start_main_~scheme~0 (_ bv0 32)) (bvsle (_ bv0 32) ULTIMATE.start_main_~c~0) (bvsle ULTIMATE.start_main_~tokenlen~0 (_ bv1000000 32)) (bvsge ULTIMATE.start_main_~cp~0 (_ bv0 32))) [2019-10-22 11:22:12,807 INFO L446 ceAbstractionStarter]: At program point L68(lines 10 69) the Hoare annotation is: true [2019-10-22 11:22:12,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:22:12 BoogieIcfgContainer [2019-10-22 11:22:12,832 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:22:12,833 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:22:12,833 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:22:12,833 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:22:12,834 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:21:54" (3/4) ... [2019-10-22 11:22:12,837 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 11:22:12,849 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2019-10-22 11:22:12,849 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 11:22:12,921 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_7a54732e-1485-463a-8018-d6e46dee6a3c/bin/utaipan/witness.graphml [2019-10-22 11:22:12,922 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:22:12,923 INFO L168 Benchmark]: Toolchain (without parser) took 19347.68 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 271.1 MB). Free memory was 945.6 MB in the beginning and 974.5 MB in the end (delta: -28.9 MB). Peak memory consumption was 242.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:12,923 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:22:12,923 INFO L168 Benchmark]: CACSL2BoogieTranslator took 267.10 ms. Allocated memory is still 1.0 GB. Free memory was 945.6 MB in the beginning and 934.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:12,924 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 934.9 MB in the beginning and 1.2 GB in the end (delta: -230.3 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:12,924 INFO L168 Benchmark]: Boogie Preprocessor took 50.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:12,924 INFO L168 Benchmark]: RCFGBuilder took 364.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:12,924 INFO L168 Benchmark]: TraceAbstraction took 18478.85 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 101.7 MB). Free memory was 1.1 GB in the beginning and 982.7 MB in the end (delta: 143.6 MB). Peak memory consumption was 341.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:12,927 INFO L168 Benchmark]: Witness Printer took 88.87 ms. Allocated memory is still 1.3 GB. Free memory was 982.7 MB in the beginning and 974.5 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:22:12,928 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 267.10 ms. Allocated memory is still 1.0 GB. Free memory was 945.6 MB in the beginning and 934.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 93.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 934.9 MB in the beginning and 1.2 GB in the end (delta: -230.3 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 364.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18478.85 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 101.7 MB). Free memory was 1.1 GB in the beginning and 982.7 MB in the end (delta: 143.6 MB). Peak memory consumption was 341.7 MB. Max. memory is 11.5 GB. * Witness Printer took 88.87 ms. Allocated memory is still 1.3 GB. Free memory was 982.7 MB in the beginning and 974.5 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((((((~bvsle32(urilen, 1000000bv32) && ~bvsle32(scheme, 1000000bv32)) && ~bvslt32(~bvadd64(cp, 4294967295bv32), urilen)) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvslt32(~bvadd64(urilen, 4294967295bv32), cp)) && ~bvsge32(~bvadd64(cp, 4294967295bv32), 0bv32)) && ~bvsge32(scheme, 0bv32)) && ~bvsgt32(tokenlen, 0bv32)) && ~bvsle32(tokenlen, 1000000bv32)) || (~bvadd64(urilen, 4294967295bv32) == cp && (((((~bvsle32(urilen, 1000000bv32) && ~bvsle32(scheme, 1000000bv32)) && ~bvslt32(~bvadd64(cp, 4294967295bv32), urilen)) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvslt32(~bvadd64(urilen, 4294967295bv32), cp)) && ~bvsge32(~bvadd64(cp, 4294967295bv32), 0bv32)) && ~bvsge32(scheme, 0bv32)) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: (((((((((((~bvsle32(scheme, 1000000bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && ~bvsge32(scheme, 0bv32)) && ~bvslt32(~bvadd64(c, 1bv32), tokenlen)) && ~bvsle32(urilen, 1000000bv32)) && ~bvsge32(~bvadd64(cp, 4294967294bv32), 0bv32)) && ~bvsle32(0bv32, ~bvadd64(c, 1bv32))) && !(~bvadd64(urilen, 4294967295bv32) == cp)) && ~bvslt32(~bvadd64(cp, 4294967295bv32), urilen)) && !~bvslt32(~bvadd64(urilen, 4294967295bv32), cp)) && ~bvsle32(tokenlen, 1000000bv32)) && ~bvsle32(0bv32, c)) && ~bvsge32(cp, 0bv32) - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((((((~bvsle32(urilen, 1000000bv32) && ~bvsle32(scheme, 1000000bv32)) && ~bvsgt32(tokenlen, 0bv32)) && ~bvslt32(~bvadd64(cp, 4294967295bv32), urilen)) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvslt32(~bvadd64(urilen, 4294967295bv32), cp)) && ~bvsge32(~bvadd64(cp, 4294967295bv32), 0bv32)) && ~bvsge32(scheme, 0bv32)) && ~bvsle32(tokenlen, 1000000bv32) - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: ((((((((~bvsle32(urilen, 1000000bv32) && !(~bvadd64(urilen, 4294967295bv32) == cp)) && ~bvsle32(scheme, 1000000bv32)) && ~bvsgt32(tokenlen, 0bv32)) && ~bvslt32(~bvadd64(cp, 4294967295bv32), urilen)) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvslt32(~bvadd64(urilen, 4294967295bv32), cp)) && ~bvsge32(~bvadd64(cp, 4294967295bv32), 0bv32)) && ~bvsge32(scheme, 0bv32)) && ~bvsle32(tokenlen, 1000000bv32) - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((((((((~bvsle32(urilen, 1000000bv32) && ~bvsge32(~bvadd64(cp, 4294967294bv32), 0bv32)) && ~bvsle32(scheme, 1000000bv32)) && !(~bvadd64(urilen, 4294967295bv32) == cp)) && ~bvsgt32(tokenlen, 0bv32)) && ~bvslt32(~bvadd64(cp, 4294967295bv32), urilen)) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvslt32(~bvadd64(urilen, 4294967295bv32), cp)) && ~bvsge32(scheme, 0bv32)) && ~bvsle32(0bv32, c)) && ~bvsle32(tokenlen, 1000000bv32)) && ~bvsge32(cp, 0bv32) - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((((((((~bvsle32(urilen, 1000000bv32) && ~bvsge32(~bvadd64(cp, 4294967294bv32), 0bv32)) && ~bvsle32(scheme, 1000000bv32)) && ~bvsgt32(tokenlen, 0bv32)) && ~bvslt32(~bvadd64(cp, 4294967295bv32), urilen)) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvslt32(~bvadd64(urilen, 4294967295bv32), cp)) && ~bvsge32(scheme, 0bv32)) && ~bvsle32(0bv32, c)) && ~bvsle32(tokenlen, 1000000bv32)) && ~bvsge32(cp, 0bv32) - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((((((~bvsle32(urilen, 1000000bv32) && !(~bvadd64(urilen, 4294967295bv32) == cp)) && ~bvsle32(scheme, 1000000bv32)) && ~bvsgt32(tokenlen, 0bv32)) && ~bvslt32(~bvadd64(cp, 4294967295bv32), urilen)) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvslt32(~bvadd64(urilen, 4294967295bv32), cp)) && ~bvsge32(~bvadd64(cp, 4294967295bv32), 0bv32)) && ~bvsge32(scheme, 0bv32)) && ~bvsle32(tokenlen, 1000000bv32) - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((((((((((~bvsle32(scheme, 1000000bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && ~bvsge32(scheme, 0bv32)) && ~bvslt32(~bvadd64(c, 1bv32), tokenlen)) && ~bvsle32(urilen, 1000000bv32)) && ~bvsge32(~bvadd64(cp, 4294967294bv32), 0bv32)) && ~bvsle32(0bv32, ~bvadd64(c, 1bv32))) && !(~bvadd64(urilen, 4294967295bv32) == cp)) && ~bvslt32(~bvadd64(cp, 4294967295bv32), urilen)) && !~bvslt32(~bvadd64(urilen, 4294967295bv32), cp)) && ~bvsle32(tokenlen, 1000000bv32)) && ~bvsle32(0bv32, c)) && ~bvsge32(cp, 0bv32) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((~bvsle32(urilen, 1000000bv32) && ~bvsle32(scheme, 1000000bv32)) && ~bvsgt32(tokenlen, 0bv32)) && ~bvslt32(~bvadd64(cp, 4294967295bv32), urilen)) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvslt32(~bvadd64(urilen, 4294967295bv32), cp)) && ~bvsge32(~bvadd64(cp, 4294967295bv32), 0bv32)) && ~bvsge32(scheme, 0bv32)) && ~bvsle32(tokenlen, 1000000bv32) - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((((((~bvsle32(urilen, 1000000bv32) && ~bvsle32(scheme, 1000000bv32)) && !(~bvadd64(urilen, 4294967295bv32) == cp)) && ~bvsgt32(tokenlen, 0bv32)) && ~bvslt32(~bvadd64(cp, 4294967295bv32), urilen)) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvslt32(~bvadd64(urilen, 4294967295bv32), cp)) && ~bvsge32(~bvadd64(cp, 4294967295bv32), 0bv32)) && ~bvsge32(scheme, 0bv32)) && ~bvsle32(tokenlen, 1000000bv32) - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((((((((((~bvsle32(scheme, 1000000bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && ~bvsge32(scheme, 0bv32)) && (~bvslt32(~bvadd64(urilen, 4294967295bv32), scheme) || ~bvslt32(~bvadd64(scheme, 4294967295bv32), urilen))) && ~bvsle32(urilen, 1000000bv32)) && ~bvsge32(~bvadd64(cp, 4294967294bv32), 0bv32)) && !(~bvadd64(urilen, 4294967295bv32) == cp)) && ~bvsgt32(tokenlen, 0bv32)) && !(cp == urilen)) && ~bvsge32(~bvadd64(cp, 4294967295bv32), 0bv32)) && ~bvsle32(0bv32, c)) && ~bvsle32(tokenlen, 1000000bv32)) && !~bvslt32(~bvadd64(urilen, 4294967295bv32), ~bvadd64(cp, 4294967295bv32)) - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((((((~bvsle32(urilen, 1000000bv32) && ~bvsle32(scheme, 1000000bv32)) && ~bvsgt32(tokenlen, 0bv32)) && ~bvslt32(~bvadd64(cp, 4294967295bv32), urilen)) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvslt32(~bvadd64(urilen, 4294967295bv32), cp)) && ~bvsge32(~bvadd64(cp, 4294967295bv32), 0bv32)) && ~bvsge32(scheme, 0bv32)) && ~bvsle32(tokenlen, 1000000bv32) - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((((((~bvsle32(urilen, 1000000bv32) && ~bvsle32(scheme, 1000000bv32)) && !(~bvadd64(urilen, 4294967295bv32) == cp)) && ~bvsgt32(tokenlen, 0bv32)) && ~bvslt32(~bvadd64(cp, 4294967295bv32), urilen)) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvslt32(~bvadd64(urilen, 4294967295bv32), cp)) && ~bvsge32(~bvadd64(cp, 4294967295bv32), 0bv32)) && ~bvsge32(scheme, 0bv32)) && ~bvsle32(tokenlen, 1000000bv32) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((((((((((~bvsle32(urilen, 1000000bv32) && ~bvsge32(~bvadd64(cp, 4294967294bv32), 0bv32)) && ~bvsle32(scheme, 1000000bv32)) && !(~bvadd64(urilen, 4294967295bv32) == cp)) && ~bvsgt32(tokenlen, 0bv32)) && ~bvslt32(~bvadd64(cp, 4294967295bv32), urilen)) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvslt32(~bvadd64(urilen, 4294967295bv32), cp)) && ~bvsge32(scheme, 0bv32)) && ~bvsle32(tokenlen, 1000000bv32)) && ~bvsle32(0bv32, c)) && ~bvsge32(cp, 0bv32) - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((((((~bvsle32(urilen, 1000000bv32) && ~bvsle32(scheme, 1000000bv32)) && ~bvsgt32(tokenlen, 0bv32)) && ~bvslt32(~bvadd64(cp, 4294967295bv32), urilen)) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvslt32(~bvadd64(urilen, 4294967295bv32), cp)) && ~bvsge32(~bvadd64(cp, 4294967295bv32), 0bv32)) && ~bvsge32(scheme, 0bv32)) && ~bvsle32(tokenlen, 1000000bv32) - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: ((((((((~bvsle32(urilen, 1000000bv32) && ~bvsle32(scheme, 1000000bv32)) && ~bvslt32(~bvadd64(cp, 4294967295bv32), urilen)) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvslt32(~bvadd64(urilen, 4294967295bv32), cp)) && ~bvsge32(~bvadd64(cp, 4294967295bv32), 0bv32)) && ~bvsge32(scheme, 0bv32)) && ~bvsgt32(tokenlen, 0bv32)) && ~bvsle32(tokenlen, 1000000bv32)) || (~bvadd64(urilen, 4294967295bv32) == cp && (((((~bvsle32(urilen, 1000000bv32) && ~bvsle32(scheme, 1000000bv32)) && ~bvslt32(~bvadd64(cp, 4294967295bv32), urilen)) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvslt32(~bvadd64(urilen, 4294967295bv32), cp)) && ~bvsge32(~bvadd64(cp, 4294967295bv32), 0bv32)) && ~bvsge32(scheme, 0bv32)) - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((((((((((~bvsle32(scheme, 1000000bv32) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && ~bvsge32(scheme, 0bv32)) && (~bvslt32(~bvadd64(urilen, 4294967295bv32), scheme) || ~bvslt32(~bvadd64(scheme, 4294967295bv32), urilen))) && ~bvsle32(urilen, 1000000bv32)) && ~bvsge32(~bvadd64(cp, 4294967294bv32), 0bv32)) && !(~bvadd64(urilen, 4294967295bv32) == cp)) && ~bvsgt32(tokenlen, 0bv32)) && !(cp == urilen)) && ~bvsge32(~bvadd64(cp, 4294967295bv32), 0bv32)) && ~bvsle32(0bv32, c)) && ~bvsle32(tokenlen, 1000000bv32)) && !~bvslt32(~bvadd64(urilen, 4294967295bv32), ~bvadd64(cp, 4294967295bv32)) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: ((~bvsle32(urilen, 1000000bv32) && ~bvsle32(scheme, 1000000bv32)) && ((~bvslt32(~bvadd64(urilen, 4294967295bv32), scheme) || !~bvsge32(scheme, 0bv32)) || ~bvslt32(~bvadd64(scheme, 4294967295bv32), urilen))) || ((~bvsle32(urilen, 1000000bv32) && ((~bvslt32(~bvadd64(urilen, 4294967295bv32), scheme) || !~bvsge32(scheme, 0bv32)) || ~bvslt32(~bvadd64(scheme, 4294967295bv32), urilen))) && !(cond == 0bv32)) - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((((((((0bv32 == c && ~bvsle32(urilen, 1000000bv32)) && ~bvsge32(~bvadd64(cp, 4294967294bv32), 0bv32)) && ~bvsle32(scheme, 1000000bv32)) && !(~bvadd64(urilen, 4294967295bv32) == cp)) && ~bvsgt32(tokenlen, 0bv32)) && ~bvslt32(~bvadd64(cp, 4294967295bv32), urilen)) && ~bvadd64(cond, 4294967295bv32) == 0bv32) && !~bvslt32(~bvadd64(urilen, 4294967295bv32), cp)) && ~bvsge32(scheme, 0bv32)) && ~bvsle32(tokenlen, 1000000bv32)) && ~bvsge32(cp, 0bv32) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 87 locations, 18 error locations. Result: SAFE, OverallTime: 18.3s, OverallIterations: 7, TraceHistogramMax: 2, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.3s, HoareTripleCheckerStatistics: 342 SDtfs, 1173 SDslu, 803 SDs, 0 SdLazy, 832 SolverSat, 617 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 432 GetRequests, 310 SyntacticMatches, 9 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 171 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 20 PreInvPairs, 68 NumberOfFragments, 956 HoareAnnotationTreeSize, 20 FomulaSimplifications, 19344 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 20 FomulaSimplificationsInter, 2292 FormulaSimplificationTreeSizeReductionInter, 4.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 198 NumberOfCodeBlocks, 198 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 380 ConstructedInterpolants, 0 QuantifiedInterpolants, 57222 SizeOfPredicates, 46 NumberOfNonLiveVariables, 375 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 16 InterpolantComputations, 12 PerfectInterpolantSequences, 4/12 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...