./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label19.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_936f7ac1-f6fe-46bb-a5c7-6bd3dd290f64/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_936f7ac1-f6fe-46bb-a5c7-6bd3dd290f64/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_936f7ac1-f6fe-46bb-a5c7-6bd3dd290f64/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_936f7ac1-f6fe-46bb-a5c7-6bd3dd290f64/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label19.c -s /tmp/vcloud-vcloud-master/worker/run_dir_936f7ac1-f6fe-46bb-a5c7-6bd3dd290f64/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_936f7ac1-f6fe-46bb-a5c7-6bd3dd290f64/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 1dbe756481135ac1d54a76a4eed07fd2745a9deb ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:11:30,324 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:11:30,326 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:11:30,337 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:11:30,337 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:11:30,338 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:11:30,340 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:11:30,342 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:11:30,343 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:11:30,344 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:11:30,345 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:11:30,346 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:11:30,347 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:11:30,348 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:11:30,349 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:11:30,350 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:11:30,353 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:11:30,354 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:11:30,356 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:11:30,360 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:11:30,364 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:11:30,367 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:11:30,368 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:11:30,371 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:11:30,373 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:11:30,375 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:11:30,375 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:11:30,376 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:11:30,377 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:11:30,378 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:11:30,378 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:11:30,379 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:11:30,380 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:11:30,380 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:11:30,382 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:11:30,382 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:11:30,383 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:11:30,383 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:11:30,383 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:11:30,384 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:11:30,386 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:11:30,386 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_936f7ac1-f6fe-46bb-a5c7-6bd3dd290f64/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:11:30,404 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:11:30,404 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:11:30,405 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:11:30,405 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:11:30,406 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:11:30,406 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:11:30,406 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:11:30,406 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:11:30,406 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:11:30,407 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:11:30,408 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:11:30,408 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:11:30,408 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:11:30,408 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:11:30,409 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:11:30,409 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:11:30,409 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:11:30,410 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:11:30,410 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:11:30,410 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:11:30,410 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:11:30,410 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:11:30,411 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:11:30,411 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:11:30,411 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:11:30,411 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:11:30,412 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:11:30,412 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:11:30,412 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:11:30,412 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:11:30,412 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:11:30,413 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:11:30,413 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:11:30,413 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:11:30,413 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:11:30,414 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:11:30,414 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:11:30,414 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_936f7ac1-f6fe-46bb-a5c7-6bd3dd290f64/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 -> 1dbe756481135ac1d54a76a4eed07fd2745a9deb [2019-11-26 02:11:30,592 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:11:30,602 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:11:30,606 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:11:30,608 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:11:30,608 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:11:30,609 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_936f7ac1-f6fe-46bb-a5c7-6bd3dd290f64/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label19.c [2019-11-26 02:11:30,665 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_936f7ac1-f6fe-46bb-a5c7-6bd3dd290f64/bin/utaipan/data/759eca211/60a3692afe5b48e897fe30dbb80fee93/FLAGc1e5f1410 [2019-11-26 02:11:31,169 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:11:31,170 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_936f7ac1-f6fe-46bb-a5c7-6bd3dd290f64/sv-benchmarks/c/eca-rers2012/Problem01_label19.c [2019-11-26 02:11:31,182 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_936f7ac1-f6fe-46bb-a5c7-6bd3dd290f64/bin/utaipan/data/759eca211/60a3692afe5b48e897fe30dbb80fee93/FLAGc1e5f1410 [2019-11-26 02:11:31,486 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_936f7ac1-f6fe-46bb-a5c7-6bd3dd290f64/bin/utaipan/data/759eca211/60a3692afe5b48e897fe30dbb80fee93 [2019-11-26 02:11:31,489 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:11:31,490 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:11:31,491 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:11:31,491 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:11:31,499 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:11:31,500 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:11:31" (1/1) ... [2019-11-26 02:11:31,502 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43c40aec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:11:31, skipping insertion in model container [2019-11-26 02:11:31,502 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:11:31" (1/1) ... [2019-11-26 02:11:31,509 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:11:31,555 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:11:31,961 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:11:31,965 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:11:32,107 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:11:32,122 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:11:32,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:11:32 WrapperNode [2019-11-26 02:11:32,122 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:11:32,123 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:11:32,123 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:11:32,123 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:11:32,129 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:11:32" (1/1) ... [2019-11-26 02:11:32,145 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:11:32" (1/1) ... [2019-11-26 02:11:32,199 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:11:32,200 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:11:32,200 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:11:32,200 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:11:32,210 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:11:32" (1/1) ... [2019-11-26 02:11:32,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:11:32" (1/1) ... [2019-11-26 02:11:32,214 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:11:32" (1/1) ... [2019-11-26 02:11:32,218 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:11:32" (1/1) ... [2019-11-26 02:11:32,253 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:11:32" (1/1) ... [2019-11-26 02:11:32,266 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:11:32" (1/1) ... [2019-11-26 02:11:32,285 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:11:32" (1/1) ... [2019-11-26 02:11:32,292 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:11:32,293 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:11:32,293 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:11:32,293 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:11:32,294 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:11:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_936f7ac1-f6fe-46bb-a5c7-6bd3dd290f64/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:11:32,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:11:32,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:11:34,220 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:11:34,221 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-26 02:11:34,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:11:34 BoogieIcfgContainer [2019-11-26 02:11:34,225 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:11:34,226 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:11:34,226 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:11:34,228 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:11:34,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:11:31" (1/3) ... [2019-11-26 02:11:34,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4da875ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:11:34, skipping insertion in model container [2019-11-26 02:11:34,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:11:32" (2/3) ... [2019-11-26 02:11:34,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4da875ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:11:34, skipping insertion in model container [2019-11-26 02:11:34,231 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:11:34" (3/3) ... [2019-11-26 02:11:34,233 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label19.c [2019-11-26 02:11:34,241 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:11:34,247 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-26 02:11:34,257 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-26 02:11:34,291 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:11:34,292 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:11:34,292 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:11:34,292 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:11:34,292 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:11:34,292 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:11:34,292 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:11:34,292 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:11:34,306 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-26 02:11:34,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-26 02:11:34,313 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:11:34,314 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:11:34,314 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:11:34,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:11:34,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1323246111, now seen corresponding path program 1 times [2019-11-26 02:11:34,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:11:34,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264885460] [2019-11-26 02:11:34,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:11:34,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:11:34,619 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:11:34,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264885460] [2019-11-26 02:11:34,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:11:34,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:11:34,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357716063] [2019-11-26 02:11:34,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:11:34,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:11:34,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:11:34,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:11:34,641 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-11-26 02:11:35,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:11:35,490 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-11-26 02:11:35,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:11:35,492 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-26 02:11:35,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:11:35,510 INFO L225 Difference]: With dead ends: 297 [2019-11-26 02:11:35,511 INFO L226 Difference]: Without dead ends: 216 [2019-11-26 02:11:35,514 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:11:35,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-26 02:11:35,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-11-26 02:11:35,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-26 02:11:35,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 378 transitions. [2019-11-26 02:11:35,591 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 378 transitions. Word has length 71 [2019-11-26 02:11:35,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:11:35,592 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 378 transitions. [2019-11-26 02:11:35,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:11:35,593 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 378 transitions. [2019-11-26 02:11:35,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-26 02:11:35,603 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:11:35,603 INFO L410 BasicCegarLoop]: trace histogram [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, 1] [2019-11-26 02:11:35,603 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:11:35,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:11:35,604 INFO L82 PathProgramCache]: Analyzing trace with hash 585771609, now seen corresponding path program 1 times [2019-11-26 02:11:35,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:11:35,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786374544] [2019-11-26 02:11:35,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:11:35,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:11:35,690 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:11:35,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786374544] [2019-11-26 02:11:35,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:11:35,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:11:35,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595367935] [2019-11-26 02:11:35,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:11:35,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:11:35,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:11:35,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:11:35,698 INFO L87 Difference]: Start difference. First operand 216 states and 378 transitions. Second operand 4 states. [2019-11-26 02:11:36,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:11:36,158 INFO L93 Difference]: Finished difference Result 644 states and 1131 transitions. [2019-11-26 02:11:36,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:11:36,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-26 02:11:36,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:11:36,162 INFO L225 Difference]: With dead ends: 644 [2019-11-26 02:11:36,162 INFO L226 Difference]: Without dead ends: 429 [2019-11-26 02:11:36,164 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:11:36,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-26 02:11:36,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-11-26 02:11:36,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-26 02:11:36,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 705 transitions. [2019-11-26 02:11:36,199 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 705 transitions. Word has length 76 [2019-11-26 02:11:36,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:11:36,199 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 705 transitions. [2019-11-26 02:11:36,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:11:36,200 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 705 transitions. [2019-11-26 02:11:36,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-26 02:11:36,203 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:11:36,204 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:11:36,204 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:11:36,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:11:36,205 INFO L82 PathProgramCache]: Analyzing trace with hash 928578915, now seen corresponding path program 1 times [2019-11-26 02:11:36,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:11:36,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605718946] [2019-11-26 02:11:36,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:11:36,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:11:36,298 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-26 02:11:36,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605718946] [2019-11-26 02:11:36,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:11:36,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:11:36,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585879809] [2019-11-26 02:11:36,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:11:36,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:11:36,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:11:36,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:11:36,301 INFO L87 Difference]: Start difference. First operand 429 states and 705 transitions. Second operand 3 states. [2019-11-26 02:11:36,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:11:36,649 INFO L93 Difference]: Finished difference Result 1070 states and 1785 transitions. [2019-11-26 02:11:36,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:11:36,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-26 02:11:36,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:11:36,653 INFO L225 Difference]: With dead ends: 1070 [2019-11-26 02:11:36,653 INFO L226 Difference]: Without dead ends: 642 [2019-11-26 02:11:36,655 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:11:36,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-11-26 02:11:36,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 500. [2019-11-26 02:11:36,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-11-26 02:11:36,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 825 transitions. [2019-11-26 02:11:36,682 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 825 transitions. Word has length 97 [2019-11-26 02:11:36,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:11:36,682 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 825 transitions. [2019-11-26 02:11:36,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:11:36,682 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 825 transitions. [2019-11-26 02:11:36,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-26 02:11:36,684 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:11:36,684 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-26 02:11:36,685 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:11:36,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:11:36,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1330805370, now seen corresponding path program 1 times [2019-11-26 02:11:36,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:11:36,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445729147] [2019-11-26 02:11:36,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:11:36,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:11:36,760 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-26 02:11:36,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445729147] [2019-11-26 02:11:36,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:11:36,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:11:36,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802844894] [2019-11-26 02:11:36,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:11:36,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:11:36,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:11:36,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:11:36,763 INFO L87 Difference]: Start difference. First operand 500 states and 825 transitions. Second operand 3 states. [2019-11-26 02:11:37,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:11:37,091 INFO L93 Difference]: Finished difference Result 1212 states and 1976 transitions. [2019-11-26 02:11:37,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:11:37,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-11-26 02:11:37,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:11:37,096 INFO L225 Difference]: With dead ends: 1212 [2019-11-26 02:11:37,097 INFO L226 Difference]: Without dead ends: 713 [2019-11-26 02:11:37,098 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:11:37,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2019-11-26 02:11:37,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 571. [2019-11-26 02:11:37,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-11-26 02:11:37,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 877 transitions. [2019-11-26 02:11:37,114 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 877 transitions. Word has length 133 [2019-11-26 02:11:37,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:11:37,115 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 877 transitions. [2019-11-26 02:11:37,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:11:37,115 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 877 transitions. [2019-11-26 02:11:37,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-26 02:11:37,117 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:11:37,118 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:11:37,118 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:11:37,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:11:37,118 INFO L82 PathProgramCache]: Analyzing trace with hash -211736042, now seen corresponding path program 1 times [2019-11-26 02:11:37,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:11:37,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919051818] [2019-11-26 02:11:37,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:11:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:11:37,191 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-11-26 02:11:37,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919051818] [2019-11-26 02:11:37,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:11:37,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:11:37,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572031607] [2019-11-26 02:11:37,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:11:37,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:11:37,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:11:37,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:11:37,194 INFO L87 Difference]: Start difference. First operand 571 states and 877 transitions. Second operand 3 states. [2019-11-26 02:11:37,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:11:37,615 INFO L93 Difference]: Finished difference Result 1567 states and 2383 transitions. [2019-11-26 02:11:37,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:11:37,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-11-26 02:11:37,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:11:37,622 INFO L225 Difference]: With dead ends: 1567 [2019-11-26 02:11:37,622 INFO L226 Difference]: Without dead ends: 997 [2019-11-26 02:11:37,623 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:11:37,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-11-26 02:11:37,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 855. [2019-11-26 02:11:37,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 855 states. [2019-11-26 02:11:37,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1269 transitions. [2019-11-26 02:11:37,649 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1269 transitions. Word has length 152 [2019-11-26 02:11:37,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:11:37,649 INFO L462 AbstractCegarLoop]: Abstraction has 855 states and 1269 transitions. [2019-11-26 02:11:37,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:11:37,650 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1269 transitions. [2019-11-26 02:11:37,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-26 02:11:37,652 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:11:37,679 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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:11:37,679 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:11:37,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:11:37,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1004824157, now seen corresponding path program 1 times [2019-11-26 02:11:37,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:11:37,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074244367] [2019-11-26 02:11:37,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:11:37,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:11:37,776 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-26 02:11:37,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074244367] [2019-11-26 02:11:37,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:11:37,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:11:37,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880566397] [2019-11-26 02:11:37,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:11:37,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:11:37,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:11:37,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:11:37,779 INFO L87 Difference]: Start difference. First operand 855 states and 1269 transitions. Second operand 3 states. [2019-11-26 02:11:38,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:11:38,127 INFO L93 Difference]: Finished difference Result 1851 states and 2733 transitions. [2019-11-26 02:11:38,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:11:38,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-11-26 02:11:38,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:11:38,133 INFO L225 Difference]: With dead ends: 1851 [2019-11-26 02:11:38,133 INFO L226 Difference]: Without dead ends: 997 [2019-11-26 02:11:38,134 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:11:38,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-11-26 02:11:38,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 997. [2019-11-26 02:11:38,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-26 02:11:38,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1429 transitions. [2019-11-26 02:11:38,162 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1429 transitions. Word has length 155 [2019-11-26 02:11:38,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:11:38,164 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1429 transitions. [2019-11-26 02:11:38,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:11:38,165 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1429 transitions. [2019-11-26 02:11:38,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-26 02:11:38,167 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:11:38,168 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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-11-26 02:11:38,168 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:11:38,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:11:38,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1683955563, now seen corresponding path program 1 times [2019-11-26 02:11:38,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:11:38,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12705201] [2019-11-26 02:11:38,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:11:38,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:11:38,384 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-26 02:11:38,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12705201] [2019-11-26 02:11:38,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:11:38,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-26 02:11:38,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852741067] [2019-11-26 02:11:38,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 02:11:38,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:11:38,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 02:11:38,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:11:38,386 INFO L87 Difference]: Start difference. First operand 997 states and 1429 transitions. Second operand 8 states. [2019-11-26 02:11:39,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:11:39,131 INFO L93 Difference]: Finished difference Result 2100 states and 2970 transitions. [2019-11-26 02:11:39,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 02:11:39,131 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 159 [2019-11-26 02:11:39,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:11:39,139 INFO L225 Difference]: With dead ends: 2100 [2019-11-26 02:11:39,139 INFO L226 Difference]: Without dead ends: 1104 [2019-11-26 02:11:39,141 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-11-26 02:11:39,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2019-11-26 02:11:39,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 997. [2019-11-26 02:11:39,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-26 02:11:39,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1417 transitions. [2019-11-26 02:11:39,173 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1417 transitions. Word has length 159 [2019-11-26 02:11:39,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:11:39,173 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1417 transitions. [2019-11-26 02:11:39,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 02:11:39,174 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1417 transitions. [2019-11-26 02:11:39,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-26 02:11:39,177 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:11:39,177 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1] [2019-11-26 02:11:39,177 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:11:39,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:11:39,178 INFO L82 PathProgramCache]: Analyzing trace with hash -114234747, now seen corresponding path program 1 times [2019-11-26 02:11:39,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:11:39,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406964125] [2019-11-26 02:11:39,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:11:39,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:11:39,299 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-11-26 02:11:39,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406964125] [2019-11-26 02:11:39,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:11:39,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:11:39,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828396075] [2019-11-26 02:11:39,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:11:39,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:11:39,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:11:39,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:11:39,302 INFO L87 Difference]: Start difference. First operand 997 states and 1417 transitions. Second operand 4 states. [2019-11-26 02:11:39,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:11:39,821 INFO L93 Difference]: Finished difference Result 2135 states and 3035 transitions. [2019-11-26 02:11:39,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:11:39,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-11-26 02:11:39,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:11:39,827 INFO L225 Difference]: With dead ends: 2135 [2019-11-26 02:11:39,828 INFO L226 Difference]: Without dead ends: 1139 [2019-11-26 02:11:39,829 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 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:11:39,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2019-11-26 02:11:39,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1068. [2019-11-26 02:11:39,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2019-11-26 02:11:39,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1422 transitions. [2019-11-26 02:11:39,856 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1422 transitions. Word has length 192 [2019-11-26 02:11:39,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:11:39,857 INFO L462 AbstractCegarLoop]: Abstraction has 1068 states and 1422 transitions. [2019-11-26 02:11:39,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:11:39,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1422 transitions. [2019-11-26 02:11:39,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-11-26 02:11:39,861 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:11:39,861 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:39,862 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:11:39,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:11:39,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1171740985, now seen corresponding path program 1 times [2019-11-26 02:11:39,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:11:39,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617453109] [2019-11-26 02:11:39,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:11:39,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:11:40,041 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-26 02:11:40,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617453109] [2019-11-26 02:11:40,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:11:40,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:11:40,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836418669] [2019-11-26 02:11:40,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:11:40,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:11:40,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:11:40,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:11:40,044 INFO L87 Difference]: Start difference. First operand 1068 states and 1422 transitions. Second operand 4 states. [2019-11-26 02:11:40,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:11:40,383 INFO L93 Difference]: Finished difference Result 2419 states and 3181 transitions. [2019-11-26 02:11:40,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:11:40,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 218 [2019-11-26 02:11:40,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:11:40,389 INFO L225 Difference]: With dead ends: 2419 [2019-11-26 02:11:40,389 INFO L226 Difference]: Without dead ends: 1352 [2019-11-26 02:11:40,391 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-11-26 02:11:40,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2019-11-26 02:11:40,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1068. [2019-11-26 02:11:40,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2019-11-26 02:11:40,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1410 transitions. [2019-11-26 02:11:40,413 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1410 transitions. Word has length 218 [2019-11-26 02:11:40,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:11:40,414 INFO L462 AbstractCegarLoop]: Abstraction has 1068 states and 1410 transitions. [2019-11-26 02:11:40,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:11:40,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1410 transitions. [2019-11-26 02:11:40,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-11-26 02:11:40,418 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:11:40,418 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:11:40,418 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:11:40,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:11:40,419 INFO L82 PathProgramCache]: Analyzing trace with hash 39380996, now seen corresponding path program 1 times [2019-11-26 02:11:40,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:11:40,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75435278] [2019-11-26 02:11:40,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:11:40,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:11:40,585 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-11-26 02:11:40,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75435278] [2019-11-26 02:11:40,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:11:40,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:11:40,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27673144] [2019-11-26 02:11:40,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:11:40,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:11:40,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:11:40,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:11:40,587 INFO L87 Difference]: Start difference. First operand 1068 states and 1410 transitions. Second operand 6 states. [2019-11-26 02:11:41,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:11:41,076 INFO L93 Difference]: Finished difference Result 2244 states and 2934 transitions. [2019-11-26 02:11:41,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:11:41,077 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 239 [2019-11-26 02:11:41,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:11:41,082 INFO L225 Difference]: With dead ends: 2244 [2019-11-26 02:11:41,082 INFO L226 Difference]: Without dead ends: 1177 [2019-11-26 02:11:41,086 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-11-26 02:11:41,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2019-11-26 02:11:41,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 997. [2019-11-26 02:11:41,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-26 02:11:41,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1261 transitions. [2019-11-26 02:11:41,110 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1261 transitions. Word has length 239 [2019-11-26 02:11:41,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:11:41,110 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1261 transitions. [2019-11-26 02:11:41,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:11:41,110 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1261 transitions. [2019-11-26 02:11:41,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-11-26 02:11:41,116 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:11:41,117 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2019-11-26 02:11:41,117 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:11:41,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:11:41,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1839440475, now seen corresponding path program 1 times [2019-11-26 02:11:41,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:11:41,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954925230] [2019-11-26 02:11:41,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:11:41,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:11:42,085 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-11-26 02:11:42,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954925230] [2019-11-26 02:11:42,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:11:42,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-26 02:11:42,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442260088] [2019-11-26 02:11:42,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-26 02:11:42,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:11:42,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-26 02:11:42,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2019-11-26 02:11:42,087 INFO L87 Difference]: Start difference. First operand 997 states and 1261 transitions. Second operand 14 states. [2019-11-26 02:11:43,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:11:43,255 INFO L93 Difference]: Finished difference Result 2252 states and 2825 transitions. [2019-11-26 02:11:43,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-26 02:11:43,256 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 261 [2019-11-26 02:11:43,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:11:43,257 INFO L225 Difference]: With dead ends: 2252 [2019-11-26 02:11:43,257 INFO L226 Difference]: Without dead ends: 0 [2019-11-26 02:11:43,259 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=150, Invalid=192, Unknown=0, NotChecked=0, Total=342 [2019-11-26 02:11:43,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-26 02:11:43,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-26 02:11:43,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-26 02:11:43,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-26 02:11:43,260 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 261 [2019-11-26 02:11:43,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:11:43,260 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-26 02:11:43,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-26 02:11:43,260 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-26 02:11:43,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-26 02:11:43,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-26 02:11:43,373 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 108 [2019-11-26 02:11:44,126 WARN L192 SmtUtils]: Spent 654.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 54 [2019-11-26 02:11:44,556 WARN L192 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 54 [2019-11-26 02:11:44,559 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-26 02:11:44,559 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-26 02:11:44,559 INFO L444 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-26 02:11:44,559 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-26 02:11:44,559 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-26 02:11:44,559 INFO L444 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-26 02:11:44,559 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-26 02:11:44,560 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-26 02:11:44,560 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-26 02:11:44,560 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-26 02:11:44,560 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-26 02:11:44,560 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-26 02:11:44,560 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-26 02:11:44,560 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-26 02:11:44,560 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-26 02:11:44,560 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-26 02:11:44,560 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-26 02:11:44,560 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-26 02:11:44,561 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-26 02:11:44,561 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse6 (= 1 ~a7~0)) (.cse4 (= ~a16~0 6)) (.cse1 (= ~a21~0 1))) (let ((.cse5 (not .cse1)) (.cse7 (= 13 ~a8~0)) (.cse10 (<= ~a17~0 0)) (.cse11 (= ~a16~0 4)) (.cse8 (not .cse4)) (.cse9 (= ~a17~0 1)) (.cse3 (= ~a20~0 1)) (.cse2 (not .cse6)) (.cse0 (= ~a12~0 8))) (or (and .cse0 .cse1 (= ~a16~0 5)) (and .cse2 .cse0 .cse1 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse0) (and .cse5 .cse6 .cse7 .cse0 .cse10 .cse3 (or (= 2 ULTIMATE.start_calculate_output_~input) (= 4 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)) .cse4) (and .cse6 .cse7 .cse11 .cse0 .cse10) (and .cse11 .cse0 .cse1 (not .cse9)) (and .cse8 .cse2 .cse9 .cse0 .cse1) (and .cse9 .cse0 .cse1 .cse3) (and .cse2 .cse0 .cse1 (= 15 ~a8~0) .cse4)))) [2019-11-26 02:11:44,561 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-26 02:11:44,561 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-26 02:11:44,561 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-26 02:11:44,561 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-26 02:11:44,562 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-26 02:11:44,562 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-26 02:11:44,562 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-26 02:11:44,562 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-26 02:11:44,562 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-26 02:11:44,562 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-26 02:11:44,562 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-26 02:11:44,562 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-26 02:11:44,562 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-26 02:11:44,562 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-26 02:11:44,562 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-26 02:11:44,563 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-26 02:11:44,563 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-26 02:11:44,563 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-26 02:11:44,563 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-26 02:11:44,563 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-26 02:11:44,563 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-26 02:11:44,563 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-26 02:11:44,563 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-26 02:11:44,564 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse3 (= 1 ~a7~0)) (.cse9 (= ~a16~0 6)) (.cse1 (= ~a21~0 1))) (let ((.cse2 (not .cse1)) (.cse7 (= ~a20~0 1)) (.cse4 (= 13 ~a8~0)) (.cse10 (<= ~a17~0 0)) (.cse11 (= ~a16~0 4)) (.cse5 (not .cse9)) (.cse6 (= ~a17~0 1)) (.cse8 (not .cse3)) (.cse0 (= ~a12~0 8))) (or (and .cse0 .cse1 (= ~a16~0 5)) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse0) (and .cse0 (or (and .cse6 .cse1 .cse7) (and .cse8 .cse1 .cse7 .cse9))) (and .cse2 .cse3 .cse4 .cse0 .cse10 .cse7 (or (= 2 ULTIMATE.start_calculate_output_~input) (= 4 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)) .cse9) (and .cse3 .cse4 .cse11 .cse0 .cse10) (and .cse11 .cse0 .cse1 (not .cse6)) (and .cse5 .cse8 .cse6 .cse0 .cse1) (and .cse8 .cse0 .cse1 (= 15 ~a8~0) .cse9)))) [2019-11-26 02:11:44,564 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-26 02:11:44,564 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-26 02:11:44,564 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-26 02:11:44,564 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-26 02:11:44,564 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-26 02:11:44,564 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-26 02:11:44,564 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-26 02:11:44,564 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-26 02:11:44,564 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-26 02:11:44,564 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-26 02:11:44,565 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-26 02:11:44,565 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-26 02:11:44,565 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-26 02:11:44,565 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-26 02:11:44,565 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-26 02:11:44,565 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-26 02:11:44,565 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-26 02:11:44,565 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-26 02:11:44,565 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-26 02:11:44,565 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-26 02:11:44,565 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-26 02:11:44,566 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-26 02:11:44,566 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-26 02:11:44,566 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 434) no Hoare annotation was computed. [2019-11-26 02:11:44,566 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-26 02:11:44,566 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-26 02:11:44,566 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-26 02:11:44,566 INFO L444 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-26 02:11:44,566 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-26 02:11:44,566 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-26 02:11:44,566 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-26 02:11:44,567 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-26 02:11:44,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:11:44 BoogieIcfgContainer [2019-11-26 02:11:44,610 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:11:44,610 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:11:44,610 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:11:44,611 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:11:44,611 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:11:34" (3/4) ... [2019-11-26 02:11:44,614 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-26 02:11:44,647 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 99 nodes and edges [2019-11-26 02:11:44,649 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2019-11-26 02:11:44,651 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2019-11-26 02:11:44,652 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-26 02:11:44,820 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_936f7ac1-f6fe-46bb-a5c7-6bd3dd290f64/bin/utaipan/witness.graphml [2019-11-26 02:11:44,821 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:11:44,822 INFO L168 Benchmark]: Toolchain (without parser) took 13331.77 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 426.2 MB). Free memory was 943.4 MB in the beginning and 1.4 GB in the end (delta: -433.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:11:44,822 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:11:44,823 INFO L168 Benchmark]: CACSL2BoogieTranslator took 631.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -152.2 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-26 02:11:44,823 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.81 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:11:44,823 INFO L168 Benchmark]: Boogie Preprocessor took 92.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-26 02:11:44,823 INFO L168 Benchmark]: RCFGBuilder took 1931.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 874.3 MB in the end (delta: 214.4 MB). Peak memory consumption was 214.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:11:44,824 INFO L168 Benchmark]: TraceAbstraction took 10384.49 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 299.4 MB). Free memory was 874.3 MB in the beginning and 1.4 GB in the end (delta: -519.2 MB). Peak memory consumption was 387.1 MB. Max. memory is 11.5 GB. [2019-11-26 02:11:44,824 INFO L168 Benchmark]: Witness Printer took 210.30 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. [2019-11-26 02:11:44,826 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 631.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -152.2 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 76.81 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 92.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1931.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 874.3 MB in the end (delta: 214.4 MB). Peak memory consumption was 214.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10384.49 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 299.4 MB). Free memory was 874.3 MB in the beginning and 1.4 GB in the end (delta: -519.2 MB). Peak memory consumption was 387.1 MB. Max. memory is 11.5 GB. * Witness Printer took 210.30 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 434]: 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: (((((((((a12 == 8 && a21 == 1) && a16 == 5) || ((((!(1 == a7) && a12 == 8) && a21 == 1) && a20 == 1) && a16 == 6)) || (((((!(a21 == 1) && 1 == a7) && 13 == a8) && !(a16 == 6)) && a17 == 1) && a12 == 8)) || (((((((!(a21 == 1) && 1 == a7) && 13 == a8) && a12 == 8) && a17 <= 0) && a20 == 1) && ((((2 == input || 4 == input) || 6 == input) || 1 == input) || 5 == input)) && a16 == 6)) || ((((1 == a7 && 13 == a8) && a16 == 4) && a12 == 8) && a17 <= 0)) || (((a16 == 4 && a12 == 8) && a21 == 1) && !(a17 == 1))) || ((((!(a16 == 6) && !(1 == a7)) && a17 == 1) && a12 == 8) && a21 == 1)) || (((a17 == 1 && a12 == 8) && a21 == 1) && a20 == 1)) || ((((!(1 == a7) && a12 == 8) && a21 == 1) && 15 == a8) && a16 == 6) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((a12 == 8 && a21 == 1) && a16 == 5) || (((((!(a21 == 1) && 1 == a7) && 13 == a8) && !(a16 == 6)) && a17 == 1) && a12 == 8)) || (a12 == 8 && (((a17 == 1 && a21 == 1) && a20 == 1) || (((!(1 == a7) && a21 == 1) && a20 == 1) && a16 == 6)))) || (((((((!(a21 == 1) && 1 == a7) && 13 == a8) && a12 == 8) && a17 <= 0) && a20 == 1) && ((((2 == input || 4 == input) || 6 == input) || 1 == input) || 5 == input)) && a16 == 6)) || ((((1 == a7 && 13 == a8) && a16 == 4) && a12 == 8) && a17 <= 0)) || (((a16 == 4 && a12 == 8) && a21 == 1) && !(a17 == 1))) || ((((!(a16 == 6) && !(1 == a7)) && a17 == 1) && a12 == 8) && a21 == 1)) || ((((!(1 == a7) && a12 == 8) && a21 == 1) && 15 == a8) && a16 == 6) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 10.2s, OverallIterations: 11, TraceHistogramMax: 7, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.2s, HoareTripleCheckerStatistics: 598 SDtfs, 1439 SDslu, 102 SDs, 0 SdLazy, 4267 SolverSat, 989 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1068occurred 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.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 1068 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 42 NumberOfFragments, 332 HoareAnnotationTreeSize, 3 FomulaSimplifications, 16580 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 3519 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1753 NumberOfCodeBlocks, 1753 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1742 ConstructedInterpolants, 0 QuantifiedInterpolants, 1294486 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 2252/2252 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...