./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label42.c --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_cd7d5740-f1f9-4505-b075-76fb707a6c1a/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_cd7d5740-f1f9-4505-b075-76fb707a6c1a/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_cd7d5740-f1f9-4505-b075-76fb707a6c1a/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_cd7d5740-f1f9-4505-b075-76fb707a6c1a/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label42.c -s /tmp/vcloud-vcloud-master/worker/run_dir_cd7d5740-f1f9-4505-b075-76fb707a6c1a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_cd7d5740-f1f9-4505-b075-76fb707a6c1a/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 1ced3eb982b16bda97708eba7d7a33ef6d709871 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 20:39:23,187 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 20:39:23,189 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 20:39:23,199 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 20:39:23,199 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 20:39:23,200 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 20:39:23,202 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 20:39:23,203 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 20:39:23,205 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 20:39:23,206 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 20:39:23,207 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 20:39:23,208 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 20:39:23,208 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 20:39:23,209 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 20:39:23,210 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 20:39:23,211 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 20:39:23,212 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 20:39:23,213 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 20:39:23,214 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 20:39:23,217 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 20:39:23,218 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 20:39:23,219 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 20:39:23,220 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 20:39:23,220 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 20:39:23,222 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 20:39:23,223 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 20:39:23,223 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 20:39:23,223 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 20:39:23,224 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 20:39:23,225 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 20:39:23,225 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 20:39:23,225 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 20:39:23,226 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 20:39:23,227 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 20:39:23,227 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 20:39:23,228 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 20:39:23,228 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 20:39:23,228 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 20:39:23,228 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 20:39:23,229 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 20:39:23,230 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 20:39:23,230 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_cd7d5740-f1f9-4505-b075-76fb707a6c1a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 20:39:23,243 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 20:39:23,243 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 20:39:23,244 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 20:39:23,244 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 20:39:23,244 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 20:39:23,244 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 20:39:23,245 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 20:39:23,245 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 20:39:23,245 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 20:39:23,245 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 20:39:23,245 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 20:39:23,246 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 20:39:23,246 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 20:39:23,246 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 20:39:23,246 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 20:39:23,247 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 20:39:23,247 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 20:39:23,247 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 20:39:23,247 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 20:39:23,247 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 20:39:23,248 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 20:39:23,248 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 20:39:23,248 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 20:39:23,248 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 20:39:23,248 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 20:39:23,249 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 20:39:23,249 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 20:39:23,249 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 20:39:23,249 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 20:39:23,250 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 20:39:23,250 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 20:39:23,250 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:39:23,250 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 20:39:23,250 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 20:39:23,251 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 20:39:23,251 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 20:39:23,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 20:39:23,251 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 20:39:23,251 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 20:39:23,252 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 20:39:23,252 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_cd7d5740-f1f9-4505-b075-76fb707a6c1a/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 -> 1ced3eb982b16bda97708eba7d7a33ef6d709871 [2019-12-07 20:39:23,381 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 20:39:23,390 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 20:39:23,393 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 20:39:23,394 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 20:39:23,395 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 20:39:23,395 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_cd7d5740-f1f9-4505-b075-76fb707a6c1a/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label42.c [2019-12-07 20:39:23,441 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cd7d5740-f1f9-4505-b075-76fb707a6c1a/bin/utaipan/data/9416cf9ee/7f9fc7380b3343eaaa569bd62f143c78/FLAG0efa9b40d [2019-12-07 20:39:23,820 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 20:39:23,821 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_cd7d5740-f1f9-4505-b075-76fb707a6c1a/sv-benchmarks/c/eca-rers2012/Problem01_label42.c [2019-12-07 20:39:23,829 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cd7d5740-f1f9-4505-b075-76fb707a6c1a/bin/utaipan/data/9416cf9ee/7f9fc7380b3343eaaa569bd62f143c78/FLAG0efa9b40d [2019-12-07 20:39:23,838 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_cd7d5740-f1f9-4505-b075-76fb707a6c1a/bin/utaipan/data/9416cf9ee/7f9fc7380b3343eaaa569bd62f143c78 [2019-12-07 20:39:23,840 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 20:39:23,841 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 20:39:23,842 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 20:39:23,842 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 20:39:23,844 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 20:39:23,844 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:39:23" (1/1) ... [2019-12-07 20:39:23,846 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20cc73ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:39:23, skipping insertion in model container [2019-12-07 20:39:23,846 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:39:23" (1/1) ... [2019-12-07 20:39:23,851 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 20:39:23,882 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 20:39:24,127 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:39:24,130 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 20:39:24,182 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:39:24,192 INFO L208 MainTranslator]: Completed translation [2019-12-07 20:39:24,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:39:24 WrapperNode [2019-12-07 20:39:24,193 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 20:39:24,193 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 20:39:24,193 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 20:39:24,193 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 20:39:24,199 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:39:24" (1/1) ... [2019-12-07 20:39:24,211 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:39:24" (1/1) ... [2019-12-07 20:39:24,243 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 20:39:24,244 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 20:39:24,244 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 20:39:24,244 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 20:39:24,251 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:39:24" (1/1) ... [2019-12-07 20:39:24,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:39:24" (1/1) ... [2019-12-07 20:39:24,254 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:39:24" (1/1) ... [2019-12-07 20:39:24,254 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:39:24" (1/1) ... [2019-12-07 20:39:24,267 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:39:24" (1/1) ... [2019-12-07 20:39:24,274 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:39:24" (1/1) ... [2019-12-07 20:39:24,278 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:39:24" (1/1) ... [2019-12-07 20:39:24,282 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 20:39:24,282 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 20:39:24,282 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 20:39:24,282 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 20:39:24,283 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:39:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd7d5740-f1f9-4505-b075-76fb707a6c1a/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 20:39:24,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 20:39:24,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 20:39:25,390 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 20:39:25,391 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 20:39:25,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:39:25 BoogieIcfgContainer [2019-12-07 20:39:25,392 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 20:39:25,393 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 20:39:25,393 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 20:39:25,396 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 20:39:25,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 08:39:23" (1/3) ... [2019-12-07 20:39:25,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71f2d43d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:39:25, skipping insertion in model container [2019-12-07 20:39:25,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:39:24" (2/3) ... [2019-12-07 20:39:25,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71f2d43d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:39:25, skipping insertion in model container [2019-12-07 20:39:25,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:39:25" (3/3) ... [2019-12-07 20:39:25,399 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label42.c [2019-12-07 20:39:25,407 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 20:39:25,414 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 20:39:25,423 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 20:39:25,442 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 20:39:25,442 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 20:39:25,442 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 20:39:25,442 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 20:39:25,442 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 20:39:25,443 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 20:39:25,443 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 20:39:25,443 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 20:39:25,454 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-12-07 20:39:25,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 20:39:25,460 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:39:25,461 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:39:25,461 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:39:25,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:39:25,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1323232921, now seen corresponding path program 1 times [2019-12-07 20:39:25,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:39:25,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157150483] [2019-12-07 20:39:25,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:39:25,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:39:25,694 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 20:39:25,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157150483] [2019-12-07 20:39:25,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:39:25,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:39:25,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754068763] [2019-12-07 20:39:25,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:39:25,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:39:25,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:39:25,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:39:25,711 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 3 states. [2019-12-07 20:39:25,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:39:25,990 INFO L93 Difference]: Finished difference Result 224 states and 428 transitions. [2019-12-07 20:39:25,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:39:25,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-12-07 20:39:25,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:39:26,000 INFO L225 Difference]: With dead ends: 224 [2019-12-07 20:39:26,000 INFO L226 Difference]: Without dead ends: 145 [2019-12-07 20:39:26,002 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:39:26,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-12-07 20:39:26,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-12-07 20:39:26,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-12-07 20:39:26,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 253 transitions. [2019-12-07 20:39:26,034 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 253 transitions. Word has length 71 [2019-12-07 20:39:26,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:39:26,035 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 253 transitions. [2019-12-07 20:39:26,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:39:26,035 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 253 transitions. [2019-12-07 20:39:26,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 20:39:26,038 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:39:26,038 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:39:26,038 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:39:26,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:39:26,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1129617311, now seen corresponding path program 1 times [2019-12-07 20:39:26,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:39:26,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541559379] [2019-12-07 20:39:26,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:39:26,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:39:26,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 20:39:26,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541559379] [2019-12-07 20:39:26,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:39:26,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:39:26,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022470641] [2019-12-07 20:39:26,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:39:26,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:39:26,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:39:26,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:39:26,114 INFO L87 Difference]: Start difference. First operand 145 states and 253 transitions. Second operand 4 states. [2019-12-07 20:39:26,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:39:26,439 INFO L93 Difference]: Finished difference Result 573 states and 1007 transitions. [2019-12-07 20:39:26,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:39:26,439 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-12-07 20:39:26,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:39:26,443 INFO L225 Difference]: With dead ends: 573 [2019-12-07 20:39:26,443 INFO L226 Difference]: Without dead ends: 429 [2019-12-07 20:39:26,444 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 20:39:26,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-12-07 20:39:26,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 287. [2019-12-07 20:39:26,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-12-07 20:39:26,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 467 transitions. [2019-12-07 20:39:26,460 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 467 transitions. Word has length 75 [2019-12-07 20:39:26,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:39:26,460 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 467 transitions. [2019-12-07 20:39:26,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:39:26,461 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 467 transitions. [2019-12-07 20:39:26,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-07 20:39:26,463 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:39:26,464 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:39:26,464 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:39:26,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:39:26,464 INFO L82 PathProgramCache]: Analyzing trace with hash 466078421, now seen corresponding path program 1 times [2019-12-07 20:39:26,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:39:26,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517218667] [2019-12-07 20:39:26,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:39:26,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:39:26,522 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 20:39:26,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517218667] [2019-12-07 20:39:26,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:39:26,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:39:26,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063521128] [2019-12-07 20:39:26,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:39:26,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:39:26,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:39:26,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:39:26,524 INFO L87 Difference]: Start difference. First operand 287 states and 467 transitions. Second operand 3 states. [2019-12-07 20:39:26,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:39:26,756 INFO L93 Difference]: Finished difference Result 715 states and 1184 transitions. [2019-12-07 20:39:26,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:39:26,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-12-07 20:39:26,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:39:26,758 INFO L225 Difference]: With dead ends: 715 [2019-12-07 20:39:26,758 INFO L226 Difference]: Without dead ends: 429 [2019-12-07 20:39:26,760 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:39:26,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-12-07 20:39:26,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 358. [2019-12-07 20:39:26,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-12-07 20:39:26,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 587 transitions. [2019-12-07 20:39:26,773 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 587 transitions. Word has length 105 [2019-12-07 20:39:26,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:39:26,773 INFO L462 AbstractCegarLoop]: Abstraction has 358 states and 587 transitions. [2019-12-07 20:39:26,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:39:26,774 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 587 transitions. [2019-12-07 20:39:26,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-12-07 20:39:26,776 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:39:26,776 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:39:26,776 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:39:26,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:39:26,777 INFO L82 PathProgramCache]: Analyzing trace with hash -343769697, now seen corresponding path program 1 times [2019-12-07 20:39:26,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:39:26,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028671789] [2019-12-07 20:39:26,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:39:26,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:39:26,881 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 20:39:26,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028671789] [2019-12-07 20:39:26,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:39:26,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:39:26,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001339124] [2019-12-07 20:39:26,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:39:26,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:39:26,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:39:26,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:39:26,883 INFO L87 Difference]: Start difference. First operand 358 states and 587 transitions. Second operand 5 states. [2019-12-07 20:39:27,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:39:27,234 INFO L93 Difference]: Finished difference Result 788 states and 1270 transitions. [2019-12-07 20:39:27,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:39:27,234 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-12-07 20:39:27,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:39:27,236 INFO L225 Difference]: With dead ends: 788 [2019-12-07 20:39:27,236 INFO L226 Difference]: Without dead ends: 431 [2019-12-07 20:39:27,237 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:39:27,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-12-07 20:39:27,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 429. [2019-12-07 20:39:27,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-12-07 20:39:27,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 664 transitions. [2019-12-07 20:39:27,247 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 664 transitions. Word has length 109 [2019-12-07 20:39:27,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:39:27,247 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 664 transitions. [2019-12-07 20:39:27,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:39:27,247 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 664 transitions. [2019-12-07 20:39:27,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-12-07 20:39:27,249 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:39:27,250 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:39:27,250 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:39:27,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:39:27,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1189635625, now seen corresponding path program 1 times [2019-12-07 20:39:27,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:39:27,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73018729] [2019-12-07 20:39:27,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:39:27,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:39:27,287 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-12-07 20:39:27,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73018729] [2019-12-07 20:39:27,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:39:27,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:39:27,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46221579] [2019-12-07 20:39:27,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:39:27,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:39:27,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:39:27,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:39:27,288 INFO L87 Difference]: Start difference. First operand 429 states and 664 transitions. Second operand 3 states. [2019-12-07 20:39:27,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:39:27,502 INFO L93 Difference]: Finished difference Result 928 states and 1464 transitions. [2019-12-07 20:39:27,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:39:27,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-12-07 20:39:27,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:39:27,505 INFO L225 Difference]: With dead ends: 928 [2019-12-07 20:39:27,505 INFO L226 Difference]: Without dead ends: 571 [2019-12-07 20:39:27,506 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:39:27,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-12-07 20:39:27,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-12-07 20:39:27,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-12-07 20:39:27,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 842 transitions. [2019-12-07 20:39:27,516 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 842 transitions. Word has length 113 [2019-12-07 20:39:27,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:39:27,516 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 842 transitions. [2019-12-07 20:39:27,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:39:27,517 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 842 transitions. [2019-12-07 20:39:27,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-07 20:39:27,518 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:39:27,518 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:39:27,518 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:39:27,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:39:27,519 INFO L82 PathProgramCache]: Analyzing trace with hash 2049390037, now seen corresponding path program 1 times [2019-12-07 20:39:27,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:39:27,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692606640] [2019-12-07 20:39:27,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:39:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:39:27,557 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 20:39:27,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692606640] [2019-12-07 20:39:27,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:39:27,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:39:27,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694445896] [2019-12-07 20:39:27,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:39:27,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:39:27,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:39:27,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:39:27,559 INFO L87 Difference]: Start difference. First operand 571 states and 842 transitions. Second operand 4 states. [2019-12-07 20:39:27,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:39:27,943 INFO L93 Difference]: Finished difference Result 1709 states and 2533 transitions. [2019-12-07 20:39:27,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:39:27,943 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-12-07 20:39:27,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:39:27,948 INFO L225 Difference]: With dead ends: 1709 [2019-12-07 20:39:27,948 INFO L226 Difference]: Without dead ends: 1210 [2019-12-07 20:39:27,949 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:39:27,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2019-12-07 20:39:27,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 855. [2019-12-07 20:39:27,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-12-07 20:39:27,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1222 transitions. [2019-12-07 20:39:27,967 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1222 transitions. Word has length 122 [2019-12-07 20:39:27,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:39:27,967 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1222 transitions. [2019-12-07 20:39:27,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:39:27,967 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1222 transitions. [2019-12-07 20:39:27,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-12-07 20:39:27,969 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:39:27,969 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 20:39:27,970 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:39:27,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:39:27,970 INFO L82 PathProgramCache]: Analyzing trace with hash 2081948761, now seen corresponding path program 1 times [2019-12-07 20:39:27,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:39:27,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823849172] [2019-12-07 20:39:27,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:39:27,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:39:28,017 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-12-07 20:39:28,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823849172] [2019-12-07 20:39:28,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:39:28,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:39:28,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705771311] [2019-12-07 20:39:28,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:39:28,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:39:28,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:39:28,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:39:28,019 INFO L87 Difference]: Start difference. First operand 855 states and 1222 transitions. Second operand 4 states. [2019-12-07 20:39:28,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:39:28,348 INFO L93 Difference]: Finished difference Result 1638 states and 2366 transitions. [2019-12-07 20:39:28,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:39:28,348 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-12-07 20:39:28,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:39:28,353 INFO L225 Difference]: With dead ends: 1638 [2019-12-07 20:39:28,353 INFO L226 Difference]: Without dead ends: 855 [2019-12-07 20:39:28,354 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 20:39:28,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2019-12-07 20:39:28,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 855. [2019-12-07 20:39:28,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-12-07 20:39:28,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1216 transitions. [2019-12-07 20:39:28,372 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1216 transitions. Word has length 146 [2019-12-07 20:39:28,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:39:28,372 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1216 transitions. [2019-12-07 20:39:28,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:39:28,372 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1216 transitions. [2019-12-07 20:39:28,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-12-07 20:39:28,374 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:39:28,374 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 20:39:28,374 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:39:28,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:39:28,375 INFO L82 PathProgramCache]: Analyzing trace with hash -2114872442, now seen corresponding path program 1 times [2019-12-07 20:39:28,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:39:28,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046368102] [2019-12-07 20:39:28,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:39:28,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:39:28,503 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-12-07 20:39:28,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046368102] [2019-12-07 20:39:28,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:39:28,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 20:39:28,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370339256] [2019-12-07 20:39:28,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 20:39:28,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:39:28,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 20:39:28,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-07 20:39:28,505 INFO L87 Difference]: Start difference. First operand 855 states and 1216 transitions. Second operand 8 states. [2019-12-07 20:39:29,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:39:29,041 INFO L93 Difference]: Finished difference Result 1890 states and 2678 transitions. [2019-12-07 20:39:29,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 20:39:29,041 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 158 [2019-12-07 20:39:29,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:39:29,046 INFO L225 Difference]: With dead ends: 1890 [2019-12-07 20:39:29,046 INFO L226 Difference]: Without dead ends: 1107 [2019-12-07 20:39:29,047 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-07 20:39:29,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2019-12-07 20:39:29,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 997. [2019-12-07 20:39:29,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-12-07 20:39:29,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1376 transitions. [2019-12-07 20:39:29,082 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1376 transitions. Word has length 158 [2019-12-07 20:39:29,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:39:29,082 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1376 transitions. [2019-12-07 20:39:29,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 20:39:29,082 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1376 transitions. [2019-12-07 20:39:29,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-12-07 20:39:29,085 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:39:29,085 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 20:39:29,086 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:39:29,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:39:29,086 INFO L82 PathProgramCache]: Analyzing trace with hash 304804267, now seen corresponding path program 1 times [2019-12-07 20:39:29,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:39:29,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262682619] [2019-12-07 20:39:29,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:39:29,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:39:29,141 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-12-07 20:39:29,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262682619] [2019-12-07 20:39:29,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:39:29,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:39:29,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221390990] [2019-12-07 20:39:29,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:39:29,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:39:29,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:39:29,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:39:29,143 INFO L87 Difference]: Start difference. First operand 997 states and 1376 transitions. Second operand 4 states. [2019-12-07 20:39:29,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:39:29,425 INFO L93 Difference]: Finished difference Result 2348 states and 3226 transitions. [2019-12-07 20:39:29,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:39:29,425 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-12-07 20:39:29,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:39:29,429 INFO L225 Difference]: With dead ends: 2348 [2019-12-07 20:39:29,429 INFO L226 Difference]: Without dead ends: 1068 [2019-12-07 20:39:29,430 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 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 20:39:29,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2019-12-07 20:39:29,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 997. [2019-12-07 20:39:29,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-12-07 20:39:29,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1145 transitions. [2019-12-07 20:39:29,445 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1145 transitions. Word has length 161 [2019-12-07 20:39:29,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:39:29,445 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1145 transitions. [2019-12-07 20:39:29,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:39:29,446 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1145 transitions. [2019-12-07 20:39:29,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-12-07 20:39:29,447 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:39:29,448 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 20:39:29,448 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:39:29,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:39:29,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1219970857, now seen corresponding path program 1 times [2019-12-07 20:39:29,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:39:29,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799711523] [2019-12-07 20:39:29,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:39:29,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:39:29,537 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 98 proven. 4 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-12-07 20:39:29,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799711523] [2019-12-07 20:39:29,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751736510] [2019-12-07 20:39:29,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd7d5740-f1f9-4505-b075-76fb707a6c1a/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 20:39:29,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:39:29,612 INFO L264 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 20:39:29,619 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:39:29,660 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-12-07 20:39:29,660 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:39:29,694 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-12-07 20:39:29,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 20:39:29,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 4 [2019-12-07 20:39:29,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356204741] [2019-12-07 20:39:29,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:39:29,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:39:29,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:39:29,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:39:29,697 INFO L87 Difference]: Start difference. First operand 997 states and 1145 transitions. Second operand 3 states. [2019-12-07 20:39:29,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:39:29,930 INFO L93 Difference]: Finished difference Result 1993 states and 2302 transitions. [2019-12-07 20:39:29,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:39:29,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-12-07 20:39:29,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:39:29,934 INFO L225 Difference]: With dead ends: 1993 [2019-12-07 20:39:29,934 INFO L226 Difference]: Without dead ends: 1068 [2019-12-07 20:39:29,936 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 349 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:39:29,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2019-12-07 20:39:29,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 926. [2019-12-07 20:39:29,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-12-07 20:39:29,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1041 transitions. [2019-12-07 20:39:29,960 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1041 transitions. Word has length 175 [2019-12-07 20:39:29,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:39:29,960 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1041 transitions. [2019-12-07 20:39:29,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:39:29,960 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1041 transitions. [2019-12-07 20:39:29,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-12-07 20:39:29,964 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:39:29,964 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 20:39:30,165 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:39:30,165 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:39:30,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:39:30,165 INFO L82 PathProgramCache]: Analyzing trace with hash -75779706, now seen corresponding path program 1 times [2019-12-07 20:39:30,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:39:30,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580863424] [2019-12-07 20:39:30,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:39:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:39:30,323 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 141 proven. 70 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-12-07 20:39:30,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580863424] [2019-12-07 20:39:30,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544447613] [2019-12-07 20:39:30,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd7d5740-f1f9-4505-b075-76fb707a6c1a/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:39:30,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:39:30,403 INFO L264 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 20:39:30,409 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:39:30,451 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-12-07 20:39:30,451 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:39:30,481 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-12-07 20:39:30,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 20:39:30,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-12-07 20:39:30,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227760093] [2019-12-07 20:39:30,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:39:30,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:39:30,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:39:30,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:39:30,482 INFO L87 Difference]: Start difference. First operand 926 states and 1041 transitions. Second operand 3 states. [2019-12-07 20:39:30,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:39:30,644 INFO L93 Difference]: Finished difference Result 926 states and 1041 transitions. [2019-12-07 20:39:30,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:39:30,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-12-07 20:39:30,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:39:30,645 INFO L225 Difference]: With dead ends: 926 [2019-12-07 20:39:30,645 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 20:39:30,646 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 386 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:39:30,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 20:39:30,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 20:39:30,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 20:39:30,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 20:39:30,646 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 193 [2019-12-07 20:39:30,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:39:30,646 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 20:39:30,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:39:30,647 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 20:39:30,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 20:39:30,847 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:39:30,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 20:39:31,061 INFO L246 CegarLoopResult]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-12-07 20:39:31,061 INFO L246 CegarLoopResult]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-12-07 20:39:31,061 INFO L246 CegarLoopResult]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-12-07 20:39:31,061 INFO L246 CegarLoopResult]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-12-07 20:39:31,061 INFO L246 CegarLoopResult]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-12-07 20:39:31,061 INFO L246 CegarLoopResult]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-12-07 20:39:31,061 INFO L246 CegarLoopResult]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-12-07 20:39:31,062 INFO L246 CegarLoopResult]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-12-07 20:39:31,062 INFO L246 CegarLoopResult]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-12-07 20:39:31,062 INFO L246 CegarLoopResult]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-12-07 20:39:31,062 INFO L246 CegarLoopResult]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-12-07 20:39:31,062 INFO L246 CegarLoopResult]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-12-07 20:39:31,062 INFO L246 CegarLoopResult]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-12-07 20:39:31,062 INFO L246 CegarLoopResult]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-12-07 20:39:31,062 INFO L246 CegarLoopResult]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-12-07 20:39:31,062 INFO L246 CegarLoopResult]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-12-07 20:39:31,062 INFO L246 CegarLoopResult]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-12-07 20:39:31,063 INFO L242 CegarLoopResult]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse4 (= 13 ~a8~0))) (let ((.cse0 (not (= ~a16~0 6))) (.cse5 (= ~a17~0 1)) (.cse1 (<= ~a17~0 0)) (.cse6 (not .cse4)) (.cse3 (<= ~a21~0 0)) (.cse7 (not (= 15 ~a8~0))) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a20~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse5 .cse2 .cse6) (and .cse7 .cse2 .cse6 (= ~a16~0 5)) (and .cse1 .cse2 .cse6) (and .cse3 .cse4 .cse8) (and .cse7 .cse2 .cse8)))) [2019-12-07 20:39:31,063 INFO L246 CegarLoopResult]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-12-07 20:39:31,063 INFO L246 CegarLoopResult]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-12-07 20:39:31,063 INFO L246 CegarLoopResult]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-12-07 20:39:31,063 INFO L246 CegarLoopResult]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-12-07 20:39:31,063 INFO L246 CegarLoopResult]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-12-07 20:39:31,063 INFO L246 CegarLoopResult]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-12-07 20:39:31,063 INFO L246 CegarLoopResult]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-12-07 20:39:31,064 INFO L246 CegarLoopResult]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-12-07 20:39:31,064 INFO L249 CegarLoopResult]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-12-07 20:39:31,064 INFO L246 CegarLoopResult]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-12-07 20:39:31,064 INFO L246 CegarLoopResult]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-12-07 20:39:31,064 INFO L246 CegarLoopResult]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-12-07 20:39:31,064 INFO L246 CegarLoopResult]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-12-07 20:39:31,064 INFO L246 CegarLoopResult]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-12-07 20:39:31,064 INFO L246 CegarLoopResult]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-12-07 20:39:31,064 INFO L246 CegarLoopResult]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-12-07 20:39:31,064 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 20:39:31,065 INFO L246 CegarLoopResult]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-12-07 20:39:31,065 INFO L246 CegarLoopResult]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-12-07 20:39:31,065 INFO L246 CegarLoopResult]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-12-07 20:39:31,065 INFO L246 CegarLoopResult]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-12-07 20:39:31,065 INFO L246 CegarLoopResult]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-12-07 20:39:31,065 INFO L246 CegarLoopResult]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-12-07 20:39:31,065 INFO L242 CegarLoopResult]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse4 (= 13 ~a8~0))) (let ((.cse0 (not (= ~a16~0 6))) (.cse5 (= ~a17~0 1)) (.cse1 (<= ~a17~0 0)) (.cse6 (not .cse4)) (.cse3 (<= ~a21~0 0)) (.cse7 (not (= 15 ~a8~0))) (.cse2 (= ~a21~0 1)) (.cse8 (= ~a20~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse0 .cse5) (and .cse5 .cse2 .cse6) (and .cse7 .cse2 .cse6 (= ~a16~0 5)) (and .cse1 .cse2 .cse6) (and .cse3 .cse4 .cse8) (and .cse7 .cse2 .cse8)))) [2019-12-07 20:39:31,065 INFO L246 CegarLoopResult]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 20:39:31,065 INFO L246 CegarLoopResult]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-12-07 20:39:31,066 INFO L246 CegarLoopResult]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-12-07 20:39:31,066 INFO L246 CegarLoopResult]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-12-07 20:39:31,066 INFO L246 CegarLoopResult]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 20:39:31,066 INFO L246 CegarLoopResult]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-12-07 20:39:31,066 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 20:39:31,066 INFO L246 CegarLoopResult]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-12-07 20:39:31,066 INFO L246 CegarLoopResult]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-12-07 20:39:31,066 INFO L246 CegarLoopResult]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-12-07 20:39:31,066 INFO L246 CegarLoopResult]: For program point L521(line 521) no Hoare annotation was computed. [2019-12-07 20:39:31,066 INFO L246 CegarLoopResult]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-12-07 20:39:31,066 INFO L246 CegarLoopResult]: For program point L588(line 588) no Hoare annotation was computed. [2019-12-07 20:39:31,066 INFO L246 CegarLoopResult]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-12-07 20:39:31,066 INFO L246 CegarLoopResult]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-12-07 20:39:31,066 INFO L246 CegarLoopResult]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-12-07 20:39:31,066 INFO L246 CegarLoopResult]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-12-07 20:39:31,066 INFO L246 CegarLoopResult]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-12-07 20:39:31,066 INFO L246 CegarLoopResult]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-12-07 20:39:31,067 INFO L246 CegarLoopResult]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-12-07 20:39:31,067 INFO L246 CegarLoopResult]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-12-07 20:39:31,067 INFO L246 CegarLoopResult]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-12-07 20:39:31,067 INFO L246 CegarLoopResult]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-12-07 20:39:31,067 INFO L246 CegarLoopResult]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-12-07 20:39:31,067 INFO L246 CegarLoopResult]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-12-07 20:39:31,067 INFO L246 CegarLoopResult]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-12-07 20:39:31,067 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 521) no Hoare annotation was computed. [2019-12-07 20:39:31,067 INFO L246 CegarLoopResult]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-12-07 20:39:31,067 INFO L246 CegarLoopResult]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-12-07 20:39:31,067 INFO L246 CegarLoopResult]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-12-07 20:39:31,067 INFO L246 CegarLoopResult]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-12-07 20:39:31,067 INFO L246 CegarLoopResult]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-12-07 20:39:31,067 INFO L246 CegarLoopResult]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-12-07 20:39:31,067 INFO L246 CegarLoopResult]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-12-07 20:39:31,081 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 08:39:31 BoogieIcfgContainer [2019-12-07 20:39:31,081 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 20:39:31,081 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 20:39:31,082 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 20:39:31,082 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 20:39:31,082 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:39:25" (3/4) ... [2019-12-07 20:39:31,084 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 20:39:31,099 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 99 nodes and edges [2019-12-07 20:39:31,100 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-12-07 20:39:31,101 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-12-07 20:39:31,102 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 20:39:31,180 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_cd7d5740-f1f9-4505-b075-76fb707a6c1a/bin/utaipan/witness.graphml [2019-12-07 20:39:31,180 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 20:39:31,182 INFO L168 Benchmark]: Toolchain (without parser) took 7340.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 220.7 MB). Free memory was 934.0 MB in the beginning and 867.0 MB in the end (delta: 67.0 MB). Peak memory consumption was 287.7 MB. Max. memory is 11.5 GB. [2019-12-07 20:39:31,182 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:39:31,182 INFO L168 Benchmark]: CACSL2BoogieTranslator took 351.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.0 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -125.9 MB). Peak memory consumption was 29.6 MB. Max. memory is 11.5 GB. [2019-12-07 20:39:31,183 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.43 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: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2019-12-07 20:39:31,183 INFO L168 Benchmark]: Boogie Preprocessor took 38.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 20:39:31,183 INFO L168 Benchmark]: RCFGBuilder took 1109.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 834.8 MB in the end (delta: 209.0 MB). Peak memory consumption was 209.0 MB. Max. memory is 11.5 GB. [2019-12-07 20:39:31,184 INFO L168 Benchmark]: TraceAbstraction took 5688.29 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 834.8 MB in the beginning and 894.5 MB in the end (delta: -59.7 MB). Peak memory consumption was 74.0 MB. Max. memory is 11.5 GB. [2019-12-07 20:39:31,184 INFO L168 Benchmark]: Witness Printer took 98.68 ms. Allocated memory is still 1.2 GB. Free memory was 894.5 MB in the beginning and 867.0 MB in the end (delta: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 11.5 GB. [2019-12-07 20:39:31,185 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 351.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.0 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -125.9 MB). Peak memory consumption was 29.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.43 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: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1109.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 834.8 MB in the end (delta: 209.0 MB). Peak memory consumption was 209.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5688.29 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 834.8 MB in the beginning and 894.5 MB in the end (delta: -59.7 MB). Peak memory consumption was 74.0 MB. Max. memory is 11.5 GB. * Witness Printer took 98.68 ms. Allocated memory is still 1.2 GB. Free memory was 894.5 MB in the beginning and 867.0 MB in the end (delta: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 521]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((!(a16 == 6) && a17 <= 0) && a21 == 1) || (((a21 <= 0 && 13 == a8) && !(a16 == 6)) && a17 == 1)) || ((a17 == 1 && a21 == 1) && !(13 == a8))) || (((!(15 == a8) && a21 == 1) && !(13 == a8)) && a16 == 5)) || ((a17 <= 0 && a21 == 1) && !(13 == a8))) || ((a21 <= 0 && 13 == a8) && a20 == 1)) || ((!(15 == a8) && a21 == 1) && a20 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((!(a16 == 6) && a17 <= 0) && a21 == 1) || (((a21 <= 0 && 13 == a8) && !(a16 == 6)) && a17 == 1)) || ((a17 == 1 && a21 == 1) && !(13 == a8))) || (((!(15 == a8) && a21 == 1) && !(13 == a8)) && a16 == 5)) || ((a17 <= 0 && a21 == 1) && !(13 == a8))) || ((a21 <= 0 && 13 == a8) && a20 == 1)) || ((!(15 == a8) && a21 == 1) && a20 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 5.4s, OverallIterations: 11, TraceHistogramMax: 5, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 598 SDtfs, 1282 SDslu, 76 SDs, 0 SdLazy, 3393 SolverSat, 888 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 781 GetRequests, 746 SyntacticMatches, 7 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=997occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 893 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 41 NumberOfFragments, 169 HoareAnnotationTreeSize, 3 FomulaSimplifications, 5200 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 108 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1796 NumberOfCodeBlocks, 1796 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2149 ConstructedInterpolants, 0 QuantifiedInterpolants, 828870 SizeOfPredicates, 2 NumberOfNonLiveVariables, 770 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 15 InterpolantComputations, 13 PerfectInterpolantSequences, 1735/1809 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...