./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label09.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_6df7957e-ecbd-4776-8ab1-db85d2d528ef/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6df7957e-ecbd-4776-8ab1-db85d2d528ef/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6df7957e-ecbd-4776-8ab1-db85d2d528ef/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6df7957e-ecbd-4776-8ab1-db85d2d528ef/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label09.c -s /tmp/vcloud-vcloud-master/worker/run_dir_6df7957e-ecbd-4776-8ab1-db85d2d528ef/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6df7957e-ecbd-4776-8ab1-db85d2d528ef/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 31179e70784aebb46d762aef4da1a2ff63bbff38 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-26 02:56:56,209 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:56:56,211 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:56:56,228 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:56:56,229 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:56:56,230 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:56:56,231 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:56:56,239 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:56:56,243 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:56:56,246 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:56:56,247 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:56:56,248 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:56:56,248 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:56:56,250 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:56:56,251 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:56:56,252 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:56:56,252 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:56:56,253 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:56:56,255 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:56:56,259 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:56:56,262 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:56:56,265 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:56:56,266 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:56:56,267 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:56:56,269 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:56:56,269 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:56:56,269 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:56:56,270 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:56:56,271 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:56:56,271 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:56:56,271 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:56:56,272 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:56:56,273 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:56:56,273 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:56:56,274 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:56:56,274 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:56:56,275 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:56:56,275 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:56:56,275 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:56:56,276 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:56:56,277 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:56:56,278 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6df7957e-ecbd-4776-8ab1-db85d2d528ef/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:56:56,301 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:56:56,301 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:56:56,302 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:56:56,302 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:56:56,302 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:56:56,302 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:56:56,303 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:56:56,303 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:56:56,303 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:56:56,303 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:56:56,303 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:56:56,303 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:56:56,304 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:56:56,304 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:56:56,304 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:56:56,304 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:56:56,305 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:56:56,305 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:56:56,305 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:56:56,305 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:56:56,305 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:56:56,305 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:56:56,306 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:56:56,306 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:56:56,306 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:56:56,306 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:56:56,306 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:56:56,307 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:56:56,307 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:56:56,307 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:56:56,307 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:56:56,307 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:56:56,308 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:56:56,308 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:56:56,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:56:56,308 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:56:56,308 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:56:56,308 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_6df7957e-ecbd-4776-8ab1-db85d2d528ef/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 -> 31179e70784aebb46d762aef4da1a2ff63bbff38 [2019-11-26 02:56:56,455 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:56:56,468 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:56:56,472 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:56:56,479 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:56:56,480 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:56:56,480 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6df7957e-ecbd-4776-8ab1-db85d2d528ef/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label09.c [2019-11-26 02:56:56,548 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6df7957e-ecbd-4776-8ab1-db85d2d528ef/bin/utaipan/data/2338088e4/98d686dba0034ad2abf2273f083cd2f0/FLAGa994cba05 [2019-11-26 02:56:57,064 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:56:57,065 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6df7957e-ecbd-4776-8ab1-db85d2d528ef/sv-benchmarks/c/eca-rers2012/Problem01_label09.c [2019-11-26 02:56:57,077 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6df7957e-ecbd-4776-8ab1-db85d2d528ef/bin/utaipan/data/2338088e4/98d686dba0034ad2abf2273f083cd2f0/FLAGa994cba05 [2019-11-26 02:56:57,500 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6df7957e-ecbd-4776-8ab1-db85d2d528ef/bin/utaipan/data/2338088e4/98d686dba0034ad2abf2273f083cd2f0 [2019-11-26 02:56:57,502 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:56:57,503 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:56:57,504 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:56:57,504 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:56:57,507 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:56:57,508 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:56:57" (1/1) ... [2019-11-26 02:56:57,510 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d046a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:56:57, skipping insertion in model container [2019-11-26 02:56:57,510 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:56:57" (1/1) ... [2019-11-26 02:56:57,517 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:56:57,562 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:56:58,032 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:56:58,036 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:56:58,139 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:56:58,154 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:56:58,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:56:58 WrapperNode [2019-11-26 02:56:58,154 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:56:58,155 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:56:58,155 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:56:58,156 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:56:58,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:56:58" (1/1) ... [2019-11-26 02:56:58,182 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:56:58" (1/1) ... [2019-11-26 02:56:58,234 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:56:58,235 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:56:58,235 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:56:58,235 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:56:58,243 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:56:58" (1/1) ... [2019-11-26 02:56:58,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:56:58" (1/1) ... [2019-11-26 02:56:58,246 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:56:58" (1/1) ... [2019-11-26 02:56:58,247 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:56:58" (1/1) ... [2019-11-26 02:56:58,263 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:56:58" (1/1) ... [2019-11-26 02:56:58,272 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:56:58" (1/1) ... [2019-11-26 02:56:58,281 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:56:58" (1/1) ... [2019-11-26 02:56:58,285 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:56:58,286 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:56:58,286 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:56:58,287 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:56:58,287 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:56:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6df7957e-ecbd-4776-8ab1-db85d2d528ef/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-11-26 02:56:58,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:56:58,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:56:59,958 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:56:59,959 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-26 02:56:59,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:56:59 BoogieIcfgContainer [2019-11-26 02:56:59,960 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:56:59,961 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:56:59,961 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:56:59,964 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:56:59,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:56:57" (1/3) ... [2019-11-26 02:56:59,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ba6cba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:56:59, skipping insertion in model container [2019-11-26 02:56:59,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:56:58" (2/3) ... [2019-11-26 02:56:59,965 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ba6cba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:56:59, skipping insertion in model container [2019-11-26 02:56:59,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:56:59" (3/3) ... [2019-11-26 02:56:59,967 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label09.c [2019-11-26 02:56:59,976 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:56:59,982 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-26 02:56:59,992 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-26 02:57:00,022 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:57:00,023 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:57:00,023 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:57:00,023 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:57:00,023 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:57:00,024 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:57:00,024 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:57:00,024 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:57:00,043 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-26 02:57:00,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-26 02:57:00,052 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:00,053 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-11-26 02:57:00,055 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:00,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:00,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1323232153, now seen corresponding path program 1 times [2019-11-26 02:57:00,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:00,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383668817] [2019-11-26 02:57:00,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:00,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:00,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:00,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383668817] [2019-11-26 02:57:00,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:00,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:57:00,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812636398] [2019-11-26 02:57:00,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:57:00,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:00,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:57:00,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:00,453 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-11-26 02:57:01,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:01,158 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-11-26 02:57:01,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:57:01,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-26 02:57:01,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:01,172 INFO L225 Difference]: With dead ends: 297 [2019-11-26 02:57:01,172 INFO L226 Difference]: Without dead ends: 216 [2019-11-26 02:57:01,175 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-11-26 02:57:01,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-26 02:57:01,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 145. [2019-11-26 02:57:01,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-26 02:57:01,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 259 transitions. [2019-11-26 02:57:01,237 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 259 transitions. Word has length 71 [2019-11-26 02:57:01,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:01,238 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 259 transitions. [2019-11-26 02:57:01,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:57:01,238 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 259 transitions. [2019-11-26 02:57:01,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-26 02:57:01,241 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:01,241 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:57:01,241 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:01,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:01,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1048384774, now seen corresponding path program 1 times [2019-11-26 02:57:01,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:01,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821904314] [2019-11-26 02:57:01,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:01,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:01,293 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:01,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821904314] [2019-11-26 02:57:01,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:01,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:57:01,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126616151] [2019-11-26 02:57:01,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:57:01,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:01,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:57:01,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:01,297 INFO L87 Difference]: Start difference. First operand 145 states and 259 transitions. Second operand 4 states. [2019-11-26 02:57:01,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:01,879 INFO L93 Difference]: Finished difference Result 573 states and 1031 transitions. [2019-11-26 02:57:01,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:57:01,879 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-11-26 02:57:01,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:01,883 INFO L225 Difference]: With dead ends: 573 [2019-11-26 02:57:01,883 INFO L226 Difference]: Without dead ends: 429 [2019-11-26 02:57:01,886 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:01,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-26 02:57:01,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-11-26 02:57:01,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-26 02:57:01,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 707 transitions. [2019-11-26 02:57:01,938 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 707 transitions. Word has length 77 [2019-11-26 02:57:01,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:01,940 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 707 transitions. [2019-11-26 02:57:01,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:57:01,940 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 707 transitions. [2019-11-26 02:57:01,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-26 02:57:01,947 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:01,948 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:57:01,948 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:01,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:01,949 INFO L82 PathProgramCache]: Analyzing trace with hash -2123289446, now seen corresponding path program 1 times [2019-11-26 02:57:01,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:01,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771123688] [2019-11-26 02:57:01,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:02,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:02,083 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-26 02:57:02,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771123688] [2019-11-26 02:57:02,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:02,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:57:02,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52336655] [2019-11-26 02:57:02,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:57:02,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:02,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:57:02,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:57:02,089 INFO L87 Difference]: Start difference. First operand 429 states and 707 transitions. Second operand 3 states. [2019-11-26 02:57:02,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:02,425 INFO L93 Difference]: Finished difference Result 1212 states and 1980 transitions. [2019-11-26 02:57:02,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:57:02,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-11-26 02:57:02,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:02,430 INFO L225 Difference]: With dead ends: 1212 [2019-11-26 02:57:02,430 INFO L226 Difference]: Without dead ends: 784 [2019-11-26 02:57:02,433 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-11-26 02:57:02,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-11-26 02:57:02,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 642. [2019-11-26 02:57:02,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-11-26 02:57:02,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 955 transitions. [2019-11-26 02:57:02,458 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 955 transitions. Word has length 78 [2019-11-26 02:57:02,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:02,458 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 955 transitions. [2019-11-26 02:57:02,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:57:02,459 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 955 transitions. [2019-11-26 02:57:02,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-26 02:57:02,462 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:02,462 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:57:02,463 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:02,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:02,463 INFO L82 PathProgramCache]: Analyzing trace with hash 2133664500, now seen corresponding path program 1 times [2019-11-26 02:57:02,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:02,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710394394] [2019-11-26 02:57:02,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:02,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:02,509 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-26 02:57:02,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710394394] [2019-11-26 02:57:02,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:02,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:57:02,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404411248] [2019-11-26 02:57:02,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:57:02,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:02,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:57:02,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:57:02,511 INFO L87 Difference]: Start difference. First operand 642 states and 955 transitions. Second operand 3 states. [2019-11-26 02:57:02,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:02,870 INFO L93 Difference]: Finished difference Result 1496 states and 2249 transitions. [2019-11-26 02:57:02,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:57:02,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-26 02:57:02,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:02,875 INFO L225 Difference]: With dead ends: 1496 [2019-11-26 02:57:02,875 INFO L226 Difference]: Without dead ends: 855 [2019-11-26 02:57:02,877 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-11-26 02:57:02,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2019-11-26 02:57:02,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 713. [2019-11-26 02:57:02,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-11-26 02:57:02,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1057 transitions. [2019-11-26 02:57:02,898 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1057 transitions. Word has length 94 [2019-11-26 02:57:02,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:02,898 INFO L462 AbstractCegarLoop]: Abstraction has 713 states and 1057 transitions. [2019-11-26 02:57:02,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:57:02,898 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1057 transitions. [2019-11-26 02:57:02,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-26 02:57:02,901 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:02,901 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:57:02,901 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:02,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:02,901 INFO L82 PathProgramCache]: Analyzing trace with hash 501983831, now seen corresponding path program 1 times [2019-11-26 02:57:02,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:02,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500077635] [2019-11-26 02:57:02,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:02,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:02,983 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-26 02:57:02,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500077635] [2019-11-26 02:57:02,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:02,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:57:02,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290051229] [2019-11-26 02:57:02,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:57:02,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:02,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:57:02,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:57:02,985 INFO L87 Difference]: Start difference. First operand 713 states and 1057 transitions. Second operand 3 states. [2019-11-26 02:57:03,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:03,343 INFO L93 Difference]: Finished difference Result 1780 states and 2618 transitions. [2019-11-26 02:57:03,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:57:03,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-26 02:57:03,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:03,350 INFO L225 Difference]: With dead ends: 1780 [2019-11-26 02:57:03,350 INFO L226 Difference]: Without dead ends: 1068 [2019-11-26 02:57:03,351 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-11-26 02:57:03,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2019-11-26 02:57:03,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 855. [2019-11-26 02:57:03,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-11-26 02:57:03,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1241 transitions. [2019-11-26 02:57:03,373 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1241 transitions. Word has length 105 [2019-11-26 02:57:03,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:03,373 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1241 transitions. [2019-11-26 02:57:03,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:57:03,374 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1241 transitions. [2019-11-26 02:57:03,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-26 02:57:03,376 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:03,376 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-11-26 02:57:03,376 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:03,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:03,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1784758293, now seen corresponding path program 1 times [2019-11-26 02:57:03,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:03,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688859937] [2019-11-26 02:57:03,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:03,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:03,466 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-26 02:57:03,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688859937] [2019-11-26 02:57:03,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:03,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:57:03,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727265997] [2019-11-26 02:57:03,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:57:03,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:03,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:57:03,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:03,469 INFO L87 Difference]: Start difference. First operand 855 states and 1241 transitions. Second operand 4 states. [2019-11-26 02:57:03,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:03,917 INFO L93 Difference]: Finished difference Result 1809 states and 2593 transitions. [2019-11-26 02:57:03,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:57:03,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-11-26 02:57:03,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:03,923 INFO L225 Difference]: With dead ends: 1809 [2019-11-26 02:57:03,924 INFO L226 Difference]: Without dead ends: 955 [2019-11-26 02:57:03,925 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:57:03,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2019-11-26 02:57:03,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 926. [2019-11-26 02:57:03,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-26 02:57:03,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1318 transitions. [2019-11-26 02:57:03,977 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1318 transitions. Word has length 113 [2019-11-26 02:57:03,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:03,977 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1318 transitions. [2019-11-26 02:57:03,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:57:03,977 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1318 transitions. [2019-11-26 02:57:03,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-26 02:57:03,980 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:03,980 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-11-26 02:57:03,980 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:03,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:03,981 INFO L82 PathProgramCache]: Analyzing trace with hash 509280291, now seen corresponding path program 1 times [2019-11-26 02:57:03,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:03,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304971602] [2019-11-26 02:57:03,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:04,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:04,094 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-26 02:57:04,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304971602] [2019-11-26 02:57:04,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:04,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:57:04,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453430081] [2019-11-26 02:57:04,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:57:04,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:04,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:57:04,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:04,096 INFO L87 Difference]: Start difference. First operand 926 states and 1318 transitions. Second operand 4 states. [2019-11-26 02:57:04,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:04,597 INFO L93 Difference]: Finished difference Result 1780 states and 2558 transitions. [2019-11-26 02:57:04,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:57:04,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-11-26 02:57:04,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:04,602 INFO L225 Difference]: With dead ends: 1780 [2019-11-26 02:57:04,602 INFO L226 Difference]: Without dead ends: 926 [2019-11-26 02:57:04,604 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-11-26 02:57:04,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-11-26 02:57:04,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 926. [2019-11-26 02:57:04,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-26 02:57:04,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1312 transitions. [2019-11-26 02:57:04,624 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1312 transitions. Word has length 117 [2019-11-26 02:57:04,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:04,624 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1312 transitions. [2019-11-26 02:57:04,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:57:04,624 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1312 transitions. [2019-11-26 02:57:04,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-26 02:57:04,627 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:04,627 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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-11-26 02:57:04,627 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:04,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:04,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1638326758, now seen corresponding path program 1 times [2019-11-26 02:57:04,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:04,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571988640] [2019-11-26 02:57:04,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:04,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:04,774 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-11-26 02:57:04,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571988640] [2019-11-26 02:57:04,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:04,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:57:04,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894934122] [2019-11-26 02:57:04,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:57:04,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:04,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:57:04,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:57:04,777 INFO L87 Difference]: Start difference. First operand 926 states and 1312 transitions. Second operand 6 states. [2019-11-26 02:57:05,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:05,426 INFO L93 Difference]: Finished difference Result 2067 states and 2917 transitions. [2019-11-26 02:57:05,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:57:05,426 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2019-11-26 02:57:05,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:05,431 INFO L225 Difference]: With dead ends: 2067 [2019-11-26 02:57:05,431 INFO L226 Difference]: Without dead ends: 1213 [2019-11-26 02:57:05,432 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:57:05,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2019-11-26 02:57:05,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 1068. [2019-11-26 02:57:05,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2019-11-26 02:57:05,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1465 transitions. [2019-11-26 02:57:05,456 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1465 transitions. Word has length 131 [2019-11-26 02:57:05,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:05,457 INFO L462 AbstractCegarLoop]: Abstraction has 1068 states and 1465 transitions. [2019-11-26 02:57:05,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:57:05,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1465 transitions. [2019-11-26 02:57:05,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-11-26 02:57:05,460 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:05,460 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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-11-26 02:57:05,460 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:05,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:05,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1291929313, now seen corresponding path program 1 times [2019-11-26 02:57:05,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:05,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102877516] [2019-11-26 02:57:05,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:05,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:05,550 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-26 02:57:05,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102877516] [2019-11-26 02:57:05,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:05,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:57:05,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916347368] [2019-11-26 02:57:05,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:57:05,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:05,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:57:05,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:05,551 INFO L87 Difference]: Start difference. First operand 1068 states and 1465 transitions. Second operand 4 states. [2019-11-26 02:57:06,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:06,060 INFO L93 Difference]: Finished difference Result 2845 states and 3881 transitions. [2019-11-26 02:57:06,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:57:06,060 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-11-26 02:57:06,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:06,065 INFO L225 Difference]: With dead ends: 2845 [2019-11-26 02:57:06,065 INFO L226 Difference]: Without dead ends: 1352 [2019-11-26 02:57:06,067 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:06,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2019-11-26 02:57:06,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1139. [2019-11-26 02:57:06,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1139 states. [2019-11-26 02:57:06,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1313 transitions. [2019-11-26 02:57:06,094 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1313 transitions. Word has length 134 [2019-11-26 02:57:06,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:06,094 INFO L462 AbstractCegarLoop]: Abstraction has 1139 states and 1313 transitions. [2019-11-26 02:57:06,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:57:06,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1313 transitions. [2019-11-26 02:57:06,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-26 02:57:06,097 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:06,098 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:57:06,098 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:06,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:06,098 INFO L82 PathProgramCache]: Analyzing trace with hash 2055484374, now seen corresponding path program 1 times [2019-11-26 02:57:06,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:06,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861355419] [2019-11-26 02:57:06,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:06,265 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 139 proven. 27 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-26 02:57:06,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861355419] [2019-11-26 02:57:06,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136547988] [2019-11-26 02:57:06,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6df7957e-ecbd-4776-8ab1-db85d2d528ef/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-11-26 02:57:06,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:06,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-26 02:57:06,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:57:06,437 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-26 02:57:06,437 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:57:06,478 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-26 02:57:06,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-26 02:57:06,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 8 [2019-11-26 02:57:06,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362657971] [2019-11-26 02:57:06,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:57:06,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:06,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:57:06,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:57:06,481 INFO L87 Difference]: Start difference. First operand 1139 states and 1313 transitions. Second operand 4 states. [2019-11-26 02:57:06,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:06,855 INFO L93 Difference]: Finished difference Result 1210 states and 1386 transitions. [2019-11-26 02:57:06,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:57:06,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-11-26 02:57:06,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:06,856 INFO L225 Difference]: With dead ends: 1210 [2019-11-26 02:57:06,856 INFO L226 Difference]: Without dead ends: 0 [2019-11-26 02:57:06,857 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 326 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:57:06,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-26 02:57:06,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-26 02:57:06,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-26 02:57:06,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-26 02:57:06,858 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 164 [2019-11-26 02:57:06,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:06,858 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-26 02:57:06,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:57:06,858 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-26 02:57:06,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-26 02:57:07,059 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:57:07,062 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-26 02:57:07,361 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 30 [2019-11-26 02:57:07,490 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 30 [2019-11-26 02:57:07,493 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-26 02:57:07,493 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-26 02:57:07,493 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-26 02:57:07,494 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-26 02:57:07,494 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-26 02:57:07,494 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-26 02:57:07,494 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-26 02:57:07,494 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-26 02:57:07,494 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-26 02:57:07,494 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-26 02:57:07,494 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-26 02:57:07,494 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-26 02:57:07,495 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-26 02:57:07,495 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-26 02:57:07,496 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-26 02:57:07,496 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-26 02:57:07,496 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-26 02:57:07,497 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse3 (= ~a20~0 1)) (.cse0 (not (= 1 ~a7~0))) (.cse2 (= 13 ~a8~0)) (.cse4 (not (= ~a16~0 6))) (.cse1 (= ~a21~0 1))) (or (and (<= 15 ~a8~0) .cse0 .cse1) (and .cse2 .cse3) (and .cse1 .cse3) (and .cse4 .cse0 .cse1) (and .cse2 .cse4 (= ~a17~0 1) (= ~a12~0 8)) (and (< 13 ~a8~0) .cse4 .cse1))) [2019-11-26 02:57:07,497 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-26 02:57:07,497 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-26 02:57:07,498 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-26 02:57:07,498 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-26 02:57:07,498 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-26 02:57:07,498 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-26 02:57:07,498 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-26 02:57:07,499 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-26 02:57:07,500 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-26 02:57:07,500 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-26 02:57:07,500 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-26 02:57:07,500 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-26 02:57:07,500 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-26 02:57:07,500 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-26 02:57:07,501 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-26 02:57:07,501 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-26 02:57:07,501 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-26 02:57:07,501 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-26 02:57:07,501 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-26 02:57:07,501 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-26 02:57:07,502 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-26 02:57:07,502 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-26 02:57:07,502 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-26 02:57:07,502 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse3 (= ~a20~0 1)) (.cse0 (not (= 1 ~a7~0))) (.cse2 (= 13 ~a8~0)) (.cse4 (not (= ~a16~0 6))) (.cse1 (= ~a21~0 1))) (or (and (<= 15 ~a8~0) .cse0 .cse1) (and .cse2 .cse3) (and .cse1 .cse3) (and .cse4 .cse0 .cse1) (and .cse2 .cse4 (= ~a17~0 1) (= ~a12~0 8)) (and (< 13 ~a8~0) .cse4 .cse1))) [2019-11-26 02:57:07,502 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-26 02:57:07,503 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-26 02:57:07,503 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-26 02:57:07,503 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-26 02:57:07,503 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-26 02:57:07,504 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-26 02:57:07,504 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-26 02:57:07,504 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-26 02:57:07,505 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-26 02:57:07,505 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-26 02:57:07,505 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-26 02:57:07,505 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-26 02:57:07,505 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-26 02:57:07,505 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-26 02:57:07,506 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-26 02:57:07,506 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-26 02:57:07,506 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-26 02:57:07,506 INFO L444 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-26 02:57:07,506 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-26 02:57:07,506 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-26 02:57:07,507 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-26 02:57:07,507 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-26 02:57:07,507 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-26 02:57:07,507 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-26 02:57:07,507 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 530) no Hoare annotation was computed. [2019-11-26 02:57:07,507 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-26 02:57:07,508 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-26 02:57:07,508 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-26 02:57:07,508 INFO L444 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-26 02:57:07,508 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-26 02:57:07,508 INFO L444 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-26 02:57:07,508 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-26 02:57:07,509 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-26 02:57:07,509 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-26 02:57:07,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:57:07 BoogieIcfgContainer [2019-11-26 02:57:07,543 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:57:07,544 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:57:07,544 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:57:07,544 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:57:07,545 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:56:59" (3/4) ... [2019-11-26 02:57:07,548 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-26 02:57:07,576 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 99 nodes and edges [2019-11-26 02:57:07,578 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-11-26 02:57:07,579 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-11-26 02:57:07,581 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-26 02:57:07,782 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_6df7957e-ecbd-4776-8ab1-db85d2d528ef/bin/utaipan/witness.graphml [2019-11-26 02:57:07,782 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:57:07,783 INFO L168 Benchmark]: Toolchain (without parser) took 10280.26 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 281.0 MB). Free memory was 938.0 MB in the beginning and 1.3 GB in the end (delta: -320.0 MB). Peak memory consumption was 379.8 MB. Max. memory is 11.5 GB. [2019-11-26 02:57:07,784 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:57:07,784 INFO L168 Benchmark]: CACSL2BoogieTranslator took 650.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -178.1 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-26 02:57:07,784 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:57:07,785 INFO L168 Benchmark]: Boogie Preprocessor took 50.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:57:07,785 INFO L168 Benchmark]: RCFGBuilder took 1674.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 887.7 MB in the end (delta: 217.7 MB). Peak memory consumption was 217.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:57:07,786 INFO L168 Benchmark]: TraceAbstraction took 7582.11 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 143.1 MB). Free memory was 887.7 MB in the beginning and 845.7 MB in the end (delta: 42.0 MB). Peak memory consumption was 185.1 MB. Max. memory is 11.5 GB. [2019-11-26 02:57:07,786 INFO L168 Benchmark]: Witness Printer took 238.87 ms. Allocated memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: -1.0 MB). Free memory was 845.7 MB in the beginning and 1.3 GB in the end (delta: -412.3 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:57:07,788 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 650.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -178.1 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 79.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1674.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 887.7 MB in the end (delta: 217.7 MB). Peak memory consumption was 217.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7582.11 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 143.1 MB). Free memory was 887.7 MB in the beginning and 845.7 MB in the end (delta: 42.0 MB). Peak memory consumption was 185.1 MB. Max. memory is 11.5 GB. * Witness Printer took 238.87 ms. Allocated memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: -1.0 MB). Free memory was 845.7 MB in the beginning and 1.3 GB in the end (delta: -412.3 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 530]: 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: ((((((15 <= a8 && !(1 == a7)) && a21 == 1) || (13 == a8 && a20 == 1)) || (a21 == 1 && a20 == 1)) || ((!(a16 == 6) && !(1 == a7)) && a21 == 1)) || (((13 == a8 && !(a16 == 6)) && a17 == 1) && a12 == 8)) || ((13 < a8 && !(a16 == 6)) && a21 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((15 <= a8 && !(1 == a7)) && a21 == 1) || (13 == a8 && a20 == 1)) || (a21 == 1 && a20 == 1)) || ((!(a16 == 6) && !(1 == a7)) && a21 == 1)) || (((13 == a8 && !(a16 == 6)) && a17 == 1) && a12 == 8)) || ((13 < a8 && !(a16 == 6)) && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 7.4s, OverallIterations: 10, TraceHistogramMax: 5, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 430 SDtfs, 1358 SDslu, 82 SDs, 0 SdLazy, 3179 SolverSat, 833 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 370 GetRequests, 337 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1139occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 955 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 52 NumberOfFragments, 127 HoareAnnotationTreeSize, 3 FomulaSimplifications, 7568 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 360 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1248 NumberOfCodeBlocks, 1248 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1400 ConstructedInterpolants, 0 QuantifiedInterpolants, 400438 SizeOfPredicates, 1 NumberOfNonLiveVariables, 387 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 1008/1035 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...