./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem03_label48.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_524b1995-3e3e-48c2-a22a-6cc448e9c43c/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_524b1995-3e3e-48c2-a22a-6cc448e9c43c/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_524b1995-3e3e-48c2-a22a-6cc448e9c43c/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_524b1995-3e3e-48c2-a22a-6cc448e9c43c/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem03_label48.c -s /tmp/vcloud-vcloud-master/worker/run_dir_524b1995-3e3e-48c2-a22a-6cc448e9c43c/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_524b1995-3e3e-48c2-a22a-6cc448e9c43c/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 ed0ef8676714c03e409913657b72922b069856bc ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 22:07:36,829 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 22:07:36,830 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 22:07:36,838 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 22:07:36,838 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 22:07:36,839 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 22:07:36,840 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 22:07:36,841 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 22:07:36,842 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 22:07:36,843 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 22:07:36,843 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 22:07:36,844 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 22:07:36,844 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 22:07:36,845 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 22:07:36,846 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 22:07:36,846 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 22:07:36,847 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 22:07:36,848 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 22:07:36,849 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 22:07:36,850 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 22:07:36,851 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 22:07:36,852 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 22:07:36,853 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 22:07:36,853 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 22:07:36,855 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 22:07:36,855 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 22:07:36,855 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 22:07:36,856 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 22:07:36,856 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 22:07:36,856 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 22:07:36,857 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 22:07:36,857 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 22:07:36,857 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 22:07:36,858 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 22:07:36,858 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 22:07:36,859 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 22:07:36,859 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 22:07:36,859 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 22:07:36,859 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 22:07:36,860 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 22:07:36,860 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 22:07:36,861 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_524b1995-3e3e-48c2-a22a-6cc448e9c43c/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 22:07:36,871 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 22:07:36,871 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 22:07:36,871 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 22:07:36,872 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 22:07:36,872 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 22:07:36,872 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 22:07:36,872 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 22:07:36,872 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 22:07:36,872 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 22:07:36,872 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 22:07:36,872 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 22:07:36,873 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 22:07:36,873 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 22:07:36,873 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 22:07:36,873 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 22:07:36,873 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 22:07:36,874 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 22:07:36,874 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 22:07:36,874 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 22:07:36,874 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 22:07:36,874 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 22:07:36,874 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 22:07:36,874 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 22:07:36,874 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 22:07:36,875 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 22:07:36,875 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 22:07:36,875 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 22:07:36,875 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 22:07:36,875 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 22:07:36,875 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 22:07:36,875 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 22:07:36,875 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 22:07:36,875 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 22:07:36,876 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 22:07:36,876 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 22:07:36,876 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 22:07:36,876 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 22:07:36,876 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 22:07:36,876 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 22:07:36,876 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 22:07:36,876 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_524b1995-3e3e-48c2-a22a-6cc448e9c43c/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 -> ed0ef8676714c03e409913657b72922b069856bc [2019-12-07 22:07:36,974 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 22:07:36,982 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 22:07:36,984 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 22:07:36,985 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 22:07:36,985 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 22:07:36,986 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_524b1995-3e3e-48c2-a22a-6cc448e9c43c/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem03_label48.c [2019-12-07 22:07:37,022 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_524b1995-3e3e-48c2-a22a-6cc448e9c43c/bin/utaipan/data/5e889c3a9/6bf36599411e4a33b53ac0262ca5a933/FLAG87a01720a [2019-12-07 22:07:37,463 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 22:07:37,464 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_524b1995-3e3e-48c2-a22a-6cc448e9c43c/sv-benchmarks/c/eca-rers2012/Problem03_label48.c [2019-12-07 22:07:37,475 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_524b1995-3e3e-48c2-a22a-6cc448e9c43c/bin/utaipan/data/5e889c3a9/6bf36599411e4a33b53ac0262ca5a933/FLAG87a01720a [2019-12-07 22:07:37,484 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_524b1995-3e3e-48c2-a22a-6cc448e9c43c/bin/utaipan/data/5e889c3a9/6bf36599411e4a33b53ac0262ca5a933 [2019-12-07 22:07:37,486 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 22:07:37,487 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 22:07:37,488 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 22:07:37,488 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 22:07:37,490 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 22:07:37,491 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:07:37" (1/1) ... [2019-12-07 22:07:37,492 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ffc5a17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:37, skipping insertion in model container [2019-12-07 22:07:37,493 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:07:37" (1/1) ... [2019-12-07 22:07:37,497 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 22:07:37,545 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 22:07:37,920 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 22:07:37,923 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 22:07:38,062 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 22:07:38,074 INFO L208 MainTranslator]: Completed translation [2019-12-07 22:07:38,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:38 WrapperNode [2019-12-07 22:07:38,075 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 22:07:38,075 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 22:07:38,075 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 22:07:38,075 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 22:07:38,081 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:07:38" (1/1) ... [2019-12-07 22:07:38,102 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:07:38" (1/1) ... [2019-12-07 22:07:38,155 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 22:07:38,156 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 22:07:38,156 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 22:07:38,156 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 22:07:38,162 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:38" (1/1) ... [2019-12-07 22:07:38,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:38" (1/1) ... [2019-12-07 22:07:38,168 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:38" (1/1) ... [2019-12-07 22:07:38,168 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:38" (1/1) ... [2019-12-07 22:07:38,195 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:38" (1/1) ... [2019-12-07 22:07:38,205 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:38" (1/1) ... [2019-12-07 22:07:38,215 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:38" (1/1) ... [2019-12-07 22:07:38,223 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 22:07:38,223 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 22:07:38,224 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 22:07:38,224 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 22:07:38,224 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_524b1995-3e3e-48c2-a22a-6cc448e9c43c/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 22:07:38,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 22:07:38,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 22:07:39,979 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 22:07:39,979 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 22:07:39,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:39 BoogieIcfgContainer [2019-12-07 22:07:39,980 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 22:07:39,981 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 22:07:39,981 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 22:07:39,983 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 22:07:39,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:07:37" (1/3) ... [2019-12-07 22:07:39,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec3fc48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:07:39, skipping insertion in model container [2019-12-07 22:07:39,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:38" (2/3) ... [2019-12-07 22:07:39,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec3fc48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:07:39, skipping insertion in model container [2019-12-07 22:07:39,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:39" (3/3) ... [2019-12-07 22:07:39,985 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label48.c [2019-12-07 22:07:39,991 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 22:07:39,996 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 22:07:40,004 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 22:07:40,021 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 22:07:40,021 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 22:07:40,022 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 22:07:40,022 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 22:07:40,022 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 22:07:40,022 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 22:07:40,022 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 22:07:40,022 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 22:07:40,035 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-12-07 22:07:40,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-12-07 22:07:40,044 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:07:40,044 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:07:40,045 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:07:40,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:07:40,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1467442911, now seen corresponding path program 1 times [2019-12-07 22:07:40,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:07:40,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753431516] [2019-12-07 22:07:40,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:07:40,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:07:40,435 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 22:07:40,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753431516] [2019-12-07 22:07:40,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:07:40,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 22:07:40,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878911569] [2019-12-07 22:07:40,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 22:07:40,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:07:40,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 22:07:40,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 22:07:40,452 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-12-07 22:07:41,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:07:41,374 INFO L93 Difference]: Finished difference Result 585 states and 1145 transitions. [2019-12-07 22:07:41,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 22:07:41,375 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-12-07 22:07:41,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:07:41,391 INFO L225 Difference]: With dead ends: 585 [2019-12-07 22:07:41,391 INFO L226 Difference]: Without dead ends: 432 [2019-12-07 22:07:41,395 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 22:07:41,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-12-07 22:07:41,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 289. [2019-12-07 22:07:41,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-12-07 22:07:41,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 521 transitions. [2019-12-07 22:07:41,446 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 521 transitions. Word has length 143 [2019-12-07 22:07:41,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:07:41,446 INFO L462 AbstractCegarLoop]: Abstraction has 289 states and 521 transitions. [2019-12-07 22:07:41,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 22:07:41,447 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 521 transitions. [2019-12-07 22:07:41,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-12-07 22:07:41,450 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:07:41,451 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:07:41,451 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:07:41,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:07:41,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1977869888, now seen corresponding path program 1 times [2019-12-07 22:07:41,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:07:41,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655783447] [2019-12-07 22:07:41,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:07:41,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:07:41,535 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:07:41,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655783447] [2019-12-07 22:07:41,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:07:41,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 22:07:41,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340167716] [2019-12-07 22:07:41,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 22:07:41,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:07:41,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 22:07:41,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 22:07:41,538 INFO L87 Difference]: Start difference. First operand 289 states and 521 transitions. Second operand 3 states. [2019-12-07 22:07:42,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:07:42,265 INFO L93 Difference]: Finished difference Result 863 states and 1560 transitions. [2019-12-07 22:07:42,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 22:07:42,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-12-07 22:07:42,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:07:42,270 INFO L225 Difference]: With dead ends: 863 [2019-12-07 22:07:42,270 INFO L226 Difference]: Without dead ends: 575 [2019-12-07 22:07:42,272 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 22:07:42,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2019-12-07 22:07:42,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 575. [2019-12-07 22:07:42,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-12-07 22:07:42,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1015 transitions. [2019-12-07 22:07:42,302 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 1015 transitions. Word has length 151 [2019-12-07 22:07:42,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:07:42,302 INFO L462 AbstractCegarLoop]: Abstraction has 575 states and 1015 transitions. [2019-12-07 22:07:42,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 22:07:42,302 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 1015 transitions. [2019-12-07 22:07:42,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-12-07 22:07:42,307 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:07:42,307 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:07:42,308 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:07:42,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:07:42,308 INFO L82 PathProgramCache]: Analyzing trace with hash -119305479, now seen corresponding path program 1 times [2019-12-07 22:07:42,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:07:42,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602717750] [2019-12-07 22:07:42,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:07:42,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:07:42,382 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:07:42,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602717750] [2019-12-07 22:07:42,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:07:42,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 22:07:42,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691044794] [2019-12-07 22:07:42,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 22:07:42,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:07:42,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 22:07:42,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 22:07:42,384 INFO L87 Difference]: Start difference. First operand 575 states and 1015 transitions. Second operand 4 states. [2019-12-07 22:07:43,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:07:43,256 INFO L93 Difference]: Finished difference Result 2293 states and 4055 transitions. [2019-12-07 22:07:43,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 22:07:43,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-12-07 22:07:43,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:07:43,266 INFO L225 Difference]: With dead ends: 2293 [2019-12-07 22:07:43,266 INFO L226 Difference]: Without dead ends: 1719 [2019-12-07 22:07:43,268 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 22:07:43,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2019-12-07 22:07:43,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1147. [2019-12-07 22:07:43,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1147 states. [2019-12-07 22:07:43,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1880 transitions. [2019-12-07 22:07:43,295 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1880 transitions. Word has length 152 [2019-12-07 22:07:43,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:07:43,295 INFO L462 AbstractCegarLoop]: Abstraction has 1147 states and 1880 transitions. [2019-12-07 22:07:43,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 22:07:43,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1880 transitions. [2019-12-07 22:07:43,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-12-07 22:07:43,297 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:07:43,298 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:07:43,298 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:07:43,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:07:43,298 INFO L82 PathProgramCache]: Analyzing trace with hash 351587581, now seen corresponding path program 1 times [2019-12-07 22:07:43,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:07:43,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529169142] [2019-12-07 22:07:43,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:07:43,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:07:43,415 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 22:07:43,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529169142] [2019-12-07 22:07:43,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:07:43,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 22:07:43,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815815748] [2019-12-07 22:07:43,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 22:07:43,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:07:43,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 22:07:43,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 22:07:43,416 INFO L87 Difference]: Start difference. First operand 1147 states and 1880 transitions. Second operand 4 states. [2019-12-07 22:07:44,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:07:44,392 INFO L93 Difference]: Finished difference Result 4581 states and 7515 transitions. [2019-12-07 22:07:44,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 22:07:44,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-12-07 22:07:44,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:07:44,410 INFO L225 Difference]: With dead ends: 4581 [2019-12-07 22:07:44,410 INFO L226 Difference]: Without dead ends: 3435 [2019-12-07 22:07:44,412 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 22:07:44,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3435 states. [2019-12-07 22:07:44,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3435 to 3435. [2019-12-07 22:07:44,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3435 states. [2019-12-07 22:07:44,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3435 states to 3435 states and 5021 transitions. [2019-12-07 22:07:44,470 INFO L78 Accepts]: Start accepts. Automaton has 3435 states and 5021 transitions. Word has length 158 [2019-12-07 22:07:44,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:07:44,470 INFO L462 AbstractCegarLoop]: Abstraction has 3435 states and 5021 transitions. [2019-12-07 22:07:44,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 22:07:44,470 INFO L276 IsEmpty]: Start isEmpty. Operand 3435 states and 5021 transitions. [2019-12-07 22:07:44,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-12-07 22:07:44,476 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:07:44,476 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:07:44,476 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:07:44,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:07:44,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1925389054, now seen corresponding path program 1 times [2019-12-07 22:07:44,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:07:44,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474591840] [2019-12-07 22:07:44,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:07:44,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:07:44,550 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:07:44,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474591840] [2019-12-07 22:07:44,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:07:44,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 22:07:44,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644064187] [2019-12-07 22:07:44,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 22:07:44,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:07:44,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 22:07:44,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 22:07:44,552 INFO L87 Difference]: Start difference. First operand 3435 states and 5021 transitions. Second operand 3 states. [2019-12-07 22:07:45,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:07:45,135 INFO L93 Difference]: Finished difference Result 8013 states and 11565 transitions. [2019-12-07 22:07:45,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 22:07:45,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-12-07 22:07:45,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:07:45,151 INFO L225 Difference]: With dead ends: 8013 [2019-12-07 22:07:45,151 INFO L226 Difference]: Without dead ends: 4579 [2019-12-07 22:07:45,154 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 22:07:45,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4579 states. [2019-12-07 22:07:45,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4579 to 4579. [2019-12-07 22:07:45,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4579 states. [2019-12-07 22:07:45,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4579 states to 4579 states and 6383 transitions. [2019-12-07 22:07:45,216 INFO L78 Accepts]: Start accepts. Automaton has 4579 states and 6383 transitions. Word has length 184 [2019-12-07 22:07:45,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:07:45,217 INFO L462 AbstractCegarLoop]: Abstraction has 4579 states and 6383 transitions. [2019-12-07 22:07:45,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 22:07:45,217 INFO L276 IsEmpty]: Start isEmpty. Operand 4579 states and 6383 transitions. [2019-12-07 22:07:45,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-12-07 22:07:45,223 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:07:45,223 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:07:45,224 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:07:45,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:07:45,224 INFO L82 PathProgramCache]: Analyzing trace with hash -2078782107, now seen corresponding path program 1 times [2019-12-07 22:07:45,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:07:45,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004973331] [2019-12-07 22:07:45,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:07:45,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:07:45,330 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:07:45,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004973331] [2019-12-07 22:07:45,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134942440] [2019-12-07 22:07:45,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_524b1995-3e3e-48c2-a22a-6cc448e9c43c/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 22:07:45,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:07:45,433 INFO L264 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 22:07:45,444 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:07:45,488 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 22:07:45,488 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:07:45,518 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 22:07:45,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 22:07:45,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-12-07 22:07:45,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74574158] [2019-12-07 22:07:45,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 22:07:45,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:07:45,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 22:07:45,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 22:07:45,520 INFO L87 Difference]: Start difference. First operand 4579 states and 6383 transitions. Second operand 3 states. [2019-12-07 22:07:46,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:07:46,091 INFO L93 Difference]: Finished difference Result 13161 states and 18340 transitions. [2019-12-07 22:07:46,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 22:07:46,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 191 [2019-12-07 22:07:46,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:07:46,120 INFO L225 Difference]: With dead ends: 13161 [2019-12-07 22:07:46,120 INFO L226 Difference]: Without dead ends: 8583 [2019-12-07 22:07:46,123 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 380 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 22:07:46,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8583 states. [2019-12-07 22:07:46,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8583 to 8583. [2019-12-07 22:07:46,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8583 states. [2019-12-07 22:07:46,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8583 states to 8583 states and 11332 transitions. [2019-12-07 22:07:46,221 INFO L78 Accepts]: Start accepts. Automaton has 8583 states and 11332 transitions. Word has length 191 [2019-12-07 22:07:46,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:07:46,221 INFO L462 AbstractCegarLoop]: Abstraction has 8583 states and 11332 transitions. [2019-12-07 22:07:46,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 22:07:46,221 INFO L276 IsEmpty]: Start isEmpty. Operand 8583 states and 11332 transitions. [2019-12-07 22:07:46,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-12-07 22:07:46,233 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:07:46,233 INFO L410 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:07:46,434 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 22:07:46,435 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:07:46,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:07:46,435 INFO L82 PathProgramCache]: Analyzing trace with hash 2057971204, now seen corresponding path program 1 times [2019-12-07 22:07:46,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:07:46,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83367263] [2019-12-07 22:07:46,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:07:46,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:07:46,604 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:07:46,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83367263] [2019-12-07 22:07:46,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:07:46,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 22:07:46,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005721077] [2019-12-07 22:07:46,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 22:07:46,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:07:46,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 22:07:46,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 22:07:46,606 INFO L87 Difference]: Start difference. First operand 8583 states and 11332 transitions. Second operand 4 states. [2019-12-07 22:07:47,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:07:47,467 INFO L93 Difference]: Finished difference Result 20168 states and 26281 transitions. [2019-12-07 22:07:47,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 22:07:47,467 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 206 [2019-12-07 22:07:47,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:07:47,500 INFO L225 Difference]: With dead ends: 20168 [2019-12-07 22:07:47,500 INFO L226 Difference]: Without dead ends: 11586 [2019-12-07 22:07:47,506 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 22:07:47,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11586 states. [2019-12-07 22:07:47,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11586 to 9441. [2019-12-07 22:07:47,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9441 states. [2019-12-07 22:07:47,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9441 states to 9441 states and 12151 transitions. [2019-12-07 22:07:47,601 INFO L78 Accepts]: Start accepts. Automaton has 9441 states and 12151 transitions. Word has length 206 [2019-12-07 22:07:47,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:07:47,601 INFO L462 AbstractCegarLoop]: Abstraction has 9441 states and 12151 transitions. [2019-12-07 22:07:47,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 22:07:47,601 INFO L276 IsEmpty]: Start isEmpty. Operand 9441 states and 12151 transitions. [2019-12-07 22:07:47,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-12-07 22:07:47,612 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:07:47,612 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:07:47,613 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:07:47,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:07:47,613 INFO L82 PathProgramCache]: Analyzing trace with hash 139293804, now seen corresponding path program 1 times [2019-12-07 22:07:47,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:07:47,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380910359] [2019-12-07 22:07:47,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:07:47,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:07:47,681 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-12-07 22:07:47,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380910359] [2019-12-07 22:07:47,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:07:47,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 22:07:47,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421724442] [2019-12-07 22:07:47,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 22:07:47,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:07:47,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 22:07:47,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 22:07:47,682 INFO L87 Difference]: Start difference. First operand 9441 states and 12151 transitions. Second operand 4 states. [2019-12-07 22:07:48,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:07:48,505 INFO L93 Difference]: Finished difference Result 26891 states and 35089 transitions. [2019-12-07 22:07:48,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 22:07:48,506 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 208 [2019-12-07 22:07:48,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:07:48,526 INFO L225 Difference]: With dead ends: 26891 [2019-12-07 22:07:48,527 INFO L226 Difference]: Without dead ends: 17451 [2019-12-07 22:07:48,534 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 22:07:48,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17451 states. [2019-12-07 22:07:48,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17451 to 13159. [2019-12-07 22:07:48,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13159 states. [2019-12-07 22:07:48,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13159 states to 13159 states and 16570 transitions. [2019-12-07 22:07:48,664 INFO L78 Accepts]: Start accepts. Automaton has 13159 states and 16570 transitions. Word has length 208 [2019-12-07 22:07:48,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:07:48,664 INFO L462 AbstractCegarLoop]: Abstraction has 13159 states and 16570 transitions. [2019-12-07 22:07:48,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 22:07:48,664 INFO L276 IsEmpty]: Start isEmpty. Operand 13159 states and 16570 transitions. [2019-12-07 22:07:48,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-12-07 22:07:48,676 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:07:48,676 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:07:48,676 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:07:48,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:07:48,676 INFO L82 PathProgramCache]: Analyzing trace with hash -491400665, now seen corresponding path program 1 times [2019-12-07 22:07:48,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:07:48,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566123171] [2019-12-07 22:07:48,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:07:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:07:48,775 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 22:07:48,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566123171] [2019-12-07 22:07:48,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994950976] [2019-12-07 22:07:48,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_524b1995-3e3e-48c2-a22a-6cc448e9c43c/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 22:07:48,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:07:48,868 INFO L264 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 22:07:48,871 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:07:48,908 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 22:07:48,908 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:07:48,939 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 22:07:48,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 22:07:48,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-12-07 22:07:48,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916144359] [2019-12-07 22:07:48,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 22:07:48,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:07:48,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 22:07:48,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 22:07:48,941 INFO L87 Difference]: Start difference. First operand 13159 states and 16570 transitions. Second operand 3 states. [2019-12-07 22:07:49,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:07:49,514 INFO L93 Difference]: Finished difference Result 32180 states and 40374 transitions. [2019-12-07 22:07:49,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 22:07:49,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2019-12-07 22:07:49,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:07:49,545 INFO L225 Difference]: With dead ends: 32180 [2019-12-07 22:07:49,545 INFO L226 Difference]: Without dead ends: 19022 [2019-12-07 22:07:49,554 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 22:07:49,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19022 states. [2019-12-07 22:07:49,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19022 to 19022. [2019-12-07 22:07:49,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19022 states. [2019-12-07 22:07:49,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19022 states to 19022 states and 23551 transitions. [2019-12-07 22:07:49,711 INFO L78 Accepts]: Start accepts. Automaton has 19022 states and 23551 transitions. Word has length 213 [2019-12-07 22:07:49,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:07:49,711 INFO L462 AbstractCegarLoop]: Abstraction has 19022 states and 23551 transitions. [2019-12-07 22:07:49,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 22:07:49,711 INFO L276 IsEmpty]: Start isEmpty. Operand 19022 states and 23551 transitions. [2019-12-07 22:07:49,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-12-07 22:07:49,725 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:07:49,726 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:07:49,926 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 22:07:49,927 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:07:49,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:07:49,927 INFO L82 PathProgramCache]: Analyzing trace with hash -82787674, now seen corresponding path program 1 times [2019-12-07 22:07:49,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:07:49,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010442781] [2019-12-07 22:07:49,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:07:49,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:07:50,053 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 86 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-12-07 22:07:50,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010442781] [2019-12-07 22:07:50,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922015561] [2019-12-07 22:07:50,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_524b1995-3e3e-48c2-a22a-6cc448e9c43c/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 22:07:50,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:07:50,159 INFO L264 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 22:07:50,162 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:07:50,190 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 22:07:50,190 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:07:50,217 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 22:07:50,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 22:07:50,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-12-07 22:07:50,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296978624] [2019-12-07 22:07:50,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 22:07:50,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:07:50,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 22:07:50,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 22:07:50,218 INFO L87 Difference]: Start difference. First operand 19022 states and 23551 transitions. Second operand 3 states. [2019-12-07 22:07:50,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:07:50,788 INFO L93 Difference]: Finished difference Result 40188 states and 49715 transitions. [2019-12-07 22:07:50,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 22:07:50,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 221 [2019-12-07 22:07:50,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:07:50,807 INFO L225 Difference]: With dead ends: 40188 [2019-12-07 22:07:50,807 INFO L226 Difference]: Without dead ends: 21167 [2019-12-07 22:07:50,822 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 440 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 22:07:50,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21167 states. [2019-12-07 22:07:51,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21167 to 20309. [2019-12-07 22:07:51,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20309 states. [2019-12-07 22:07:51,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20309 states to 20309 states and 24553 transitions. [2019-12-07 22:07:51,026 INFO L78 Accepts]: Start accepts. Automaton has 20309 states and 24553 transitions. Word has length 221 [2019-12-07 22:07:51,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:07:51,027 INFO L462 AbstractCegarLoop]: Abstraction has 20309 states and 24553 transitions. [2019-12-07 22:07:51,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 22:07:51,027 INFO L276 IsEmpty]: Start isEmpty. Operand 20309 states and 24553 transitions. [2019-12-07 22:07:51,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-12-07 22:07:51,042 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:07:51,042 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 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 22:07:51,243 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 22:07:51,243 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:07:51,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:07:51,244 INFO L82 PathProgramCache]: Analyzing trace with hash -2012265684, now seen corresponding path program 1 times [2019-12-07 22:07:51,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:07:51,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451247755] [2019-12-07 22:07:51,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:07:51,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:07:51,313 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-12-07 22:07:51,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451247755] [2019-12-07 22:07:51,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:07:51,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 22:07:51,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765401261] [2019-12-07 22:07:51,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 22:07:51,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:07:51,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 22:07:51,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 22:07:51,315 INFO L87 Difference]: Start difference. First operand 20309 states and 24553 transitions. Second operand 3 states. [2019-12-07 22:07:51,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:07:51,661 INFO L93 Difference]: Finished difference Result 35755 states and 42843 transitions. [2019-12-07 22:07:51,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 22:07:51,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 234 [2019-12-07 22:07:51,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:07:51,675 INFO L225 Difference]: With dead ends: 35755 [2019-12-07 22:07:51,675 INFO L226 Difference]: Without dead ends: 15447 [2019-12-07 22:07:51,684 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 22:07:51,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15447 states. [2019-12-07 22:07:51,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15447 to 14017. [2019-12-07 22:07:51,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14017 states. [2019-12-07 22:07:51,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14017 states to 14017 states and 16493 transitions. [2019-12-07 22:07:51,804 INFO L78 Accepts]: Start accepts. Automaton has 14017 states and 16493 transitions. Word has length 234 [2019-12-07 22:07:51,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:07:51,804 INFO L462 AbstractCegarLoop]: Abstraction has 14017 states and 16493 transitions. [2019-12-07 22:07:51,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 22:07:51,805 INFO L276 IsEmpty]: Start isEmpty. Operand 14017 states and 16493 transitions. [2019-12-07 22:07:51,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-12-07 22:07:51,813 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:07:51,814 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 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, 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] [2019-12-07 22:07:51,814 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:07:51,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:07:51,814 INFO L82 PathProgramCache]: Analyzing trace with hash -565710051, now seen corresponding path program 1 times [2019-12-07 22:07:51,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:07:51,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479650775] [2019-12-07 22:07:51,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:07:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:07:52,023 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 22:07:52,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479650775] [2019-12-07 22:07:52,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 22:07:52,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 22:07:52,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686346935] [2019-12-07 22:07:52,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 22:07:52,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:07:52,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 22:07:52,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 22:07:52,024 INFO L87 Difference]: Start difference. First operand 14017 states and 16493 transitions. Second operand 5 states. [2019-12-07 22:07:52,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:07:52,683 INFO L93 Difference]: Finished difference Result 40476 states and 47407 transitions. [2019-12-07 22:07:52,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 22:07:52,684 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 292 [2019-12-07 22:07:52,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:07:52,702 INFO L225 Difference]: With dead ends: 40476 [2019-12-07 22:07:52,702 INFO L226 Difference]: Without dead ends: 26460 [2019-12-07 22:07:52,709 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 22:07:52,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26460 states. [2019-12-07 22:07:52,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26460 to 26458. [2019-12-07 22:07:52,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26458 states. [2019-12-07 22:07:52,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26458 states to 26458 states and 30892 transitions. [2019-12-07 22:07:52,930 INFO L78 Accepts]: Start accepts. Automaton has 26458 states and 30892 transitions. Word has length 292 [2019-12-07 22:07:52,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:07:52,930 INFO L462 AbstractCegarLoop]: Abstraction has 26458 states and 30892 transitions. [2019-12-07 22:07:52,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 22:07:52,930 INFO L276 IsEmpty]: Start isEmpty. Operand 26458 states and 30892 transitions. [2019-12-07 22:07:52,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2019-12-07 22:07:52,949 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 22:07:52,949 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 22:07:52,949 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 22:07:52,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 22:07:52,950 INFO L82 PathProgramCache]: Analyzing trace with hash 38909209, now seen corresponding path program 1 times [2019-12-07 22:07:52,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 22:07:52,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546668092] [2019-12-07 22:07:52,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 22:07:52,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:07:53,086 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 141 proven. 3 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-12-07 22:07:53,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546668092] [2019-12-07 22:07:53,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961201593] [2019-12-07 22:07:53,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_524b1995-3e3e-48c2-a22a-6cc448e9c43c/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 22:07:53,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 22:07:53,196 INFO L264 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 22:07:53,199 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 22:07:53,273 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 22:07:53,273 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 22:07:53,336 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 22:07:53,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 22:07:53,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 6 [2019-12-07 22:07:53,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336016058] [2019-12-07 22:07:53,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 22:07:53,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 22:07:53,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 22:07:53,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 22:07:53,338 INFO L87 Difference]: Start difference. First operand 26458 states and 30892 transitions. Second operand 3 states. [2019-12-07 22:07:54,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 22:07:54,279 INFO L93 Difference]: Finished difference Result 55344 states and 64639 transitions. [2019-12-07 22:07:54,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 22:07:54,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 323 [2019-12-07 22:07:54,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 22:07:54,280 INFO L225 Difference]: With dead ends: 55344 [2019-12-07 22:07:54,280 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 22:07:54,297 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 648 GetRequests, 643 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 22:07:54,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 22:07:54,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 22:07:54,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 22:07:54,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 22:07:54,297 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 323 [2019-12-07 22:07:54,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 22:07:54,298 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 22:07:54,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 22:07:54,298 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 22:07:54,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 22:07:54,498 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 22:07:54,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 22:07:54,813 WARN L192 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 415 DAG size of output: 170 [2019-12-07 22:07:55,084 WARN L192 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 415 DAG size of output: 170 [2019-12-07 22:07:55,435 WARN L192 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 31 [2019-12-07 22:07:55,769 WARN L192 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 31 [2019-12-07 22:07:55,771 INFO L246 CegarLoopResult]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,771 INFO L246 CegarLoopResult]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,771 INFO L246 CegarLoopResult]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,771 INFO L246 CegarLoopResult]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,771 INFO L246 CegarLoopResult]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,771 INFO L246 CegarLoopResult]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,771 INFO L246 CegarLoopResult]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,771 INFO L246 CegarLoopResult]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,771 INFO L246 CegarLoopResult]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,771 INFO L246 CegarLoopResult]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,771 INFO L246 CegarLoopResult]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,772 INFO L246 CegarLoopResult]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,772 INFO L246 CegarLoopResult]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,772 INFO L246 CegarLoopResult]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,772 INFO L246 CegarLoopResult]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,772 INFO L246 CegarLoopResult]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,772 INFO L246 CegarLoopResult]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,772 INFO L246 CegarLoopResult]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,772 INFO L246 CegarLoopResult]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,772 INFO L246 CegarLoopResult]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,772 INFO L246 CegarLoopResult]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,772 INFO L246 CegarLoopResult]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,772 INFO L246 CegarLoopResult]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,772 INFO L246 CegarLoopResult]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,772 INFO L246 CegarLoopResult]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,772 INFO L246 CegarLoopResult]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,772 INFO L246 CegarLoopResult]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,772 INFO L246 CegarLoopResult]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,772 INFO L246 CegarLoopResult]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,772 INFO L246 CegarLoopResult]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,772 INFO L246 CegarLoopResult]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,773 INFO L246 CegarLoopResult]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,773 INFO L246 CegarLoopResult]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,773 INFO L246 CegarLoopResult]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,773 INFO L246 CegarLoopResult]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,773 INFO L246 CegarLoopResult]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,773 INFO L246 CegarLoopResult]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,773 INFO L246 CegarLoopResult]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,773 INFO L246 CegarLoopResult]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,773 INFO L246 CegarLoopResult]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,773 INFO L246 CegarLoopResult]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,773 INFO L246 CegarLoopResult]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,773 INFO L246 CegarLoopResult]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,773 INFO L246 CegarLoopResult]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,773 INFO L246 CegarLoopResult]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,773 INFO L246 CegarLoopResult]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,773 INFO L246 CegarLoopResult]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,773 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 22:07:55,773 INFO L246 CegarLoopResult]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,773 INFO L246 CegarLoopResult]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,773 INFO L246 CegarLoopResult]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,774 INFO L246 CegarLoopResult]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,774 INFO L246 CegarLoopResult]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,774 INFO L246 CegarLoopResult]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,774 INFO L246 CegarLoopResult]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,774 INFO L246 CegarLoopResult]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,774 INFO L246 CegarLoopResult]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,774 INFO L246 CegarLoopResult]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,774 INFO L246 CegarLoopResult]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,774 INFO L246 CegarLoopResult]: For program point L1580-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 22:07:55,774 INFO L246 CegarLoopResult]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,774 INFO L246 CegarLoopResult]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,774 INFO L246 CegarLoopResult]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,774 INFO L242 CegarLoopResult]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse1 (not (= ~a12~0 1))) (.cse4 (= ~a26~0 1)) (.cse5 (= ~a27~0 1)) (.cse0 (= 1 ~a5~0)) (.cse3 (= 1 ~a6~0)) (.cse2 (= ~a11~0 1))) (or (and .cse0 (not (= 1 ~a3~0))) (and .cse0 .cse1 .cse2 (not .cse3) .cse4) (and .cse5 .cse0 .cse1) (and .cse0 (<= ~a27~0 0)) (and .cse0 .cse3 .cse1 (not .cse2) .cse4) (and .cse0 .cse5 .cse4) (and .cse5 .cse0 .cse3 .cse2))) [2019-12-07 22:07:55,775 INFO L246 CegarLoopResult]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,775 INFO L246 CegarLoopResult]: For program point L1583-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 22:07:55,775 INFO L246 CegarLoopResult]: For program point L1584(line 1584) no Hoare annotation was computed. [2019-12-07 22:07:55,775 INFO L246 CegarLoopResult]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,775 INFO L246 CegarLoopResult]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,775 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1584) no Hoare annotation was computed. [2019-12-07 22:07:55,775 INFO L246 CegarLoopResult]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,775 INFO L249 CegarLoopResult]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-12-07 22:07:55,775 INFO L246 CegarLoopResult]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,775 INFO L246 CegarLoopResult]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,775 INFO L246 CegarLoopResult]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,775 INFO L246 CegarLoopResult]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,775 INFO L246 CegarLoopResult]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,775 INFO L246 CegarLoopResult]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,775 INFO L246 CegarLoopResult]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,775 INFO L246 CegarLoopResult]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,775 INFO L246 CegarLoopResult]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,775 INFO L246 CegarLoopResult]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,776 INFO L246 CegarLoopResult]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,776 INFO L246 CegarLoopResult]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,776 INFO L246 CegarLoopResult]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,776 INFO L246 CegarLoopResult]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,776 INFO L242 CegarLoopResult]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse1 (not (= ~a12~0 1))) (.cse4 (= ~a26~0 1)) (.cse5 (= ~a27~0 1)) (.cse0 (= 1 ~a5~0)) (.cse3 (= 1 ~a6~0)) (.cse2 (= ~a11~0 1))) (or (and .cse0 (not (= 1 ~a3~0))) (and .cse0 .cse1 .cse2 (not .cse3) .cse4) (and .cse5 .cse0 .cse1) (and .cse0 (<= ~a27~0 0)) (and .cse0 .cse3 .cse1 (not .cse2) .cse4) (and .cse0 .cse5 .cse4) (and .cse5 .cse0 .cse3 .cse2))) [2019-12-07 22:07:55,776 INFO L246 CegarLoopResult]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,776 INFO L246 CegarLoopResult]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,776 INFO L246 CegarLoopResult]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,776 INFO L246 CegarLoopResult]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,776 INFO L246 CegarLoopResult]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,776 INFO L246 CegarLoopResult]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,776 INFO L246 CegarLoopResult]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,777 INFO L246 CegarLoopResult]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,777 INFO L246 CegarLoopResult]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,777 INFO L246 CegarLoopResult]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,777 INFO L246 CegarLoopResult]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,777 INFO L246 CegarLoopResult]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-12-07 22:07:55,777 INFO L246 CegarLoopResult]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,777 INFO L246 CegarLoopResult]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,777 INFO L246 CegarLoopResult]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,777 INFO L246 CegarLoopResult]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,777 INFO L246 CegarLoopResult]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,777 INFO L246 CegarLoopResult]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,777 INFO L246 CegarLoopResult]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,777 INFO L246 CegarLoopResult]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,777 INFO L246 CegarLoopResult]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,777 INFO L246 CegarLoopResult]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,777 INFO L246 CegarLoopResult]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,777 INFO L246 CegarLoopResult]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,777 INFO L246 CegarLoopResult]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,777 INFO L246 CegarLoopResult]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,778 INFO L246 CegarLoopResult]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,778 INFO L246 CegarLoopResult]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,778 INFO L246 CegarLoopResult]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,778 INFO L246 CegarLoopResult]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,778 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 22:07:55,778 INFO L246 CegarLoopResult]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,778 INFO L246 CegarLoopResult]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,778 INFO L246 CegarLoopResult]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,778 INFO L246 CegarLoopResult]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,778 INFO L246 CegarLoopResult]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,778 INFO L246 CegarLoopResult]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,778 INFO L246 CegarLoopResult]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,778 INFO L246 CegarLoopResult]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,778 INFO L246 CegarLoopResult]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,778 INFO L246 CegarLoopResult]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,778 INFO L246 CegarLoopResult]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,778 INFO L246 CegarLoopResult]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,778 INFO L246 CegarLoopResult]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,778 INFO L246 CegarLoopResult]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,778 INFO L246 CegarLoopResult]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,779 INFO L246 CegarLoopResult]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,779 INFO L246 CegarLoopResult]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,779 INFO L246 CegarLoopResult]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,779 INFO L246 CegarLoopResult]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,779 INFO L246 CegarLoopResult]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,779 INFO L246 CegarLoopResult]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,779 INFO L246 CegarLoopResult]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,779 INFO L246 CegarLoopResult]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,779 INFO L246 CegarLoopResult]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,779 INFO L246 CegarLoopResult]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,779 INFO L246 CegarLoopResult]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,779 INFO L246 CegarLoopResult]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,779 INFO L246 CegarLoopResult]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,779 INFO L246 CegarLoopResult]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,779 INFO L246 CegarLoopResult]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-12-07 22:07:55,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:07:55 BoogieIcfgContainer [2019-12-07 22:07:55,797 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 22:07:55,798 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 22:07:55,798 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 22:07:55,798 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 22:07:55,798 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:39" (3/4) ... [2019-12-07 22:07:55,801 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 22:07:55,829 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 114 nodes and edges [2019-12-07 22:07:55,832 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2019-12-07 22:07:55,834 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2019-12-07 22:07:55,837 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 22:07:55,979 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_524b1995-3e3e-48c2-a22a-6cc448e9c43c/bin/utaipan/witness.graphml [2019-12-07 22:07:55,979 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 22:07:55,980 INFO L168 Benchmark]: Toolchain (without parser) took 18493.12 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 807.9 MB). Free memory was 931.7 MB in the beginning and 957.6 MB in the end (delta: -25.8 MB). Peak memory consumption was 782.1 MB. Max. memory is 11.5 GB. [2019-12-07 22:07:55,980 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 22:07:55,981 INFO L168 Benchmark]: CACSL2BoogieTranslator took 587.02 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.7 MB). Free memory was 931.7 MB in the beginning and 1.0 GB in the end (delta: -88.2 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. [2019-12-07 22:07:55,981 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 22:07:55,981 INFO L168 Benchmark]: Boogie Preprocessor took 67.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 998.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 22:07:55,981 INFO L168 Benchmark]: RCFGBuilder took 1756.95 ms. Allocated memory is still 1.1 GB. Free memory was 998.5 MB in the beginning and 810.2 MB in the end (delta: 188.3 MB). Peak memory consumption was 198.1 MB. Max. memory is 11.5 GB. [2019-12-07 22:07:55,982 INFO L168 Benchmark]: TraceAbstraction took 15816.54 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 718.3 MB). Free memory was 810.2 MB in the beginning and 1.0 GB in the end (delta: -209.3 MB). Peak memory consumption was 509.0 MB. Max. memory is 11.5 GB. [2019-12-07 22:07:55,982 INFO L168 Benchmark]: Witness Printer took 181.38 ms. Allocated memory is still 1.8 GB. Free memory was 1.0 GB in the beginning and 957.6 MB in the end (delta: 62.0 MB). Peak memory consumption was 62.0 MB. Max. memory is 11.5 GB. [2019-12-07 22:07:55,984 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 587.02 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.7 MB). Free memory was 931.7 MB in the beginning and 1.0 GB in the end (delta: -88.2 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 80.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 67.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 998.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1756.95 ms. Allocated memory is still 1.1 GB. Free memory was 998.5 MB in the beginning and 810.2 MB in the end (delta: 188.3 MB). Peak memory consumption was 198.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15816.54 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 718.3 MB). Free memory was 810.2 MB in the beginning and 1.0 GB in the end (delta: -209.3 MB). Peak memory consumption was 509.0 MB. Max. memory is 11.5 GB. * Witness Printer took 181.38 ms. Allocated memory is still 1.8 GB. Free memory was 1.0 GB in the beginning and 957.6 MB in the end (delta: 62.0 MB). Peak memory consumption was 62.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1584]: 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: 1652]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1658]: Loop Invariant Derived loop invariant: ((((((1 == a5 && !(1 == a3)) || ((((1 == a5 && !(a12 == 1)) && a11 == 1) && !(1 == a6)) && a26 == 1)) || ((a27 == 1 && 1 == a5) && !(a12 == 1))) || (1 == a5 && a27 <= 0)) || ((((1 == a5 && 1 == a6) && !(a12 == 1)) && !(a11 == 1)) && a26 == 1)) || ((1 == a5 && a27 == 1) && a26 == 1)) || (((a27 == 1 && 1 == a5) && 1 == a6) && a11 == 1) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: ((((((1 == a5 && !(1 == a3)) || ((((1 == a5 && !(a12 == 1)) && a11 == 1) && !(1 == a6)) && a26 == 1)) || ((a27 == 1 && 1 == a5) && !(a12 == 1))) || (1 == a5 && a27 <= 0)) || ((((1 == a5 && 1 == a6) && !(a12 == 1)) && !(a11 == 1)) && a26 == 1)) || ((1 == a5 && a27 == 1) && a26 == 1)) || (((a27 == 1 && 1 == a5) && 1 == a6) && a11 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 1 error locations. Result: SAFE, OverallTime: 14.4s, OverallIterations: 13, TraceHistogramMax: 5, AutomataDifference: 9.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.2s, HoareTripleCheckerStatistics: 1579 SDtfs, 2600 SDslu, 93 SDs, 0 SdLazy, 7702 SolverSat, 1653 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1936 GetRequests, 1898 SyntacticMatches, 6 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26458occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 9442 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 394 NumberOfFragments, 173 HoareAnnotationTreeSize, 3 FomulaSimplifications, 20466 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 3 FomulaSimplificationsInter, 7394 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 3624 NumberOfCodeBlocks, 3624 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 4551 ConstructedInterpolants, 0 QuantifiedInterpolants, 2630551 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1906 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 21 InterpolantComputations, 17 PerfectInterpolantSequences, 2069/2081 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...