./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/bitvector/byte_add-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ce957eef-ce21-4a41-b05d-851c57f5f61e/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ce957eef-ce21-4a41-b05d-851c57f5f61e/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ce957eef-ce21-4a41-b05d-851c57f5f61e/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ce957eef-ce21-4a41-b05d-851c57f5f61e/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/bitvector/byte_add-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_ce957eef-ce21-4a41-b05d-851c57f5f61e/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ce957eef-ce21-4a41-b05d-851c57f5f61e/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 a2c46755d0cb80f6b2e7b990e0a1bd9a49737b84 .................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ce957eef-ce21-4a41-b05d-851c57f5f61e/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ce957eef-ce21-4a41-b05d-851c57f5f61e/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ce957eef-ce21-4a41-b05d-851c57f5f61e/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ce957eef-ce21-4a41-b05d-851c57f5f61e/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/bitvector/byte_add-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_ce957eef-ce21-4a41-b05d-851c57f5f61e/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ce957eef-ce21-4a41-b05d-851c57f5f61e/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 a2c46755d0cb80f6b2e7b990e0a1bd9a49737b84 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 16:20:52,317 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:20:52,318 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:20:52,326 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:20:52,326 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:20:52,327 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:20:52,327 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:20:52,329 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:20:52,330 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:20:52,331 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:20:52,331 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:20:52,332 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:20:52,332 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:20:52,333 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:20:52,334 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:20:52,334 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:20:52,335 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:20:52,336 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:20:52,337 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:20:52,338 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:20:52,339 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:20:52,340 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:20:52,341 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:20:52,341 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:20:52,343 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:20:52,343 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:20:52,343 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:20:52,344 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:20:52,344 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:20:52,344 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:20:52,345 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:20:52,345 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:20:52,345 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:20:52,346 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:20:52,346 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:20:52,346 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:20:52,347 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:20:52,347 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:20:52,347 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:20:52,348 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:20:52,348 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:20:52,349 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ce957eef-ce21-4a41-b05d-851c57f5f61e/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 16:20:52,358 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:20:52,359 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:20:52,359 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 16:20:52,359 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 16:20:52,359 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 16:20:52,360 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 16:20:52,360 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 16:20:52,360 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 16:20:52,360 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 16:20:52,360 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 16:20:52,360 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 16:20:52,360 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 16:20:52,360 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 16:20:52,361 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 16:20:52,361 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 16:20:52,361 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:20:52,361 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:20:52,361 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:20:52,361 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:20:52,362 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:20:52,362 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 16:20:52,362 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:20:52,362 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 16:20:52,362 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 16:20:52,362 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:20:52,362 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 16:20:52,362 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:20:52,362 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 16:20:52,363 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:20:52,363 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:20:52,363 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:20:52,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:20:52,363 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:20:52,363 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:20:52,363 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 16:20:52,363 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 16:20:52,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:20:52,364 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 16:20:52,364 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:20:52,364 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 16:20:52,364 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/run_dir_ce957eef-ce21-4a41-b05d-851c57f5f61e/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 -> a2c46755d0cb80f6b2e7b990e0a1bd9a49737b84 [2019-12-07 16:20:52,463 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:20:52,470 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:20:52,473 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:20:52,474 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:20:52,474 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:20:52,474 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ce957eef-ce21-4a41-b05d-851c57f5f61e/bin/utaipan/../../sv-benchmarks/c/bitvector/byte_add-1.i [2019-12-07 16:20:52,511 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ce957eef-ce21-4a41-b05d-851c57f5f61e/bin/utaipan/data/148a7b312/7fb4916f05ec4e8fa9b2d3b45065888e/FLAG443485372 [2019-12-07 16:20:52,941 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:20:52,941 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ce957eef-ce21-4a41-b05d-851c57f5f61e/sv-benchmarks/c/bitvector/byte_add-1.i [2019-12-07 16:20:52,946 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ce957eef-ce21-4a41-b05d-851c57f5f61e/bin/utaipan/data/148a7b312/7fb4916f05ec4e8fa9b2d3b45065888e/FLAG443485372 [2019-12-07 16:20:52,954 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ce957eef-ce21-4a41-b05d-851c57f5f61e/bin/utaipan/data/148a7b312/7fb4916f05ec4e8fa9b2d3b45065888e [2019-12-07 16:20:52,956 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:20:52,957 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:20:52,958 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:20:52,958 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:20:52,960 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:20:52,961 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:20:52" (1/1) ... [2019-12-07 16:20:52,962 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25b37d74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:20:52, skipping insertion in model container [2019-12-07 16:20:52,962 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:20:52" (1/1) ... [2019-12-07 16:20:52,967 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:20:52,982 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:20:53,136 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:20:53,138 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:20:53,160 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:20:53,170 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:20:53,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:20:53 WrapperNode [2019-12-07 16:20:53,171 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:20:53,171 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:20:53,171 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:20:53,171 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:20:53,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:20:53" (1/1) ... [2019-12-07 16:20:53,182 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:20:53" (1/1) ... [2019-12-07 16:20:53,198 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:20:53,198 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:20:53,198 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:20:53,199 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:20:53,205 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:20:53" (1/1) ... [2019-12-07 16:20:53,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:20:53" (1/1) ... [2019-12-07 16:20:53,206 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:20:53" (1/1) ... [2019-12-07 16:20:53,206 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:20:53" (1/1) ... [2019-12-07 16:20:53,210 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:20:53" (1/1) ... [2019-12-07 16:20:53,214 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:20:53" (1/1) ... [2019-12-07 16:20:53,215 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:20:53" (1/1) ... [2019-12-07 16:20:53,216 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:20:53,217 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:20:53,217 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:20:53,217 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:20:53,217 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:20:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce957eef-ce21-4a41-b05d-851c57f5f61e/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-12-07 16:20:53,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:20:53,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:20:53,728 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:20:53,728 INFO L287 CfgBuilder]: Removed 10 assume(true) statements. [2019-12-07 16:20:53,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:20:53 BoogieIcfgContainer [2019-12-07 16:20:53,729 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:20:53,730 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:20:53,730 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:20:53,732 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:20:53,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:20:52" (1/3) ... [2019-12-07 16:20:53,732 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56c5e72f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:20:53, skipping insertion in model container [2019-12-07 16:20:53,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:20:53" (2/3) ... [2019-12-07 16:20:53,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56c5e72f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:20:53, skipping insertion in model container [2019-12-07 16:20:53,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:20:53" (3/3) ... [2019-12-07 16:20:53,734 INFO L109 eAbstractionObserver]: Analyzing ICFG byte_add-1.i [2019-12-07 16:20:53,740 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:20:53,744 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 16:20:53,751 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 16:20:53,765 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:20:53,765 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 16:20:53,765 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:20:53,765 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:20:53,766 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:20:53,766 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:20:53,766 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:20:53,766 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:20:53,774 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-12-07 16:20:53,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 16:20:53,777 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:20:53,778 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 16:20:53,778 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:20:53,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:20:53,781 INFO L82 PathProgramCache]: Analyzing trace with hash 257544280, now seen corresponding path program 1 times [2019-12-07 16:20:53,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:20:53,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127109531] [2019-12-07 16:20:53,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:20:53,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:20:53,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:20:53,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127109531] [2019-12-07 16:20:53,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:20:53,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:20:53,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048426212] [2019-12-07 16:20:53,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:20:53,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:20:53,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:20:53,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:20:53,937 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2019-12-07 16:20:53,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:20:53,962 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2019-12-07 16:20:53,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:20:53,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 16:20:53,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:20:53,970 INFO L225 Difference]: With dead ends: 15 [2019-12-07 16:20:53,970 INFO L226 Difference]: Without dead ends: 8 [2019-12-07 16:20:53,972 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:20:53,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-12-07 16:20:53,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-12-07 16:20:53,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-12-07 16:20:53,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-12-07 16:20:53,993 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 5 [2019-12-07 16:20:53,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:20:53,993 INFO L462 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-12-07 16:20:53,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:20:53,993 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2019-12-07 16:20:53,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 16:20:53,994 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:20:53,994 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 16:20:53,994 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:20:53,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:20:53,994 INFO L82 PathProgramCache]: Analyzing trace with hash -566502223, now seen corresponding path program 1 times [2019-12-07 16:20:53,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:20:53,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178511102] [2019-12-07 16:20:53,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:20:54,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:20:54,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:20:54,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178511102] [2019-12-07 16:20:54,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243695549] [2019-12-07 16:20:54,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce957eef-ce21-4a41-b05d-851c57f5f61e/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-12-07 16:20:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:20:54,127 INFO L264 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 16:20:54,129 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:20:54,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:20:54,157 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:20:54,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:20:54,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2136409128] [2019-12-07 16:20:54,187 INFO L159 IcfgInterpreter]: Started Sifa with 6 locations of interest [2019-12-07 16:20:54,187 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 16:20:54,191 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 16:20:54,196 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 16:20:54,196 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 16:20:56,158 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 16:20:56,231 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 16:20:56,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 16:20:56,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2019-12-07 16:20:56,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945398865] [2019-12-07 16:20:56,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 16:20:56,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:20:56,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 16:20:56,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-07 16:20:56,234 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 7 states. [2019-12-07 16:20:56,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:20:56,314 INFO L93 Difference]: Finished difference Result 17 states and 24 transitions. [2019-12-07 16:20:56,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:20:56,314 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-12-07 16:20:56,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:20:56,315 INFO L225 Difference]: With dead ends: 17 [2019-12-07 16:20:56,315 INFO L226 Difference]: Without dead ends: 14 [2019-12-07 16:20:56,315 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-12-07 16:20:56,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-12-07 16:20:56,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-12-07 16:20:56,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-12-07 16:20:56,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-12-07 16:20:56,318 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 6 [2019-12-07 16:20:56,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:20:56,319 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-12-07 16:20:56,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 16:20:56,319 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2019-12-07 16:20:56,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 16:20:56,319 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:20:56,319 INFO L410 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2019-12-07 16:20:56,520 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:20:56,520 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:20:56,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:20:56,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1113153896, now seen corresponding path program 2 times [2019-12-07 16:20:56,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:20:56,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102251689] [2019-12-07 16:20:56,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:20:56,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:20:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:20:57,082 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 16:20:57,082 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 16:20:57,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:20:57 BoogieIcfgContainer [2019-12-07 16:20:57,103 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 16:20:57,104 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 16:20:57,104 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 16:20:57,104 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 16:20:57,104 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:20:53" (3/4) ... [2019-12-07 16:20:57,106 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 16:20:57,107 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 16:20:57,108 INFO L168 Benchmark]: Toolchain (without parser) took 4150.62 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 257.9 MB). Free memory was 945.1 MB in the beginning and 1.1 GB in the end (delta: -136.0 MB). Peak memory consumption was 121.9 MB. Max. memory is 11.5 GB. [2019-12-07 16:20:57,109 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:20:57,109 INFO L168 Benchmark]: CACSL2BoogieTranslator took 213.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 945.1 MB in the beginning and 1.1 GB in the end (delta: -153.6 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2019-12-07 16:20:57,110 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 16:20:57,110 INFO L168 Benchmark]: Boogie Preprocessor took 17.97 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:20:57,110 INFO L168 Benchmark]: RCFGBuilder took 512.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 71.3 MB). Peak memory consumption was 71.3 MB. Max. memory is 11.5 GB. [2019-12-07 16:20:57,111 INFO L168 Benchmark]: TraceAbstraction took 3373.64 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 154.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -59.1 MB). Peak memory consumption was 95.0 MB. Max. memory is 11.5 GB. [2019-12-07 16:20:57,111 INFO L168 Benchmark]: Witness Printer took 3.08 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:20:57,114 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 213.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 945.1 MB in the beginning and 1.1 GB in the end (delta: -153.6 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.97 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 512.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 71.3 MB). Peak memory consumption was 71.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3373.64 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 154.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -59.1 MB). Peak memory consumption was 95.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.08 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 6]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 97, overapproximation of bitwiseAnd at line 77. Possible FailurePath: [L105] unsigned int a, b, r; [L107] a = __VERIFIER_nondet_uint() [L108] b = __VERIFIER_nondet_uint() [L23] unsigned char a0, a1, a2, a3; [L24] unsigned char b0, b1, b2, b3; [L25] unsigned char r0, r1, r2, r3; [L26] unsigned short carry; [L27] unsigned short partial_sum; [L28] unsigned int r; [L29] unsigned char i; [L30] unsigned char na, nb; [L31] a0 = a [L32] a1 = a >> 8 [L33] a2 = a >> 16U [L34] a3 = a >> 24U [L35] b0 = b [L36] b1 = b >> 8U [L37] b2 = b >> 16U [L38] b3 = b >> 24U [L39] na = (unsigned char)4 [L40] COND FALSE !(a3 == (unsigned char)0) [L49] nb = (unsigned char)4 [L50] COND FALSE !(b3 == (unsigned char)0) [L59] carry = (unsigned short)0 [L60] i = (unsigned char)0 [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 [L64] COND TRUE i < na [L65] COND TRUE i == (unsigned char)0 [L65] partial_sum = partial_sum + a0 [L66] COND FALSE !(i == (unsigned char)1) [L67] COND FALSE !(i == (unsigned char)2) [L68] COND FALSE !(i == (unsigned char)3) [L70] COND TRUE i < nb [L71] COND TRUE i == (unsigned char)0 [L71] partial_sum = partial_sum + b0 [L72] COND FALSE !(i == (unsigned char)1) [L73] COND FALSE !(i == (unsigned char)2) [L74] COND FALSE !(i == (unsigned char)3) [L76] COND FALSE !(partial_sum > ((unsigned char)254)) [L80] COND TRUE i == (unsigned char)0 [L80] r0 = (unsigned char)partial_sum [L81] COND FALSE !(i == (unsigned char)1) [L82] COND FALSE !(i == (unsigned char)2) [L83] COND FALSE !(i == (unsigned char)3) [L85] i = i + (unsigned char)1 [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 [L64] COND TRUE i < na [L65] COND FALSE !(i == (unsigned char)0) [L66] COND TRUE i == (unsigned char)1 [L66] partial_sum = partial_sum + a1 [L67] COND FALSE !(i == (unsigned char)2) [L68] COND FALSE !(i == (unsigned char)3) [L70] COND TRUE i < nb [L71] COND FALSE !(i == (unsigned char)0) [L72] COND TRUE i == (unsigned char)1 [L72] partial_sum = partial_sum + b1 [L73] COND FALSE !(i == (unsigned char)2) [L74] COND FALSE !(i == (unsigned char)3) [L76] COND FALSE !(partial_sum > ((unsigned char)254)) [L80] COND FALSE !(i == (unsigned char)0) [L81] COND TRUE i == (unsigned char)1 [L81] r1 = (unsigned char)partial_sum [L82] COND FALSE !(i == (unsigned char)2) [L83] COND FALSE !(i == (unsigned char)3) [L85] i = i + (unsigned char)1 [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 [L64] COND TRUE i < na [L65] COND FALSE !(i == (unsigned char)0) [L66] COND FALSE !(i == (unsigned char)1) [L67] COND TRUE i == (unsigned char)2 [L67] partial_sum = partial_sum + a2 [L68] COND FALSE !(i == (unsigned char)3) [L70] COND TRUE i < nb [L71] COND FALSE !(i == (unsigned char)0) [L72] COND FALSE !(i == (unsigned char)1) [L73] COND TRUE i == (unsigned char)2 [L73] partial_sum = partial_sum + b2 [L74] COND FALSE !(i == (unsigned char)3) [L76] COND FALSE !(partial_sum > ((unsigned char)254)) [L80] COND FALSE !(i == (unsigned char)0) [L81] COND FALSE !(i == (unsigned char)1) [L82] COND TRUE i == (unsigned char)2 [L82] r2 = (unsigned char)partial_sum [L83] COND FALSE !(i == (unsigned char)3) [L85] i = i + (unsigned char)1 [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 [L64] COND TRUE i < na [L65] COND FALSE !(i == (unsigned char)0) [L66] COND FALSE !(i == (unsigned char)1) [L67] COND FALSE !(i == (unsigned char)2) [L68] COND TRUE i == (unsigned char)3 [L68] partial_sum = partial_sum + a3 [L70] COND TRUE i < nb [L71] COND FALSE !(i == (unsigned char)0) [L72] COND FALSE !(i == (unsigned char)1) [L73] COND FALSE !(i == (unsigned char)2) [L74] COND TRUE i == (unsigned char)3 [L74] partial_sum = partial_sum + b3 [L76] COND FALSE !(partial_sum > ((unsigned char)254)) [L80] COND FALSE !(i == (unsigned char)0) [L81] COND FALSE !(i == (unsigned char)1) [L82] COND FALSE !(i == (unsigned char)2) [L83] COND TRUE i == (unsigned char)3 [L83] r3 = (unsigned char)partial_sum [L85] i = i + (unsigned char)1 [L61] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) [L88] COND FALSE !(i < (unsigned char)4) [L97] r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) [L99] return r; [L110] r = mp_add(a, b) [L5] COND TRUE !(cond) [L6] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. Result: UNSAFE, OverallTime: 3.3s, OverallIterations: 3, TraceHistogramMax: 4, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10 SDtfs, 3 SDslu, 12 SDs, 0 SdLazy, 33 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 26 NumberOfCodeBlocks, 26 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 19 ConstructedInterpolants, 2 QuantifiedInterpolants, 631 SizeOfPredicates, 1 NumberOfNonLiveVariables, 58 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 0/3 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 could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 16:20:58,437 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:20:58,438 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:20:58,446 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:20:58,446 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:20:58,447 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:20:58,448 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:20:58,449 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:20:58,451 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:20:58,451 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:20:58,452 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:20:58,453 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:20:58,453 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:20:58,454 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:20:58,454 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:20:58,455 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:20:58,456 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:20:58,456 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:20:58,458 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:20:58,459 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:20:58,461 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:20:58,461 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:20:58,462 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:20:58,463 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:20:58,465 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:20:58,465 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:20:58,465 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:20:58,466 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:20:58,466 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:20:58,467 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:20:58,467 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:20:58,467 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:20:58,468 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:20:58,468 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:20:58,469 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:20:58,469 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:20:58,470 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:20:58,470 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:20:58,470 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:20:58,471 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:20:58,471 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:20:58,471 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ce957eef-ce21-4a41-b05d-851c57f5f61e/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-12-07 16:20:58,482 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:20:58,482 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:20:58,482 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 16:20:58,483 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 16:20:58,483 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 16:20:58,483 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 16:20:58,483 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 16:20:58,483 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 16:20:58,483 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 16:20:58,484 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:20:58,484 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:20:58,484 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:20:58,484 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:20:58,484 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 16:20:58,485 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:20:58,485 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 16:20:58,485 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 16:20:58,485 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 16:20:58,485 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 16:20:58,485 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:20:58,485 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 16:20:58,486 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:20:58,486 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 16:20:58,486 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:20:58,486 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 16:20:58,486 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:20:58,486 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:20:58,486 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:20:58,487 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:20:58,487 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:20:58,487 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 16:20:58,487 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 16:20:58,487 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 16:20:58,487 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 16:20:58,487 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:20:58,488 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 16:20:58,488 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_ce957eef-ce21-4a41-b05d-851c57f5f61e/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 -> a2c46755d0cb80f6b2e7b990e0a1bd9a49737b84 [2019-12-07 16:20:58,647 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:20:58,657 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:20:58,659 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:20:58,660 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:20:58,660 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:20:58,661 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ce957eef-ce21-4a41-b05d-851c57f5f61e/bin/utaipan/../../sv-benchmarks/c/bitvector/byte_add-1.i [2019-12-07 16:20:58,707 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ce957eef-ce21-4a41-b05d-851c57f5f61e/bin/utaipan/data/b41e6bc6f/38aa47fe1aa146e5855837047031171b/FLAG2ab457b0f [2019-12-07 16:20:59,041 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:20:59,042 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ce957eef-ce21-4a41-b05d-851c57f5f61e/sv-benchmarks/c/bitvector/byte_add-1.i [2019-12-07 16:20:59,046 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ce957eef-ce21-4a41-b05d-851c57f5f61e/bin/utaipan/data/b41e6bc6f/38aa47fe1aa146e5855837047031171b/FLAG2ab457b0f [2019-12-07 16:20:59,055 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ce957eef-ce21-4a41-b05d-851c57f5f61e/bin/utaipan/data/b41e6bc6f/38aa47fe1aa146e5855837047031171b [2019-12-07 16:20:59,057 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:20:59,057 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:20:59,058 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:20:59,058 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:20:59,060 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:20:59,061 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:20:59" (1/1) ... [2019-12-07 16:20:59,062 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23cf13fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:20:59, skipping insertion in model container [2019-12-07 16:20:59,063 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:20:59" (1/1) ... [2019-12-07 16:20:59,067 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:20:59,082 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:20:59,199 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:20:59,202 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:20:59,225 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:20:59,265 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:20:59,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:20:59 WrapperNode [2019-12-07 16:20:59,265 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:20:59,265 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:20:59,266 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:20:59,266 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:20:59,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:20:59" (1/1) ... [2019-12-07 16:20:59,277 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:20:59" (1/1) ... [2019-12-07 16:20:59,293 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:20:59,293 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:20:59,293 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:20:59,293 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:20:59,299 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:20:59" (1/1) ... [2019-12-07 16:20:59,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:20:59" (1/1) ... [2019-12-07 16:20:59,301 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:20:59" (1/1) ... [2019-12-07 16:20:59,301 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:20:59" (1/1) ... [2019-12-07 16:20:59,305 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:20:59" (1/1) ... [2019-12-07 16:20:59,309 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:20:59" (1/1) ... [2019-12-07 16:20:59,310 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:20:59" (1/1) ... [2019-12-07 16:20:59,312 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:20:59,312 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:20:59,312 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:20:59,312 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:20:59,313 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:20:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce957eef-ce21-4a41-b05d-851c57f5f61e/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-12-07 16:20:59,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:20:59,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:20:59,555 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:20:59,556 INFO L287 CfgBuilder]: Removed 10 assume(true) statements. [2019-12-07 16:20:59,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:20:59 BoogieIcfgContainer [2019-12-07 16:20:59,557 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:20:59,557 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:20:59,557 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:20:59,559 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:20:59,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:20:59" (1/3) ... [2019-12-07 16:20:59,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@488438a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:20:59, skipping insertion in model container [2019-12-07 16:20:59,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:20:59" (2/3) ... [2019-12-07 16:20:59,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@488438a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:20:59, skipping insertion in model container [2019-12-07 16:20:59,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:20:59" (3/3) ... [2019-12-07 16:20:59,561 INFO L109 eAbstractionObserver]: Analyzing ICFG byte_add-1.i [2019-12-07 16:20:59,567 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:20:59,571 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 16:20:59,579 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 16:20:59,594 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:20:59,594 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 16:20:59,594 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:20:59,594 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:20:59,594 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:20:59,595 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:20:59,595 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:20:59,595 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:20:59,605 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2019-12-07 16:20:59,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 16:20:59,609 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:20:59,609 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:20:59,610 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:20:59,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:20:59,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1818568748, now seen corresponding path program 1 times [2019-12-07 16:20:59,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:20:59,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1229868011] [2019-12-07 16:20:59,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce957eef-ce21-4a41-b05d-851c57f5f61e/bin/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 16:20:59,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:20:59,660 INFO L264 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 1 conjunts are in the unsatisfiable core [2019-12-07 16:20:59,663 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:20:59,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:20:59,672 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:20:59,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:20:59,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1229868011] [2019-12-07 16:20:59,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:20:59,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 16:20:59,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672548076] [2019-12-07 16:20:59,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 16:20:59,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:20:59,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 16:20:59,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 16:20:59,690 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 2 states. [2019-12-07 16:20:59,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:20:59,702 INFO L93 Difference]: Finished difference Result 56 states and 91 transitions. [2019-12-07 16:20:59,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 16:20:59,703 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-12-07 16:20:59,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:20:59,710 INFO L225 Difference]: With dead ends: 56 [2019-12-07 16:20:59,710 INFO L226 Difference]: Without dead ends: 37 [2019-12-07 16:20:59,712 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 16:20:59,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-12-07 16:20:59,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-12-07 16:20:59,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-12-07 16:20:59,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 63 transitions. [2019-12-07 16:20:59,740 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 63 transitions. Word has length 11 [2019-12-07 16:20:59,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:20:59,741 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 63 transitions. [2019-12-07 16:20:59,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 16:20:59,741 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 63 transitions. [2019-12-07 16:20:59,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 16:20:59,742 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:20:59,742 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:20:59,942 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 16:20:59,943 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:20:59,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:20:59,943 INFO L82 PathProgramCache]: Analyzing trace with hash -927982706, now seen corresponding path program 1 times [2019-12-07 16:20:59,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:20:59,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [105254226] [2019-12-07 16:20:59,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce957eef-ce21-4a41-b05d-851c57f5f61e/bin/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 16:21:00,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:21:00,002 INFO L264 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 16:21:00,003 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:21:00,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:21:00,027 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:21:00,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:21:00,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [105254226] [2019-12-07 16:21:00,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:21:00,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 16:21:00,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408167553] [2019-12-07 16:21:00,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:21:00,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:21:00,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:21:00,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:21:00,042 INFO L87 Difference]: Start difference. First operand 37 states and 63 transitions. Second operand 6 states. [2019-12-07 16:21:00,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:21:00,388 INFO L93 Difference]: Finished difference Result 171 states and 300 transitions. [2019-12-07 16:21:00,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:21:00,388 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-12-07 16:21:00,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:21:00,390 INFO L225 Difference]: With dead ends: 171 [2019-12-07 16:21:00,390 INFO L226 Difference]: Without dead ends: 143 [2019-12-07 16:21:00,391 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:21:00,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-12-07 16:21:00,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 111. [2019-12-07 16:21:00,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-12-07 16:21:00,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 182 transitions. [2019-12-07 16:21:00,403 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 182 transitions. Word has length 11 [2019-12-07 16:21:00,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:21:00,403 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 182 transitions. [2019-12-07 16:21:00,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:21:00,404 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 182 transitions. [2019-12-07 16:21:00,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 16:21:00,404 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:21:00,404 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:21:00,605 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 16:21:00,605 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:21:00,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:21:00,606 INFO L82 PathProgramCache]: Analyzing trace with hash 685151225, now seen corresponding path program 1 times [2019-12-07 16:21:00,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:21:00,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1894566048] [2019-12-07 16:21:00,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce957eef-ce21-4a41-b05d-851c57f5f61e/bin/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 16:21:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:21:00,662 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 16:21:00,663 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:21:00,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:21:00,692 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:21:00,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:21:00,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1894566048] [2019-12-07 16:21:00,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:21:00,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-12-07 16:21:00,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131813516] [2019-12-07 16:21:00,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 16:21:00,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:21:00,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 16:21:00,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-12-07 16:21:00,744 INFO L87 Difference]: Start difference. First operand 111 states and 182 transitions. Second operand 12 states. [2019-12-07 16:21:01,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:21:01,218 INFO L93 Difference]: Finished difference Result 272 states and 462 transitions. [2019-12-07 16:21:01,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 16:21:01,219 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 13 [2019-12-07 16:21:01,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:21:01,220 INFO L225 Difference]: With dead ends: 272 [2019-12-07 16:21:01,220 INFO L226 Difference]: Without dead ends: 227 [2019-12-07 16:21:01,221 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2019-12-07 16:21:01,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-12-07 16:21:01,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 183. [2019-12-07 16:21:01,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-12-07 16:21:01,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 291 transitions. [2019-12-07 16:21:01,232 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 291 transitions. Word has length 13 [2019-12-07 16:21:01,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:21:01,233 INFO L462 AbstractCegarLoop]: Abstraction has 183 states and 291 transitions. [2019-12-07 16:21:01,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 16:21:01,233 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 291 transitions. [2019-12-07 16:21:01,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 16:21:01,234 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:21:01,234 INFO L410 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] [2019-12-07 16:21:01,435 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 16:21:01,435 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:21:01,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:21:01,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1372883746, now seen corresponding path program 1 times [2019-12-07 16:21:01,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:21:01,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1161020503] [2019-12-07 16:21:01,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce957eef-ce21-4a41-b05d-851c57f5f61e/bin/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 16:21:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:21:01,493 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 16:21:01,494 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:21:01,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:21:01,506 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:21:01,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:21:01,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1161020503] [2019-12-07 16:21:01,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:21:01,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-12-07 16:21:01,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830336748] [2019-12-07 16:21:01,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:21:01,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:21:01,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:21:01,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:21:01,518 INFO L87 Difference]: Start difference. First operand 183 states and 291 transitions. Second operand 6 states. [2019-12-07 16:21:01,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:21:01,731 INFO L93 Difference]: Finished difference Result 818 states and 1311 transitions. [2019-12-07 16:21:01,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:21:01,732 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-07 16:21:01,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:21:01,737 INFO L225 Difference]: With dead ends: 818 [2019-12-07 16:21:01,737 INFO L226 Difference]: Without dead ends: 659 [2019-12-07 16:21:01,738 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:21:01,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-12-07 16:21:01,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 394. [2019-12-07 16:21:01,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-12-07 16:21:01,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 592 transitions. [2019-12-07 16:21:01,765 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 592 transitions. Word has length 25 [2019-12-07 16:21:01,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:21:01,766 INFO L462 AbstractCegarLoop]: Abstraction has 394 states and 592 transitions. [2019-12-07 16:21:01,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:21:01,766 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 592 transitions. [2019-12-07 16:21:01,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 16:21:01,768 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:21:01,769 INFO L410 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] [2019-12-07 16:21:01,969 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 16:21:01,969 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:21:01,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:21:01,970 INFO L82 PathProgramCache]: Analyzing trace with hash 384753001, now seen corresponding path program 1 times [2019-12-07 16:21:01,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:21:01,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [44836867] [2019-12-07 16:21:01,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce957eef-ce21-4a41-b05d-851c57f5f61e/bin/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 16:21:02,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:21:02,010 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 16:21:02,011 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:21:02,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:21:02,039 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:21:02,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:21:02,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [44836867] [2019-12-07 16:21:02,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:21:02,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2019-12-07 16:21:02,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778496286] [2019-12-07 16:21:02,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 16:21:02,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:21:02,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 16:21:02,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-12-07 16:21:02,089 INFO L87 Difference]: Start difference. First operand 394 states and 592 transitions. Second operand 12 states. [2019-12-07 16:21:02,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:21:02,490 INFO L93 Difference]: Finished difference Result 1098 states and 1726 transitions. [2019-12-07 16:21:02,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 16:21:02,490 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2019-12-07 16:21:02,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:21:02,494 INFO L225 Difference]: With dead ends: 1098 [2019-12-07 16:21:02,494 INFO L226 Difference]: Without dead ends: 939 [2019-12-07 16:21:02,496 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2019-12-07 16:21:02,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2019-12-07 16:21:02,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 720. [2019-12-07 16:21:02,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-12-07 16:21:02,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1083 transitions. [2019-12-07 16:21:02,515 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1083 transitions. Word has length 27 [2019-12-07 16:21:02,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:21:02,515 INFO L462 AbstractCegarLoop]: Abstraction has 720 states and 1083 transitions. [2019-12-07 16:21:02,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 16:21:02,515 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1083 transitions. [2019-12-07 16:21:02,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 16:21:02,517 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:21:02,517 INFO L410 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] [2019-12-07 16:21:02,717 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 16:21:02,718 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:21:02,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:21:02,719 INFO L82 PathProgramCache]: Analyzing trace with hash -685167599, now seen corresponding path program 1 times [2019-12-07 16:21:02,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:21:02,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [125454609] [2019-12-07 16:21:02,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce957eef-ce21-4a41-b05d-851c57f5f61e/bin/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-07 16:21:02,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:21:02,779 INFO L264 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 16:21:02,781 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:21:02,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:21:02,801 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:21:02,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:21:02,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [125454609] [2019-12-07 16:21:02,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:21:02,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 16:21:02,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462010531] [2019-12-07 16:21:02,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:21:02,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:21:02,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:21:02,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:21:02,818 INFO L87 Difference]: Start difference. First operand 720 states and 1083 transitions. Second operand 4 states. [2019-12-07 16:21:02,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:21:02,945 INFO L93 Difference]: Finished difference Result 1756 states and 2708 transitions. [2019-12-07 16:21:02,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:21:02,945 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-12-07 16:21:02,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:21:02,949 INFO L225 Difference]: With dead ends: 1756 [2019-12-07 16:21:02,949 INFO L226 Difference]: Without dead ends: 1105 [2019-12-07 16:21:02,950 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:21:02,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2019-12-07 16:21:02,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 1039. [2019-12-07 16:21:02,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1039 states. [2019-12-07 16:21:02,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1467 transitions. [2019-12-07 16:21:02,971 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1467 transitions. Word has length 30 [2019-12-07 16:21:02,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:21:02,971 INFO L462 AbstractCegarLoop]: Abstraction has 1039 states and 1467 transitions. [2019-12-07 16:21:02,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:21:02,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1467 transitions. [2019-12-07 16:21:02,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 16:21:02,973 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:21:02,973 INFO L410 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] [2019-12-07 16:21:03,173 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 16:21:03,173 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:21:03,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:21:03,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1269793299, now seen corresponding path program 1 times [2019-12-07 16:21:03,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:21:03,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1554972148] [2019-12-07 16:21:03,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce957eef-ce21-4a41-b05d-851c57f5f61e/bin/utaipan/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-12-07 16:21:03,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:21:03,198 INFO L264 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 16:21:03,199 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:21:03,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:21:03,204 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:21:03,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:21:03,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1554972148] [2019-12-07 16:21:03,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:21:03,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 16:21:03,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019555951] [2019-12-07 16:21:03,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:21:03,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:21:03,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:21:03,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:21:03,210 INFO L87 Difference]: Start difference. First operand 1039 states and 1467 transitions. Second operand 4 states. [2019-12-07 16:21:03,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:21:03,297 INFO L93 Difference]: Finished difference Result 2036 states and 2888 transitions. [2019-12-07 16:21:03,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:21:03,297 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-12-07 16:21:03,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:21:03,301 INFO L225 Difference]: With dead ends: 2036 [2019-12-07 16:21:03,301 INFO L226 Difference]: Without dead ends: 1108 [2019-12-07 16:21:03,302 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:21:03,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2019-12-07 16:21:03,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 1023. [2019-12-07 16:21:03,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1023 states. [2019-12-07 16:21:03,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1398 transitions. [2019-12-07 16:21:03,323 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1398 transitions. Word has length 30 [2019-12-07 16:21:03,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:21:03,323 INFO L462 AbstractCegarLoop]: Abstraction has 1023 states and 1398 transitions. [2019-12-07 16:21:03,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:21:03,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1398 transitions. [2019-12-07 16:21:03,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 16:21:03,324 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:21:03,324 INFO L410 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] [2019-12-07 16:21:03,525 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 16:21:03,525 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:21:03,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:21:03,525 INFO L82 PathProgramCache]: Analyzing trace with hash -900742063, now seen corresponding path program 1 times [2019-12-07 16:21:03,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:21:03,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1535450264] [2019-12-07 16:21:03,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce957eef-ce21-4a41-b05d-851c57f5f61e/bin/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-12-07 16:21:03,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:21:03,547 INFO L264 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 16:21:03,548 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:21:03,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:21:03,585 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:21:03,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:21:03,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1535450264] [2019-12-07 16:21:03,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 16:21:03,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2019-12-07 16:21:03,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544365481] [2019-12-07 16:21:03,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:21:03,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:21:03,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:21:03,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-12-07 16:21:03,645 INFO L87 Difference]: Start difference. First operand 1023 states and 1398 transitions. Second operand 6 states. [2019-12-07 16:21:03,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:21:03,861 INFO L93 Difference]: Finished difference Result 1385 states and 1902 transitions. [2019-12-07 16:21:03,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:21:03,861 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-12-07 16:21:03,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:21:03,865 INFO L225 Difference]: With dead ends: 1385 [2019-12-07 16:21:03,865 INFO L226 Difference]: Without dead ends: 1117 [2019-12-07 16:21:03,866 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-12-07 16:21:03,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2019-12-07 16:21:03,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1065. [2019-12-07 16:21:03,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1065 states. [2019-12-07 16:21:03,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1448 transitions. [2019-12-07 16:21:03,886 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1448 transitions. Word has length 30 [2019-12-07 16:21:03,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:21:03,886 INFO L462 AbstractCegarLoop]: Abstraction has 1065 states and 1448 transitions. [2019-12-07 16:21:03,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:21:03,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1448 transitions. [2019-12-07 16:21:03,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 16:21:03,887 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:21:03,887 INFO L410 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] [2019-12-07 16:21:04,087 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 16:21:04,088 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:21:04,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:21:04,088 INFO L82 PathProgramCache]: Analyzing trace with hash -342382578, now seen corresponding path program 1 times [2019-12-07 16:21:04,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:21:04,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [899371928] [2019-12-07 16:21:04,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce957eef-ce21-4a41-b05d-851c57f5f61e/bin/utaipan/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-12-07 16:21:04,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:21:04,116 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 16:21:04,117 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:21:04,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:21:04,142 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:21:04,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:21:04,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [899371928] [2019-12-07 16:21:04,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1835820147] [2019-12-07 16:21:04,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce957eef-ce21-4a41-b05d-851c57f5f61e/bin/utaipan/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 16:21:04,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:21:04,245 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 16:21:04,246 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:21:04,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:21:04,251 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:21:04,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:21:04,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115773141] [2019-12-07 16:21:04,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce957eef-ce21-4a41-b05d-851c57f5f61e/bin/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:21:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:21:04,306 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 16:21:04,307 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:21:04,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:21:04,327 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:21:04,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:21:04,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 16:21:04,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 4, 4] total 14 [2019-12-07 16:21:04,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096369825] [2019-12-07 16:21:04,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 16:21:04,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:21:04,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 16:21:04,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-07 16:21:04,358 INFO L87 Difference]: Start difference. First operand 1065 states and 1448 transitions. Second operand 14 states. [2019-12-07 16:21:05,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:21:05,619 INFO L93 Difference]: Finished difference Result 3140 states and 4419 transitions. [2019-12-07 16:21:05,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-07 16:21:05,619 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2019-12-07 16:21:05,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:21:05,628 INFO L225 Difference]: With dead ends: 3140 [2019-12-07 16:21:05,628 INFO L226 Difference]: Without dead ends: 1896 [2019-12-07 16:21:05,630 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=393, Invalid=939, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 16:21:05,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2019-12-07 16:21:05,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1469. [2019-12-07 16:21:05,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1469 states. [2019-12-07 16:21:05,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 2026 transitions. [2019-12-07 16:21:05,670 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 2026 transitions. Word has length 31 [2019-12-07 16:21:05,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:21:05,670 INFO L462 AbstractCegarLoop]: Abstraction has 1469 states and 2026 transitions. [2019-12-07 16:21:05,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 16:21:05,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 2026 transitions. [2019-12-07 16:21:05,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 16:21:05,671 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:21:05,671 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:21:06,272 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,10 mathsat -unsat_core_generation=3,11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 16:21:06,272 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:21:06,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:21:06,273 INFO L82 PathProgramCache]: Analyzing trace with hash 126573537, now seen corresponding path program 1 times [2019-12-07 16:21:06,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:21:06,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1830164207] [2019-12-07 16:21:06,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce957eef-ce21-4a41-b05d-851c57f5f61e/bin/utaipan/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-12-07 16:21:06,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:21:06,301 INFO L264 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-07 16:21:06,304 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:21:07,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:21:07,592 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 16:21:07,592 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:21:09,443 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 16:21:09,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1830164207] [2019-12-07 16:21:09,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [435420560] [2019-12-07 16:21:09,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce957eef-ce21-4a41-b05d-851c57f5f61e/bin/utaipan/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 16:21:09,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:21:09,498 INFO L264 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 35 conjunts are in the unsatisfiable core [2019-12-07 16:21:09,500 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:21:09,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:21:09,748 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 16:21:09,748 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:21:09,959 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 16:21:09,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820982391] [2019-12-07 16:21:09,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce957eef-ce21-4a41-b05d-851c57f5f61e/bin/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:21:09,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:21:09,992 INFO L264 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-07 16:21:09,993 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:21:10,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:21:10,036 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 16:21:10,036 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:21:10,052 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 16:21:10,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 16:21:10,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19, 19, 19, 19] total 41 [2019-12-07 16:21:10,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379146786] [2019-12-07 16:21:10,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-12-07 16:21:10,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:21:10,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-12-07 16:21:10,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1533, Unknown=0, NotChecked=0, Total=1722 [2019-12-07 16:21:10,054 INFO L87 Difference]: Start difference. First operand 1469 states and 2026 transitions. Second operand 42 states. [2019-12-07 16:21:25,853 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 84 [2019-12-07 16:21:28,563 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 77 [2019-12-07 16:21:29,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:21:29,062 INFO L93 Difference]: Finished difference Result 2486 states and 3339 transitions. [2019-12-07 16:21:29,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-12-07 16:21:29,063 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 50 [2019-12-07 16:21:29,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:21:29,071 INFO L225 Difference]: With dead ends: 2486 [2019-12-07 16:21:29,071 INFO L226 Difference]: Without dead ends: 2402 [2019-12-07 16:21:29,074 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2525 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=3047, Invalid=9609, Unknown=0, NotChecked=0, Total=12656 [2019-12-07 16:21:29,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2402 states. [2019-12-07 16:21:29,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2402 to 1646. [2019-12-07 16:21:29,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1646 states. [2019-12-07 16:21:29,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 2264 transitions. [2019-12-07 16:21:29,107 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 2264 transitions. Word has length 50 [2019-12-07 16:21:29,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:21:29,108 INFO L462 AbstractCegarLoop]: Abstraction has 1646 states and 2264 transitions. [2019-12-07 16:21:29,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-12-07 16:21:29,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 2264 transitions. [2019-12-07 16:21:29,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 16:21:29,109 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:21:29,109 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:21:29,711 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3,14 cvc4 --incremental --print-success --lang smt --rewrite-divk,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:21:29,712 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:21:29,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:21:29,713 INFO L82 PathProgramCache]: Analyzing trace with hash -884543713, now seen corresponding path program 1 times [2019-12-07 16:21:29,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:21:29,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [974300661] [2019-12-07 16:21:29,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce957eef-ce21-4a41-b05d-851c57f5f61e/bin/utaipan/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-12-07 16:21:29,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:21:29,756 INFO L264 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 16:21:29,757 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:21:29,783 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 16:21:29,783 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:21:29,799 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 16:21:29,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [974300661] [2019-12-07 16:21:29,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [736605916] [2019-12-07 16:21:29,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce957eef-ce21-4a41-b05d-851c57f5f61e/bin/utaipan/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 16:21:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:21:29,833 INFO L264 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 16:21:29,834 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:21:29,866 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 16:21:29,866 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:21:29,872 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 16:21:29,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596700207] [2019-12-07 16:21:29,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce957eef-ce21-4a41-b05d-851c57f5f61e/bin/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:21:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:21:29,896 INFO L264 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 16:21:29,896 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:21:29,916 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 16:21:29,916 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:21:29,933 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 16:21:29,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 16:21:29,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 8, 5, 5, 4] total 12 [2019-12-07 16:21:29,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042040392] [2019-12-07 16:21:29,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 16:21:29,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:21:29,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 16:21:29,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-07 16:21:29,935 INFO L87 Difference]: Start difference. First operand 1646 states and 2264 transitions. Second operand 12 states. [2019-12-07 16:21:32,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:21:32,274 INFO L93 Difference]: Finished difference Result 3513 states and 4914 transitions. [2019-12-07 16:21:32,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-07 16:21:32,274 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2019-12-07 16:21:32,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:21:32,281 INFO L225 Difference]: With dead ends: 3513 [2019-12-07 16:21:32,281 INFO L226 Difference]: Without dead ends: 1934 [2019-12-07 16:21:32,282 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 293 SyntacticMatches, 14 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=172, Invalid=758, Unknown=0, NotChecked=0, Total=930 [2019-12-07 16:21:32,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1934 states. [2019-12-07 16:21:32,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1934 to 1667. [2019-12-07 16:21:32,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1667 states. [2019-12-07 16:21:32,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2228 transitions. [2019-12-07 16:21:32,315 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2228 transitions. Word has length 50 [2019-12-07 16:21:32,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:21:32,315 INFO L462 AbstractCegarLoop]: Abstraction has 1667 states and 2228 transitions. [2019-12-07 16:21:32,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 16:21:32,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2228 transitions. [2019-12-07 16:21:32,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 16:21:32,317 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:21:32,317 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:21:32,918 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3,18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 16:21:32,920 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:21:32,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:21:32,921 INFO L82 PathProgramCache]: Analyzing trace with hash 103941283, now seen corresponding path program 1 times [2019-12-07 16:21:32,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:21:32,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [444051051] [2019-12-07 16:21:32,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce957eef-ce21-4a41-b05d-851c57f5f61e/bin/utaipan/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-12-07 16:21:32,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:21:32,995 INFO L264 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 16:21:32,997 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:21:33,008 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-07 16:21:33,008 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:21:33,021 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-07 16:21:33,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [444051051] [2019-12-07 16:21:33,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:21:33,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 16:21:33,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263127685] [2019-12-07 16:21:33,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:21:33,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:21:33,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:21:33,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:21:33,024 INFO L87 Difference]: Start difference. First operand 1667 states and 2228 transitions. Second operand 4 states. [2019-12-07 16:21:33,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:21:33,060 INFO L93 Difference]: Finished difference Result 2294 states and 3012 transitions. [2019-12-07 16:21:33,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:21:33,061 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-12-07 16:21:33,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:21:33,068 INFO L225 Difference]: With dead ends: 2294 [2019-12-07 16:21:33,068 INFO L226 Difference]: Without dead ends: 2255 [2019-12-07 16:21:33,069 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:21:33,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2255 states. [2019-12-07 16:21:33,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2255 to 2057. [2019-12-07 16:21:33,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2057 states. [2019-12-07 16:21:33,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 2057 states and 2716 transitions. [2019-12-07 16:21:33,111 INFO L78 Accepts]: Start accepts. Automaton has 2057 states and 2716 transitions. Word has length 50 [2019-12-07 16:21:33,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:21:33,111 INFO L462 AbstractCegarLoop]: Abstraction has 2057 states and 2716 transitions. [2019-12-07 16:21:33,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:21:33,112 INFO L276 IsEmpty]: Start isEmpty. Operand 2057 states and 2716 transitions. [2019-12-07 16:21:33,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 16:21:33,113 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:21:33,114 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:21:33,314 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-12-07 16:21:33,315 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:21:33,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:21:33,316 INFO L82 PathProgramCache]: Analyzing trace with hash -770819741, now seen corresponding path program 1 times [2019-12-07 16:21:33,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:21:33,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1828298961] [2019-12-07 16:21:33,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce957eef-ce21-4a41-b05d-851c57f5f61e/bin/utaipan/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2019-12-07 16:21:33,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:21:33,383 INFO L264 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 16:21:33,383 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:21:33,417 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-07 16:21:33,417 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:21:33,473 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-07 16:21:33,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1828298961] [2019-12-07 16:21:33,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 16:21:33,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-12-07 16:21:33,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442548150] [2019-12-07 16:21:33,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 16:21:33,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 16:21:33,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 16:21:33,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-07 16:21:33,474 INFO L87 Difference]: Start difference. First operand 2057 states and 2716 transitions. Second operand 7 states. [2019-12-07 16:21:33,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:21:33,720 INFO L93 Difference]: Finished difference Result 2329 states and 3063 transitions. [2019-12-07 16:21:33,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:21:33,721 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-07 16:21:33,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:21:33,729 INFO L225 Difference]: With dead ends: 2329 [2019-12-07 16:21:33,729 INFO L226 Difference]: Without dead ends: 2176 [2019-12-07 16:21:33,729 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-07 16:21:33,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2176 states. [2019-12-07 16:21:33,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2176 to 2051. [2019-12-07 16:21:33,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2051 states. [2019-12-07 16:21:33,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2051 states to 2051 states and 2708 transitions. [2019-12-07 16:21:33,769 INFO L78 Accepts]: Start accepts. Automaton has 2051 states and 2708 transitions. Word has length 50 [2019-12-07 16:21:33,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:21:33,769 INFO L462 AbstractCegarLoop]: Abstraction has 2051 states and 2708 transitions. [2019-12-07 16:21:33,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 16:21:33,769 INFO L276 IsEmpty]: Start isEmpty. Operand 2051 states and 2708 transitions. [2019-12-07 16:21:33,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 16:21:33,770 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:21:33,770 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:21:33,971 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-12-07 16:21:33,971 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:21:33,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:21:33,972 INFO L82 PathProgramCache]: Analyzing trace with hash 928939180, now seen corresponding path program 1 times [2019-12-07 16:21:33,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 16:21:33,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1683202680] [2019-12-07 16:21:33,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce957eef-ce21-4a41-b05d-851c57f5f61e/bin/utaipan/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-12-07 16:21:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:21:34,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:21:34,100 INFO L174 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2019-12-07 16:21:34,101 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 16:21:34,301 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-12-07 16:21:34,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:21:34 BoogieIcfgContainer [2019-12-07 16:21:34,358 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 16:21:34,359 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 16:21:34,359 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 16:21:34,359 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 16:21:34,359 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:20:59" (3/4) ... [2019-12-07 16:21:34,361 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 16:21:34,402 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ce957eef-ce21-4a41-b05d-851c57f5f61e/bin/utaipan/witness.graphml [2019-12-07 16:21:34,402 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 16:21:34,403 INFO L168 Benchmark]: Toolchain (without parser) took 35345.79 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 369.6 MB). Free memory was 953.7 MB in the beginning and 1.2 GB in the end (delta: -271.7 MB). Peak memory consumption was 97.9 MB. Max. memory is 11.5 GB. [2019-12-07 16:21:34,403 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:21:34,403 INFO L168 Benchmark]: CACSL2BoogieTranslator took 207.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -161.9 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-12-07 16:21:34,404 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.28 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:21:34,404 INFO L168 Benchmark]: Boogie Preprocessor took 19.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:21:34,404 INFO L168 Benchmark]: RCFGBuilder took 244.47 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: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. [2019-12-07 16:21:34,404 INFO L168 Benchmark]: TraceAbstraction took 34801.27 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 242.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -135.2 MB). Peak memory consumption was 107.5 MB. Max. memory is 11.5 GB. [2019-12-07 16:21:34,404 INFO L168 Benchmark]: Witness Printer took 43.49 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:21:34,405 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 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 207.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -161.9 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.28 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 244.47 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: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 34801.27 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 242.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -135.2 MB). Peak memory consumption was 107.5 MB. Max. memory is 11.5 GB. * Witness Printer took 43.49 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 6]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L105] unsigned int a, b, r; [L107] a = __VERIFIER_nondet_uint() [L108] b = __VERIFIER_nondet_uint() [L23] unsigned char a0, a1, a2, a3; [L24] unsigned char b0, b1, b2, b3; [L25] unsigned char r0, r1, r2, r3; [L26] unsigned short carry; [L27] unsigned short partial_sum; [L28] unsigned int r; [L29] unsigned char i; [L30] unsigned char na, nb; [L31] a0 = a [L32] a1 = a >> 8 [L33] a2 = a >> 16U [L34] a3 = a >> 24U [L35] b0 = b [L36] b1 = b >> 8U [L37] b2 = b >> 16U [L38] b3 = b >> 24U [L39] na = (unsigned char)4 [L40] COND TRUE a3 == (unsigned char)0 [L41] na = na - 1 [L42] COND TRUE a2 == (unsigned char)0 [L43] na = na - 1 [L44] COND TRUE a1 == (unsigned char)0 [L45] na = na - 1 [L49] nb = (unsigned char)4 [L50] COND TRUE b3 == (unsigned char)0 [L51] nb = nb - 1 [L52] COND TRUE b2 == (unsigned char)0 [L53] nb = nb - 1 [L54] COND TRUE b1 == (unsigned char)0 [L55] nb = nb - 1 [L59] carry = (unsigned short)0 [L60] i = (unsigned char)0 [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 [L64] COND TRUE i < na [L65] COND TRUE i == (unsigned char)0 [L65] partial_sum = partial_sum + a0 [L66] COND FALSE !(i == (unsigned char)1) [L67] COND FALSE !(i == (unsigned char)2) [L68] COND FALSE !(i == (unsigned char)3) [L70] COND TRUE i < nb [L71] COND TRUE i == (unsigned char)0 [L71] partial_sum = partial_sum + b0 [L72] COND FALSE !(i == (unsigned char)1) [L73] COND FALSE !(i == (unsigned char)2) [L74] COND FALSE !(i == (unsigned char)3) [L76] COND TRUE partial_sum > ((unsigned char)254) [L77] partial_sum = partial_sum & ((unsigned char)255) [L78] carry = (unsigned short)1 [L80] COND TRUE i == (unsigned char)0 [L80] r0 = (unsigned char)partial_sum [L81] COND FALSE !(i == (unsigned char)1) [L82] COND FALSE !(i == (unsigned char)2) [L83] COND FALSE !(i == (unsigned char)3) [L85] i = i + (unsigned char)1 [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 [L64] COND FALSE !(i < na) [L70] COND FALSE !(i < nb) [L76] COND FALSE !(partial_sum > ((unsigned char)254)) [L80] COND FALSE !(i == (unsigned char)0) [L81] COND TRUE i == (unsigned char)1 [L81] r1 = (unsigned char)partial_sum [L82] COND FALSE !(i == (unsigned char)2) [L83] COND FALSE !(i == (unsigned char)3) [L85] i = i + (unsigned char)1 [L61] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) [L88] COND TRUE i < (unsigned char)4 [L89] COND FALSE !(i == (unsigned char)0) [L90] COND FALSE !(i == (unsigned char)1) [L91] COND TRUE i == (unsigned char)2 [L91] r2 = (unsigned char)0 [L92] COND FALSE !(i == (unsigned char)3) [L94] i = i + (unsigned char)1 [L88] COND TRUE i < (unsigned char)4 [L89] COND FALSE !(i == (unsigned char)0) [L90] COND FALSE !(i == (unsigned char)1) [L91] COND FALSE !(i == (unsigned char)2) [L92] COND TRUE i == (unsigned char)3 [L92] r3 = (unsigned char)0 [L94] i = i + (unsigned char)1 [L88] COND FALSE !(i < (unsigned char)4) [L97] r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) [L99] return r; [L110] r = mp_add(a, b) [L5] COND TRUE !(cond) [L6] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 41 locations, 1 error locations. Result: UNSAFE, OverallTime: 34.7s, OverallIterations: 14, TraceHistogramMax: 3, AutomataDifference: 24.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1132 SDtfs, 6653 SDslu, 6357 SDs, 0 SdLazy, 11770 SolverSat, 940 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1446 GetRequests, 1197 SyntacticMatches, 14 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 3192 ImplicationChecksByTransitivity, 14.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2057occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 2536 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 723 NumberOfCodeBlocks, 723 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1302 ConstructedInterpolants, 41 QuantifiedInterpolants, 747860 SizeOfPredicates, 100 NumberOfNonLiveVariables, 1275 ConjunctsInSsa, 169 ConjunctsInUnsatCore, 38 InterpolantComputations, 18 PerfectInterpolantSequences, 273/368 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 incorrect! Received shutdown request...