./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label06.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_4b1048f9-ff3c-40f2-8056-d4c76a8d8022/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4b1048f9-ff3c-40f2-8056-d4c76a8d8022/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4b1048f9-ff3c-40f2-8056-d4c76a8d8022/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4b1048f9-ff3c-40f2-8056-d4c76a8d8022/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label06.c -s /tmp/vcloud-vcloud-master/worker/run_dir_4b1048f9-ff3c-40f2-8056-d4c76a8d8022/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4b1048f9-ff3c-40f2-8056-d4c76a8d8022/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 4efbed7cd0f5d77b92597ff02e6d19fa8a62de34 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 10:35:25,321 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:35:25,322 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:35:25,330 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:35:25,330 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:35:25,331 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:35:25,332 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:35:25,333 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:35:25,334 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:35:25,335 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:35:25,336 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:35:25,337 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:35:25,337 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:35:25,338 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:35:25,338 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:35:25,339 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:35:25,340 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:35:25,340 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:35:25,342 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:35:25,343 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:35:25,344 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:35:25,345 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:35:25,345 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:35:25,346 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:35:25,348 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:35:25,348 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:35:25,348 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:35:25,348 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:35:25,349 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:35:25,349 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:35:25,349 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:35:25,350 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:35:25,350 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:35:25,351 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:35:25,351 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:35:25,351 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:35:25,352 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:35:25,352 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:35:25,352 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:35:25,353 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:35:25,353 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:35:25,353 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4b1048f9-ff3c-40f2-8056-d4c76a8d8022/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 10:35:25,363 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:35:25,363 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:35:25,364 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 10:35:25,364 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 10:35:25,364 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 10:35:25,364 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 10:35:25,364 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 10:35:25,364 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 10:35:25,364 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 10:35:25,365 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 10:35:25,365 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 10:35:25,365 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 10:35:25,365 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 10:35:25,365 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 10:35:25,365 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 10:35:25,366 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:35:25,366 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:35:25,366 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:35:25,366 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:35:25,366 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:35:25,366 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:35:25,367 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:35:25,367 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:35:25,367 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 10:35:25,367 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:35:25,367 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:35:25,367 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:35:25,367 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:35:25,368 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:35:25,368 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:35:25,368 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:35:25,368 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:35:25,368 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:35:25,368 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:35:25,369 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:35:25,369 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 10:35:25,369 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:35:25,369 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:35:25,369 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:35:25,369 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 10:35:25,370 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_4b1048f9-ff3c-40f2-8056-d4c76a8d8022/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 -> 4efbed7cd0f5d77b92597ff02e6d19fa8a62de34 [2019-12-07 10:35:25,472 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:35:25,480 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:35:25,482 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:35:25,483 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:35:25,483 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:35:25,484 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4b1048f9-ff3c-40f2-8056-d4c76a8d8022/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem02_label06.c [2019-12-07 10:35:25,522 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4b1048f9-ff3c-40f2-8056-d4c76a8d8022/bin/utaipan/data/daf0c2d7f/a84433129a8a4e4d95ee6279af489ce3/FLAG5f072bb13 [2019-12-07 10:35:25,941 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:35:25,941 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4b1048f9-ff3c-40f2-8056-d4c76a8d8022/sv-benchmarks/c/eca-rers2012/Problem02_label06.c [2019-12-07 10:35:25,949 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4b1048f9-ff3c-40f2-8056-d4c76a8d8022/bin/utaipan/data/daf0c2d7f/a84433129a8a4e4d95ee6279af489ce3/FLAG5f072bb13 [2019-12-07 10:35:26,277 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4b1048f9-ff3c-40f2-8056-d4c76a8d8022/bin/utaipan/data/daf0c2d7f/a84433129a8a4e4d95ee6279af489ce3 [2019-12-07 10:35:26,282 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:35:26,285 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:35:26,287 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:35:26,287 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:35:26,294 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:35:26,295 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:35:26" (1/1) ... [2019-12-07 10:35:26,300 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@617374ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:35:26, skipping insertion in model container [2019-12-07 10:35:26,301 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:35:26" (1/1) ... [2019-12-07 10:35:26,305 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:35:26,335 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:35:26,572 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:35:26,575 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:35:26,625 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:35:26,635 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:35:26,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:35:26 WrapperNode [2019-12-07 10:35:26,636 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:35:26,636 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:35:26,636 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:35:26,637 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:35:26,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:35:26" (1/1) ... [2019-12-07 10:35:26,655 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:35:26" (1/1) ... [2019-12-07 10:35:26,687 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:35:26,687 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:35:26,687 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:35:26,688 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:35:26,694 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:35:26" (1/1) ... [2019-12-07 10:35:26,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:35:26" (1/1) ... [2019-12-07 10:35:26,697 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:35:26" (1/1) ... [2019-12-07 10:35:26,697 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:35:26" (1/1) ... [2019-12-07 10:35:26,710 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:35:26" (1/1) ... [2019-12-07 10:35:26,717 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:35:26" (1/1) ... [2019-12-07 10:35:26,721 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:35:26" (1/1) ... [2019-12-07 10:35:26,726 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:35:26,726 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:35:26,726 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:35:26,726 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:35:26,727 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:35:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4b1048f9-ff3c-40f2-8056-d4c76a8d8022/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:35:26,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:35:26,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:35:27,925 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:35:27,925 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 10:35:27,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:35:27 BoogieIcfgContainer [2019-12-07 10:35:27,926 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:35:27,927 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:35:27,927 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:35:27,929 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:35:27,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:35:26" (1/3) ... [2019-12-07 10:35:27,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@226c0f8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:35:27, skipping insertion in model container [2019-12-07 10:35:27,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:35:26" (2/3) ... [2019-12-07 10:35:27,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@226c0f8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:35:27, skipping insertion in model container [2019-12-07 10:35:27,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:35:27" (3/3) ... [2019-12-07 10:35:27,931 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label06.c [2019-12-07 10:35:27,938 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:35:27,943 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 10:35:27,950 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 10:35:27,967 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:35:27,967 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:35:27,967 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:35:27,967 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:35:27,968 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:35:27,968 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:35:27,968 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:35:27,968 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:35:27,980 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2019-12-07 10:35:27,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-07 10:35:27,986 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:27,987 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:35:27,987 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:35:27,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:27,991 INFO L82 PathProgramCache]: Analyzing trace with hash 925963535, now seen corresponding path program 1 times [2019-12-07 10:35:27,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:35:27,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493442948] [2019-12-07 10:35:27,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:28,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:35:28,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493442948] [2019-12-07 10:35:28,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:28,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:35:28,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243865230] [2019-12-07 10:35:28,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:35:28,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:35:28,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:35:28,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:35:28,236 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 4 states. [2019-12-07 10:35:28,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:28,710 INFO L93 Difference]: Finished difference Result 333 states and 641 transitions. [2019-12-07 10:35:28,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:35:28,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-12-07 10:35:28,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:28,724 INFO L225 Difference]: With dead ends: 333 [2019-12-07 10:35:28,725 INFO L226 Difference]: Without dead ends: 243 [2019-12-07 10:35:28,727 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:35:28,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-12-07 10:35:28,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2019-12-07 10:35:28,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-12-07 10:35:28,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 398 transitions. [2019-12-07 10:35:28,767 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 398 transitions. Word has length 80 [2019-12-07 10:35:28,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:28,767 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 398 transitions. [2019-12-07 10:35:28,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:35:28,767 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 398 transitions. [2019-12-07 10:35:28,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 10:35:28,770 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:28,771 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:35:28,771 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:35:28,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:28,771 INFO L82 PathProgramCache]: Analyzing trace with hash -859408152, now seen corresponding path program 1 times [2019-12-07 10:35:28,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:35:28,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942536116] [2019-12-07 10:35:28,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:28,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:28,838 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:35:28,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942536116] [2019-12-07 10:35:28,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:28,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:35:28,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463491103] [2019-12-07 10:35:28,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:35:28,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:35:28,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:35:28,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:35:28,841 INFO L87 Difference]: Start difference. First operand 243 states and 398 transitions. Second operand 3 states. [2019-12-07 10:35:29,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:29,070 INFO L93 Difference]: Finished difference Result 725 states and 1191 transitions. [2019-12-07 10:35:29,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:35:29,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-12-07 10:35:29,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:29,073 INFO L225 Difference]: With dead ends: 725 [2019-12-07 10:35:29,073 INFO L226 Difference]: Without dead ends: 483 [2019-12-07 10:35:29,075 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:35:29,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-12-07 10:35:29,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483. [2019-12-07 10:35:29,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-12-07 10:35:29,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 758 transitions. [2019-12-07 10:35:29,098 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 758 transitions. Word has length 85 [2019-12-07 10:35:29,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:29,098 INFO L462 AbstractCegarLoop]: Abstraction has 483 states and 758 transitions. [2019-12-07 10:35:29,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:35:29,098 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 758 transitions. [2019-12-07 10:35:29,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-07 10:35:29,102 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:29,102 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:35:29,102 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:35:29,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:29,102 INFO L82 PathProgramCache]: Analyzing trace with hash -2134419129, now seen corresponding path program 1 times [2019-12-07 10:35:29,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:35:29,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149556213] [2019-12-07 10:35:29,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:29,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:29,139 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:35:29,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149556213] [2019-12-07 10:35:29,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:29,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:35:29,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783706205] [2019-12-07 10:35:29,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:35:29,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:35:29,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:35:29,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:35:29,142 INFO L87 Difference]: Start difference. First operand 483 states and 758 transitions. Second operand 3 states. [2019-12-07 10:35:29,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:29,393 INFO L93 Difference]: Finished difference Result 1445 states and 2271 transitions. [2019-12-07 10:35:29,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:35:29,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-12-07 10:35:29,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:29,397 INFO L225 Difference]: With dead ends: 1445 [2019-12-07 10:35:29,397 INFO L226 Difference]: Without dead ends: 963 [2019-12-07 10:35:29,398 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:35:29,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2019-12-07 10:35:29,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 803. [2019-12-07 10:35:29,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2019-12-07 10:35:29,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1279 transitions. [2019-12-07 10:35:29,418 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1279 transitions. Word has length 103 [2019-12-07 10:35:29,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:29,418 INFO L462 AbstractCegarLoop]: Abstraction has 803 states and 1279 transitions. [2019-12-07 10:35:29,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:35:29,418 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1279 transitions. [2019-12-07 10:35:29,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-07 10:35:29,420 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:29,420 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:35:29,420 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:35:29,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:29,421 INFO L82 PathProgramCache]: Analyzing trace with hash -911070836, now seen corresponding path program 1 times [2019-12-07 10:35:29,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:35:29,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924602073] [2019-12-07 10:35:29,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:29,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:29,456 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 10:35:29,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924602073] [2019-12-07 10:35:29,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:29,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:35:29,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439113322] [2019-12-07 10:35:29,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:35:29,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:35:29,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:35:29,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:35:29,458 INFO L87 Difference]: Start difference. First operand 803 states and 1279 transitions. Second operand 3 states. [2019-12-07 10:35:29,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:29,713 INFO L93 Difference]: Finished difference Result 2085 states and 3288 transitions. [2019-12-07 10:35:29,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:35:29,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-12-07 10:35:29,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:29,719 INFO L225 Difference]: With dead ends: 2085 [2019-12-07 10:35:29,719 INFO L226 Difference]: Without dead ends: 1283 [2019-12-07 10:35:29,720 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:35:29,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2019-12-07 10:35:29,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1283. [2019-12-07 10:35:29,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2019-12-07 10:35:29,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1830 transitions. [2019-12-07 10:35:29,741 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1830 transitions. Word has length 105 [2019-12-07 10:35:29,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:29,742 INFO L462 AbstractCegarLoop]: Abstraction has 1283 states and 1830 transitions. [2019-12-07 10:35:29,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:35:29,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1830 transitions. [2019-12-07 10:35:29,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-12-07 10:35:29,744 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:29,744 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:35:29,744 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:35:29,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:29,744 INFO L82 PathProgramCache]: Analyzing trace with hash -436611460, now seen corresponding path program 1 times [2019-12-07 10:35:29,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:35:29,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093616334] [2019-12-07 10:35:29,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:29,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:29,778 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-07 10:35:29,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093616334] [2019-12-07 10:35:29,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:29,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:35:29,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190974839] [2019-12-07 10:35:29,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:35:29,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:35:29,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:35:29,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:35:29,780 INFO L87 Difference]: Start difference. First operand 1283 states and 1830 transitions. Second operand 3 states. [2019-12-07 10:35:30,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:30,043 INFO L93 Difference]: Finished difference Result 2805 states and 3994 transitions. [2019-12-07 10:35:30,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:35:30,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-12-07 10:35:30,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:30,051 INFO L225 Difference]: With dead ends: 2805 [2019-12-07 10:35:30,051 INFO L226 Difference]: Without dead ends: 1523 [2019-12-07 10:35:30,053 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:35:30,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2019-12-07 10:35:30,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1443. [2019-12-07 10:35:30,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1443 states. [2019-12-07 10:35:30,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1443 states and 1915 transitions. [2019-12-07 10:35:30,086 INFO L78 Accepts]: Start accepts. Automaton has 1443 states and 1915 transitions. Word has length 107 [2019-12-07 10:35:30,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:30,086 INFO L462 AbstractCegarLoop]: Abstraction has 1443 states and 1915 transitions. [2019-12-07 10:35:30,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:35:30,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 1915 transitions. [2019-12-07 10:35:30,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-12-07 10:35:30,089 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:30,089 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:35:30,089 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:35:30,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:30,090 INFO L82 PathProgramCache]: Analyzing trace with hash -2118161647, now seen corresponding path program 1 times [2019-12-07 10:35:30,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:35:30,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523663626] [2019-12-07 10:35:30,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:30,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:30,168 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 10:35:30,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523663626] [2019-12-07 10:35:30,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:30,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:35:30,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959544020] [2019-12-07 10:35:30,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:35:30,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:35:30,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:35:30,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:35:30,170 INFO L87 Difference]: Start difference. First operand 1443 states and 1915 transitions. Second operand 4 states. [2019-12-07 10:35:30,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:30,629 INFO L93 Difference]: Finished difference Result 3365 states and 4564 transitions. [2019-12-07 10:35:30,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:35:30,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-12-07 10:35:30,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:30,636 INFO L225 Difference]: With dead ends: 3365 [2019-12-07 10:35:30,636 INFO L226 Difference]: Without dead ends: 1923 [2019-12-07 10:35:30,638 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:35:30,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2019-12-07 10:35:30,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 1363. [2019-12-07 10:35:30,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2019-12-07 10:35:30,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1749 transitions. [2019-12-07 10:35:30,662 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1749 transitions. Word has length 107 [2019-12-07 10:35:30,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:30,662 INFO L462 AbstractCegarLoop]: Abstraction has 1363 states and 1749 transitions. [2019-12-07 10:35:30,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:35:30,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1749 transitions. [2019-12-07 10:35:30,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-12-07 10:35:30,664 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:30,665 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2019-12-07 10:35:30,665 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:35:30,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:30,665 INFO L82 PathProgramCache]: Analyzing trace with hash -617264641, now seen corresponding path program 1 times [2019-12-07 10:35:30,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:35:30,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304522425] [2019-12-07 10:35:30,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:30,708 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 10:35:30,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304522425] [2019-12-07 10:35:30,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:30,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:35:30,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93599466] [2019-12-07 10:35:30,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:35:30,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:35:30,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:35:30,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:35:30,709 INFO L87 Difference]: Start difference. First operand 1363 states and 1749 transitions. Second operand 4 states. [2019-12-07 10:35:31,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:31,099 INFO L93 Difference]: Finished difference Result 2885 states and 3692 transitions. [2019-12-07 10:35:31,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:35:31,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-12-07 10:35:31,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:31,104 INFO L225 Difference]: With dead ends: 2885 [2019-12-07 10:35:31,104 INFO L226 Difference]: Without dead ends: 1363 [2019-12-07 10:35:31,106 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:35:31,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2019-12-07 10:35:31,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1203. [2019-12-07 10:35:31,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1203 states. [2019-12-07 10:35:31,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1420 transitions. [2019-12-07 10:35:31,124 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1420 transitions. Word has length 136 [2019-12-07 10:35:31,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:31,124 INFO L462 AbstractCegarLoop]: Abstraction has 1203 states and 1420 transitions. [2019-12-07 10:35:31,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:35:31,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1420 transitions. [2019-12-07 10:35:31,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-12-07 10:35:31,126 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:31,127 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2019-12-07 10:35:31,127 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:35:31,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:31,127 INFO L82 PathProgramCache]: Analyzing trace with hash 810817909, now seen corresponding path program 1 times [2019-12-07 10:35:31,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:35:31,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947313395] [2019-12-07 10:35:31,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:31,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:31,163 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 10:35:31,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947313395] [2019-12-07 10:35:31,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:31,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:35:31,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405111095] [2019-12-07 10:35:31,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:35:31,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:35:31,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:35:31,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:35:31,164 INFO L87 Difference]: Start difference. First operand 1203 states and 1420 transitions. Second operand 3 states. [2019-12-07 10:35:31,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:31,361 INFO L93 Difference]: Finished difference Result 2725 states and 3187 transitions. [2019-12-07 10:35:31,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:35:31,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-12-07 10:35:31,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:31,366 INFO L225 Difference]: With dead ends: 2725 [2019-12-07 10:35:31,366 INFO L226 Difference]: Without dead ends: 1363 [2019-12-07 10:35:31,367 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:35:31,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2019-12-07 10:35:31,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1283. [2019-12-07 10:35:31,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2019-12-07 10:35:31,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1440 transitions. [2019-12-07 10:35:31,385 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1440 transitions. Word has length 140 [2019-12-07 10:35:31,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:31,385 INFO L462 AbstractCegarLoop]: Abstraction has 1283 states and 1440 transitions. [2019-12-07 10:35:31,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:35:31,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1440 transitions. [2019-12-07 10:35:31,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-12-07 10:35:31,388 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:31,388 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:35:31,388 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:35:31,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:31,388 INFO L82 PathProgramCache]: Analyzing trace with hash 97838356, now seen corresponding path program 1 times [2019-12-07 10:35:31,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:35:31,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335786263] [2019-12-07 10:35:31,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:31,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:31,454 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 10:35:31,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335786263] [2019-12-07 10:35:31,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:31,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:35:31,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833346934] [2019-12-07 10:35:31,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:35:31,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:35:31,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:35:31,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:35:31,456 INFO L87 Difference]: Start difference. First operand 1283 states and 1440 transitions. Second operand 3 states. [2019-12-07 10:35:31,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:31,644 INFO L93 Difference]: Finished difference Result 2725 states and 3047 transitions. [2019-12-07 10:35:31,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:35:31,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-12-07 10:35:31,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:31,648 INFO L225 Difference]: With dead ends: 2725 [2019-12-07 10:35:31,649 INFO L226 Difference]: Without dead ends: 1123 [2019-12-07 10:35:31,650 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:35:31,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2019-12-07 10:35:31,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1123. [2019-12-07 10:35:31,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1123 states. [2019-12-07 10:35:31,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1233 transitions. [2019-12-07 10:35:31,664 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1233 transitions. Word has length 171 [2019-12-07 10:35:31,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:31,664 INFO L462 AbstractCegarLoop]: Abstraction has 1123 states and 1233 transitions. [2019-12-07 10:35:31,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:35:31,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1233 transitions. [2019-12-07 10:35:31,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-12-07 10:35:31,666 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:31,666 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:35:31,666 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:35:31,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:31,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1680993731, now seen corresponding path program 1 times [2019-12-07 10:35:31,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:35:31,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531283803] [2019-12-07 10:35:31,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:31,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:31,699 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-12-07 10:35:31,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531283803] [2019-12-07 10:35:31,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:31,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:35:31,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216795098] [2019-12-07 10:35:31,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:35:31,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:35:31,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:35:31,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:35:31,701 INFO L87 Difference]: Start difference. First operand 1123 states and 1233 transitions. Second operand 3 states. [2019-12-07 10:35:31,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:31,856 INFO L93 Difference]: Finished difference Result 2245 states and 2465 transitions. [2019-12-07 10:35:31,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:35:31,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-12-07 10:35:31,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:31,860 INFO L225 Difference]: With dead ends: 2245 [2019-12-07 10:35:31,860 INFO L226 Difference]: Without dead ends: 1123 [2019-12-07 10:35:31,861 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:35:31,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2019-12-07 10:35:31,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1123. [2019-12-07 10:35:31,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1123 states. [2019-12-07 10:35:31,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1227 transitions. [2019-12-07 10:35:31,873 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1227 transitions. Word has length 176 [2019-12-07 10:35:31,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:31,874 INFO L462 AbstractCegarLoop]: Abstraction has 1123 states and 1227 transitions. [2019-12-07 10:35:31,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:35:31,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1227 transitions. [2019-12-07 10:35:31,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-12-07 10:35:31,876 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:31,876 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:35:31,876 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:35:31,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:31,876 INFO L82 PathProgramCache]: Analyzing trace with hash -486299293, now seen corresponding path program 1 times [2019-12-07 10:35:31,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:35:31,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930175493] [2019-12-07 10:35:31,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:31,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:31,939 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 104 proven. 8 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-12-07 10:35:31,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930175493] [2019-12-07 10:35:31,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360746714] [2019-12-07 10:35:31,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4b1048f9-ff3c-40f2-8056-d4c76a8d8022/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:35:32,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:32,017 INFO L264 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 10:35:32,026 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:35:32,085 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-12-07 10:35:32,085 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:35:32,136 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-12-07 10:35:32,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 10:35:32,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [3] total 4 [2019-12-07 10:35:32,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376917487] [2019-12-07 10:35:32,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:35:32,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:35:32,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:35:32,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:35:32,138 INFO L87 Difference]: Start difference. First operand 1123 states and 1227 transitions. Second operand 3 states. [2019-12-07 10:35:32,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:32,260 INFO L93 Difference]: Finished difference Result 2085 states and 2269 transitions. [2019-12-07 10:35:32,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:35:32,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2019-12-07 10:35:32,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:32,263 INFO L225 Difference]: With dead ends: 2085 [2019-12-07 10:35:32,263 INFO L226 Difference]: Without dead ends: 643 [2019-12-07 10:35:32,264 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 391 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:35:32,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-12-07 10:35:32,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 563. [2019-12-07 10:35:32,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-12-07 10:35:32,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 592 transitions. [2019-12-07 10:35:32,273 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 592 transitions. Word has length 197 [2019-12-07 10:35:32,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:32,273 INFO L462 AbstractCegarLoop]: Abstraction has 563 states and 592 transitions. [2019-12-07 10:35:32,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:35:32,274 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 592 transitions. [2019-12-07 10:35:32,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-12-07 10:35:32,275 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:32,275 INFO L410 BasicCegarLoop]: trace histogram [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, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:35:32,476 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:35:32,476 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:35:32,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:32,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1984496367, now seen corresponding path program 1 times [2019-12-07 10:35:32,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:35:32,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114119911] [2019-12-07 10:35:32,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:32,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:32,542 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-12-07 10:35:32,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114119911] [2019-12-07 10:35:32,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:32,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:35:32,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058440449] [2019-12-07 10:35:32,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:35:32,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:35:32,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:35:32,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:35:32,543 INFO L87 Difference]: Start difference. First operand 563 states and 592 transitions. Second operand 4 states. [2019-12-07 10:35:32,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:32,824 INFO L93 Difference]: Finished difference Result 1205 states and 1270 transitions. [2019-12-07 10:35:32,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:35:32,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 206 [2019-12-07 10:35:32,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:32,826 INFO L225 Difference]: With dead ends: 1205 [2019-12-07 10:35:32,826 INFO L226 Difference]: Without dead ends: 643 [2019-12-07 10:35:32,827 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:35:32,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-12-07 10:35:32,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2019-12-07 10:35:32,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-12-07 10:35:32,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 668 transitions. [2019-12-07 10:35:32,837 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 668 transitions. Word has length 206 [2019-12-07 10:35:32,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:32,837 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 668 transitions. [2019-12-07 10:35:32,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:35:32,837 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 668 transitions. [2019-12-07 10:35:32,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-12-07 10:35:32,839 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:32,839 INFO L410 BasicCegarLoop]: trace histogram [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, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 10:35:32,839 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:35:32,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:32,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1331261140, now seen corresponding path program 1 times [2019-12-07 10:35:32,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:35:32,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223355830] [2019-12-07 10:35:32,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:32,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:32,948 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:35:32,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223355830] [2019-12-07 10:35:32,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:35:32,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:35:32,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937045506] [2019-12-07 10:35:32,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:35:32,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:35:32,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:35:32,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:35:32,950 INFO L87 Difference]: Start difference. First operand 643 states and 668 transitions. Second operand 5 states. [2019-12-07 10:35:33,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:35:33,234 INFO L93 Difference]: Finished difference Result 1125 states and 1165 transitions. [2019-12-07 10:35:33,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:35:33,235 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 229 [2019-12-07 10:35:33,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:35:33,237 INFO L225 Difference]: With dead ends: 1125 [2019-12-07 10:35:33,237 INFO L226 Difference]: Without dead ends: 563 [2019-12-07 10:35:33,238 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:35:33,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2019-12-07 10:35:33,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 483. [2019-12-07 10:35:33,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-12-07 10:35:33,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 498 transitions. [2019-12-07 10:35:33,246 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 498 transitions. Word has length 229 [2019-12-07 10:35:33,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:35:33,247 INFO L462 AbstractCegarLoop]: Abstraction has 483 states and 498 transitions. [2019-12-07 10:35:33,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:35:33,247 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 498 transitions. [2019-12-07 10:35:33,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-12-07 10:35:33,250 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:35:33,250 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:35:33,250 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:35:33,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:35:33,251 INFO L82 PathProgramCache]: Analyzing trace with hash -955876154, now seen corresponding path program 1 times [2019-12-07 10:35:33,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:35:33,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501433515] [2019-12-07 10:35:33,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:35:33,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:33,480 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 344 proven. 8 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 10:35:33,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501433515] [2019-12-07 10:35:33,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156471528] [2019-12-07 10:35:33,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4b1048f9-ff3c-40f2-8056-d4c76a8d8022/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:35:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:35:33,571 INFO L264 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 10:35:33,580 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:35:33,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:33,806 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 383 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:35:33,806 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:35:33,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 10:35:33,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:33,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:33,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:33,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:33,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:33,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:35:34,113 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 259 proven. 64 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 10:35:34,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [469410111] [2019-12-07 10:35:34,132 INFO L159 IcfgInterpreter]: Started Sifa with 82 locations of interest [2019-12-07 10:35:34,133 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 10:35:34,137 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 10:35:34,141 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 10:35:34,141 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 10:35:54,368 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 61 [2019-12-07 10:35:54,509 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 6374 conjuctions. This might take some time... [2019-12-07 10:35:54,543 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 61 [2019-12-07 10:35:54,680 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 6374 conjuctions. This might take some time... [2019-12-07 10:35:54,726 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 61 [2019-12-07 10:35:54,852 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 6374 conjuctions. This might take some time... [2019-12-07 10:35:59,158 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 10:35:59,300 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-12-07 10:35:59,551 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 76 [2019-12-07 10:35:59,710 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 81 [2019-12-07 10:35:59,975 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 89 [2019-12-07 10:36:01,436 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 75 [2019-12-07 10:36:01,683 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2019-12-07 10:36:01,870 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 75 [2019-12-07 10:36:02,109 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-12-07 10:36:02,339 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 73 [2019-12-07 10:36:03,826 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-12-07 10:36:04,146 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 75 [2019-12-07 10:36:04,495 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-12-07 10:36:04,712 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2019-12-07 10:36:04,938 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2019-12-07 10:36:05,240 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-12-07 10:36:11,164 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2019-12-07 10:36:11,270 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 10:36:11,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 10:36:11,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 14 [2019-12-07 10:36:11,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823517301] [2019-12-07 10:36:11,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 10:36:11,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:36:11,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 10:36:11,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=923, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 10:36:11,272 INFO L87 Difference]: Start difference. First operand 483 states and 498 transitions. Second operand 14 states. [2019-12-07 10:36:11,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:36:11,692 INFO L93 Difference]: Finished difference Result 723 states and 750 transitions. [2019-12-07 10:36:11,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:36:11,693 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 279 [2019-12-07 10:36:11,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:36:11,693 INFO L225 Difference]: With dead ends: 723 [2019-12-07 10:36:11,693 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 10:36:11,694 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 847 GetRequests, 598 SyntacticMatches, 216 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5380 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=153, Invalid=1037, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 10:36:11,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 10:36:11,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 10:36:11,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 10:36:11,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 10:36:11,695 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 279 [2019-12-07 10:36:11,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:36:11,695 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 10:36:11,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 10:36:11,695 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 10:36:11,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 10:36:11,896 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:36:11,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 10:36:12,204 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-12-07 10:36:12,465 WARN L192 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2019-12-07 10:36:12,467 INFO L246 CegarLoopResult]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-12-07 10:36:12,467 INFO L246 CegarLoopResult]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-12-07 10:36:12,467 INFO L246 CegarLoopResult]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-12-07 10:36:12,468 INFO L246 CegarLoopResult]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-12-07 10:36:12,468 INFO L246 CegarLoopResult]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-12-07 10:36:12,468 INFO L246 CegarLoopResult]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-12-07 10:36:12,468 INFO L246 CegarLoopResult]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-12-07 10:36:12,468 INFO L246 CegarLoopResult]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-12-07 10:36:12,468 INFO L246 CegarLoopResult]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-12-07 10:36:12,468 INFO L246 CegarLoopResult]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-12-07 10:36:12,468 INFO L246 CegarLoopResult]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-12-07 10:36:12,468 INFO L246 CegarLoopResult]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-12-07 10:36:12,468 INFO L246 CegarLoopResult]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-12-07 10:36:12,468 INFO L246 CegarLoopResult]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-12-07 10:36:12,469 INFO L246 CegarLoopResult]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-12-07 10:36:12,469 INFO L246 CegarLoopResult]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-12-07 10:36:12,469 INFO L246 CegarLoopResult]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-12-07 10:36:12,469 INFO L246 CegarLoopResult]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-12-07 10:36:12,469 INFO L246 CegarLoopResult]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-12-07 10:36:12,469 INFO L246 CegarLoopResult]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-12-07 10:36:12,469 INFO L246 CegarLoopResult]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-12-07 10:36:12,469 INFO L246 CegarLoopResult]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-12-07 10:36:12,469 INFO L246 CegarLoopResult]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-12-07 10:36:12,469 INFO L246 CegarLoopResult]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-12-07 10:36:12,469 INFO L246 CegarLoopResult]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-12-07 10:36:12,469 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 10:36:12,470 INFO L246 CegarLoopResult]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-12-07 10:36:12,470 INFO L246 CegarLoopResult]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-12-07 10:36:12,470 INFO L246 CegarLoopResult]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-12-07 10:36:12,470 INFO L246 CegarLoopResult]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 10:36:12,470 INFO L246 CegarLoopResult]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-12-07 10:36:12,470 INFO L246 CegarLoopResult]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-12-07 10:36:12,470 INFO L246 CegarLoopResult]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2019-12-07 10:36:12,470 INFO L246 CegarLoopResult]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-12-07 10:36:12,470 INFO L246 CegarLoopResult]: For program point L592(line 592) no Hoare annotation was computed. [2019-12-07 10:36:12,470 INFO L246 CegarLoopResult]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-12-07 10:36:12,470 INFO L246 CegarLoopResult]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-12-07 10:36:12,470 INFO L246 CegarLoopResult]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-12-07 10:36:12,470 INFO L246 CegarLoopResult]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-12-07 10:36:12,470 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 592) no Hoare annotation was computed. [2019-12-07 10:36:12,470 INFO L246 CegarLoopResult]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-12-07 10:36:12,470 INFO L246 CegarLoopResult]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-12-07 10:36:12,471 INFO L246 CegarLoopResult]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-12-07 10:36:12,471 INFO L246 CegarLoopResult]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-12-07 10:36:12,471 INFO L242 CegarLoopResult]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse0 (= ~a28~0 10)) (.cse6 (= ~a25~0 1)) (.cse9 (= ~a11~0 1)) (.cse1 (= ~a19~0 1))) (let ((.cse10 (not (= ~a28~0 11))) (.cse7 (not .cse1)) (.cse3 (= ~a17~0 8)) (.cse4 (= ~a28~0 7)) (.cse5 (= ~a21~0 1)) (.cse2 (not .cse9)) (.cse11 (<= ~a17~0 8)) (.cse12 (<= 10 ~a28~0)) (.cse13 (not .cse6)) (.cse8 (not .cse0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse4 .cse5) (and (= ~a28~0 9) .cse3 .cse1 .cse5) (and .cse1 .cse4 .cse2 .cse6) (and .cse7 (= ~a28~0 8) (= ~a25~0 0) .cse3 .cse5 .cse2 .cse8) (and .cse7 .cse6 .cse9 .cse10 .cse8) (and .cse7 .cse4 .cse9) (and .cse1 .cse11 .cse9 .cse10 .cse8) (and .cse0 .cse1 .cse6) (and (<= ~a19~0 0) .cse12 .cse13 .cse9) (and .cse1 .cse2 .cse6 .cse11) (and .cse7 .cse13 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse6 .cse11) (and .cse12 .cse13 .cse1 .cse9 .cse8)))) [2019-12-07 10:36:12,471 INFO L246 CegarLoopResult]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-12-07 10:36:12,471 INFO L246 CegarLoopResult]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-12-07 10:36:12,471 INFO L249 CegarLoopResult]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-12-07 10:36:12,471 INFO L246 CegarLoopResult]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-12-07 10:36:12,471 INFO L246 CegarLoopResult]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-12-07 10:36:12,471 INFO L246 CegarLoopResult]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-12-07 10:36:12,472 INFO L246 CegarLoopResult]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-12-07 10:36:12,472 INFO L246 CegarLoopResult]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-12-07 10:36:12,472 INFO L246 CegarLoopResult]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-12-07 10:36:12,472 INFO L246 CegarLoopResult]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-12-07 10:36:12,472 INFO L242 CegarLoopResult]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse0 (= ~a28~0 10)) (.cse6 (= ~a25~0 1)) (.cse9 (= ~a11~0 1)) (.cse1 (= ~a19~0 1))) (let ((.cse10 (not (= ~a28~0 11))) (.cse7 (not .cse1)) (.cse3 (= ~a17~0 8)) (.cse4 (= ~a28~0 7)) (.cse5 (= ~a21~0 1)) (.cse2 (not .cse9)) (.cse11 (<= ~a17~0 8)) (.cse12 (<= 10 ~a28~0)) (.cse13 (not .cse6)) (.cse8 (not .cse0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse4 .cse5) (and (= ~a28~0 9) .cse3 .cse1 .cse5) (and .cse1 .cse4 .cse2 .cse6) (and .cse7 (= ~a28~0 8) (= ~a25~0 0) .cse3 .cse5 .cse2 .cse8) (and .cse7 .cse6 .cse9 .cse10 .cse8) (and .cse7 .cse4 .cse9) (and .cse1 .cse11 .cse9 .cse10 .cse8) (and .cse0 .cse1 .cse6) (and (<= ~a19~0 0) .cse12 .cse13 .cse9) (and .cse1 .cse2 .cse6 .cse11) (and .cse7 .cse13 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse6 .cse11) (and .cse12 .cse13 .cse1 .cse9 .cse8)))) [2019-12-07 10:36:12,472 INFO L246 CegarLoopResult]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-12-07 10:36:12,472 INFO L246 CegarLoopResult]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-12-07 10:36:12,472 INFO L246 CegarLoopResult]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-12-07 10:36:12,472 INFO L246 CegarLoopResult]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-12-07 10:36:12,472 INFO L246 CegarLoopResult]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-12-07 10:36:12,472 INFO L246 CegarLoopResult]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-12-07 10:36:12,472 INFO L246 CegarLoopResult]: For program point L611(line 611) no Hoare annotation was computed. [2019-12-07 10:36:12,472 INFO L246 CegarLoopResult]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-12-07 10:36:12,472 INFO L246 CegarLoopResult]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-12-07 10:36:12,473 INFO L246 CegarLoopResult]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-12-07 10:36:12,473 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 10:36:12,473 INFO L246 CegarLoopResult]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-12-07 10:36:12,473 INFO L246 CegarLoopResult]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-12-07 10:36:12,473 INFO L246 CegarLoopResult]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-12-07 10:36:12,473 INFO L246 CegarLoopResult]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-12-07 10:36:12,473 INFO L246 CegarLoopResult]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-12-07 10:36:12,473 INFO L246 CegarLoopResult]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-12-07 10:36:12,473 INFO L246 CegarLoopResult]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-12-07 10:36:12,473 INFO L246 CegarLoopResult]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-12-07 10:36:12,473 INFO L246 CegarLoopResult]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-12-07 10:36:12,473 INFO L246 CegarLoopResult]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-12-07 10:36:12,473 INFO L246 CegarLoopResult]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-12-07 10:36:12,473 INFO L246 CegarLoopResult]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-12-07 10:36:12,473 INFO L246 CegarLoopResult]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-12-07 10:36:12,473 INFO L246 CegarLoopResult]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-12-07 10:36:12,473 INFO L246 CegarLoopResult]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-12-07 10:36:12,473 INFO L246 CegarLoopResult]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-12-07 10:36:12,474 INFO L246 CegarLoopResult]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-12-07 10:36:12,474 INFO L246 CegarLoopResult]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-12-07 10:36:12,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:36:12 BoogieIcfgContainer [2019-12-07 10:36:12,494 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:36:12,495 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:36:12,495 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:36:12,495 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:36:12,495 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:35:27" (3/4) ... [2019-12-07 10:36:12,498 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 10:36:12,516 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 109 nodes and edges [2019-12-07 10:36:12,518 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-12-07 10:36:12,519 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2019-12-07 10:36:12,520 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 10:36:12,615 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_4b1048f9-ff3c-40f2-8056-d4c76a8d8022/bin/utaipan/witness.graphml [2019-12-07 10:36:12,615 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:36:12,616 INFO L168 Benchmark]: Toolchain (without parser) took 46332.55 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.4 GB). Free memory was 935.3 MB in the beginning and 1.0 GB in the end (delta: -88.2 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-12-07 10:36:12,616 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 959.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:36:12,616 INFO L168 Benchmark]: CACSL2BoogieTranslator took 349.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.4 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -132.0 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2019-12-07 10:36:12,617 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:36:12,617 INFO L168 Benchmark]: Boogie Preprocessor took 38.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:36:12,617 INFO L168 Benchmark]: RCFGBuilder took 1200.00 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -31.2 MB). Peak memory consumption was 233.7 MB. Max. memory is 11.5 GB. [2019-12-07 10:36:12,617 INFO L168 Benchmark]: TraceAbstraction took 44567.66 ms. Allocated memory was 1.1 GB in the beginning and 2.4 GB in the end (delta: 1.3 GB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.7 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-12-07 10:36:12,618 INFO L168 Benchmark]: Witness Printer took 120.41 ms. Allocated memory is still 2.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-12-07 10:36:12,619 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 959.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 349.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.4 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -132.0 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1200.00 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -31.2 MB). Peak memory consumption was 233.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 44567.66 ms. Allocated memory was 1.1 GB in the beginning and 2.4 GB in the end (delta: 1.3 GB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.7 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 120.41 ms. Allocated memory is still 2.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 592]: 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: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((((((((((a28 == 10 && a19 == 1) && !(a11 == 1)) || (((a17 == 8 && a19 == 1) && a28 == 7) && a21 == 1)) || (((a28 == 9 && a17 == 8) && a19 == 1) && a21 == 1)) || (((a19 == 1 && a28 == 7) && !(a11 == 1)) && a25 == 1)) || ((((((!(a19 == 1) && a28 == 8) && a25 == 0) && a17 == 8) && a21 == 1) && !(a11 == 1)) && !(a28 == 10))) || ((((!(a19 == 1) && a25 == 1) && a11 == 1) && !(a28 == 11)) && !(a28 == 10))) || ((!(a19 == 1) && a28 == 7) && a11 == 1)) || ((((a19 == 1 && a17 <= 8) && a11 == 1) && !(a28 == 11)) && !(a28 == 10))) || ((a28 == 10 && a19 == 1) && a25 == 1)) || (((a19 <= 0 && 10 <= a28) && !(a25 == 1)) && a11 == 1)) || (((a19 == 1 && !(a11 == 1)) && a25 == 1) && a17 <= 8)) || ((((!(a19 == 1) && !(a25 == 1)) && a17 == 8) && a28 == 7) && a21 == 1)) || (((a28 == 10 && !(a11 == 1)) && a25 == 1) && a17 <= 8)) || ((((10 <= a28 && !(a25 == 1)) && a19 == 1) && a11 == 1) && !(a28 == 10)) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((((((((((((((a28 == 10 && a19 == 1) && !(a11 == 1)) || (((a17 == 8 && a19 == 1) && a28 == 7) && a21 == 1)) || (((a28 == 9 && a17 == 8) && a19 == 1) && a21 == 1)) || (((a19 == 1 && a28 == 7) && !(a11 == 1)) && a25 == 1)) || ((((((!(a19 == 1) && a28 == 8) && a25 == 0) && a17 == 8) && a21 == 1) && !(a11 == 1)) && !(a28 == 10))) || ((((!(a19 == 1) && a25 == 1) && a11 == 1) && !(a28 == 11)) && !(a28 == 10))) || ((!(a19 == 1) && a28 == 7) && a11 == 1)) || ((((a19 == 1 && a17 <= 8) && a11 == 1) && !(a28 == 11)) && !(a28 == 10))) || ((a28 == 10 && a19 == 1) && a25 == 1)) || (((a19 <= 0 && 10 <= a28) && !(a25 == 1)) && a11 == 1)) || (((a19 == 1 && !(a11 == 1)) && a25 == 1) && a17 <= 8)) || ((((!(a19 == 1) && !(a25 == 1)) && a17 == 8) && a28 == 7) && a21 == 1)) || (((a28 == 10 && !(a11 == 1)) && a25 == 1) && a17 <= 8)) || ((((10 <= a28 && !(a25 == 1)) && a19 == 1) && a11 == 1) && !(a28 == 10)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 85 locations, 1 error locations. Result: SAFE, OverallTime: 43.9s, OverallIterations: 14, TraceHistogramMax: 5, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, HoareTripleCheckerStatistics: 1004 SDtfs, 1761 SDslu, 138 SDs, 0 SdLazy, 4723 SolverSat, 837 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1285 GetRequests, 1011 SyntacticMatches, 220 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5380 ImplicationChecksByTransitivity, 12.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1443occurred in iteration=5, 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, 14 MinimizatonAttempts, 1200 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 44 NumberOfFragments, 427 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1348 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 408 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 2597 NumberOfCodeBlocks, 2597 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3055 ConstructedInterpolants, 0 QuantifiedInterpolants, 2493584 SizeOfPredicates, 2 NumberOfNonLiveVariables, 903 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 18 InterpolantComputations, 14 PerfectInterpolantSequences, 2736/2831 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...