./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label29.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_7bc6d995-f125-485e-94cf-8f136cf71b14/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7bc6d995-f125-485e-94cf-8f136cf71b14/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7bc6d995-f125-485e-94cf-8f136cf71b14/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7bc6d995-f125-485e-94cf-8f136cf71b14/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label29.c -s /tmp/vcloud-vcloud-master/worker/run_dir_7bc6d995-f125-485e-94cf-8f136cf71b14/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7bc6d995-f125-485e-94cf-8f136cf71b14/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3449156d5b203ef4b6a1a68bea9e5efb1d4b37b1 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 18:22:42,995 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:22:42,996 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:22:43,004 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:22:43,004 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:22:43,005 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:22:43,006 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:22:43,007 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:22:43,008 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:22:43,009 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:22:43,010 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:22:43,010 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:22:43,011 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:22:43,011 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:22:43,012 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:22:43,013 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:22:43,013 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:22:43,014 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:22:43,015 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:22:43,017 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:22:43,018 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:22:43,018 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:22:43,019 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:22:43,019 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:22:43,021 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:22:43,021 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:22:43,021 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:22:43,022 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:22:43,022 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:22:43,023 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:22:43,023 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:22:43,023 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:22:43,023 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:22:43,024 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:22:43,024 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:22:43,025 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:22:43,025 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:22:43,025 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:22:43,025 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:22:43,026 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:22:43,026 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:22:43,027 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7bc6d995-f125-485e-94cf-8f136cf71b14/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:22:43,036 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:22:43,036 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:22:43,037 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:22:43,037 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:22:43,037 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:22:43,037 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:22:43,038 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:22:43,038 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:22:43,038 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:22:43,038 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:22:43,038 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:22:43,038 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:22:43,038 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:22:43,038 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:22:43,039 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:22:43,039 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:22:43,039 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:22:43,039 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:22:43,039 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:22:43,039 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:22:43,039 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:22:43,040 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:22:43,040 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:22:43,040 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:22:43,040 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:22:43,040 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:22:43,040 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:22:43,040 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:22:43,040 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:22:43,041 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_7bc6d995-f125-485e-94cf-8f136cf71b14/bin/uautomizer 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 -> Automizer 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 -> 3449156d5b203ef4b6a1a68bea9e5efb1d4b37b1 [2019-12-07 18:22:43,140 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:22:43,147 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:22:43,150 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:22:43,151 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:22:43,151 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:22:43,152 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7bc6d995-f125-485e-94cf-8f136cf71b14/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem01_label29.c [2019-12-07 18:22:43,190 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7bc6d995-f125-485e-94cf-8f136cf71b14/bin/uautomizer/data/870ca5637/10dcfc69f20444d6ac2470e11cdb4a42/FLAGd2f6c9f56 [2019-12-07 18:22:43,640 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:22:43,641 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7bc6d995-f125-485e-94cf-8f136cf71b14/sv-benchmarks/c/eca-rers2012/Problem01_label29.c [2019-12-07 18:22:43,650 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7bc6d995-f125-485e-94cf-8f136cf71b14/bin/uautomizer/data/870ca5637/10dcfc69f20444d6ac2470e11cdb4a42/FLAGd2f6c9f56 [2019-12-07 18:22:43,658 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7bc6d995-f125-485e-94cf-8f136cf71b14/bin/uautomizer/data/870ca5637/10dcfc69f20444d6ac2470e11cdb4a42 [2019-12-07 18:22:43,660 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:22:43,661 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:22:43,662 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:22:43,662 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:22:43,665 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:22:43,665 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:22:43" (1/1) ... [2019-12-07 18:22:43,668 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62c1cac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:43, skipping insertion in model container [2019-12-07 18:22:43,668 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:22:43" (1/1) ... [2019-12-07 18:22:43,675 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:22:43,714 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:22:43,977 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:22:43,980 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:22:44,032 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:22:44,043 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:22:44,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:44 WrapperNode [2019-12-07 18:22:44,043 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:22:44,044 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:22:44,044 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:22:44,044 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:22:44,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:44" (1/1) ... [2019-12-07 18:22:44,062 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:44" (1/1) ... [2019-12-07 18:22:44,097 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:22:44,098 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:22:44,098 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:22:44,098 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:22:44,104 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:44" (1/1) ... [2019-12-07 18:22:44,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:44" (1/1) ... [2019-12-07 18:22:44,107 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:44" (1/1) ... [2019-12-07 18:22:44,107 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:44" (1/1) ... [2019-12-07 18:22:44,121 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:44" (1/1) ... [2019-12-07 18:22:44,129 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:44" (1/1) ... [2019-12-07 18:22:44,133 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:44" (1/1) ... [2019-12-07 18:22:44,139 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:22:44,139 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:22:44,139 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:22:44,139 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:22:44,140 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7bc6d995-f125-485e-94cf-8f136cf71b14/bin/uautomizer/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 18:22:44,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:22:44,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:22:44,788 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:22:44,788 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 18:22:44,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:22:44 BoogieIcfgContainer [2019-12-07 18:22:44,789 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:22:44,790 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:22:44,790 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:22:44,792 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:22:44,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:22:43" (1/3) ... [2019-12-07 18:22:44,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e8f985b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:22:44, skipping insertion in model container [2019-12-07 18:22:44,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:22:44" (2/3) ... [2019-12-07 18:22:44,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e8f985b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:22:44, skipping insertion in model container [2019-12-07 18:22:44,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:22:44" (3/3) ... [2019-12-07 18:22:44,795 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label29.c [2019-12-07 18:22:44,804 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:22:44,810 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 18:22:44,818 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 18:22:44,838 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:22:44,838 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:22:44,838 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:22:44,838 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:22:44,838 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:22:44,839 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:22:44,839 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:22:44,839 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:22:44,855 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-12-07 18:22:44,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-07 18:22:44,863 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:44,864 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] [2019-12-07 18:22:44,864 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:22:44,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:44,868 INFO L82 PathProgramCache]: Analyzing trace with hash 620620582, now seen corresponding path program 1 times [2019-12-07 18:22:44,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:44,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963002688] [2019-12-07 18:22:44,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:45,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:45,159 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 18:22:45,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963002688] [2019-12-07 18:22:45,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:45,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:22:45,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548530011] [2019-12-07 18:22:45,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:22:45,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:45,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:22:45,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:22:45,177 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-12-07 18:22:45,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:45,841 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2019-12-07 18:22:45,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:22:45,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-12-07 18:22:45,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:45,854 INFO L225 Difference]: With dead ends: 662 [2019-12-07 18:22:45,854 INFO L226 Difference]: Without dead ends: 397 [2019-12-07 18:22:45,857 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 18:22:45,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-12-07 18:22:45,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2019-12-07 18:22:45,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-12-07 18:22:45,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 553 transitions. [2019-12-07 18:22:45,900 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 553 transitions. Word has length 101 [2019-12-07 18:22:45,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:45,900 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 553 transitions. [2019-12-07 18:22:45,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:22:45,900 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 553 transitions. [2019-12-07 18:22:45,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-12-07 18:22:45,904 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:45,904 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:22:45,904 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:22:45,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:45,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1432944013, now seen corresponding path program 1 times [2019-12-07 18:22:45,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:45,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651027893] [2019-12-07 18:22:45,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:46,002 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:46,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651027893] [2019-12-07 18:22:46,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:46,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:22:46,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052592902] [2019-12-07 18:22:46,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:22:46,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:46,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:22:46,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:22:46,006 INFO L87 Difference]: Start difference. First operand 397 states and 553 transitions. Second operand 4 states. [2019-12-07 18:22:46,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:46,491 INFO L93 Difference]: Finished difference Result 1447 states and 2019 transitions. [2019-12-07 18:22:46,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:22:46,491 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-12-07 18:22:46,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:46,496 INFO L225 Difference]: With dead ends: 1447 [2019-12-07 18:22:46,496 INFO L226 Difference]: Without dead ends: 1052 [2019-12-07 18:22:46,498 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 18:22:46,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2019-12-07 18:22:46,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 659. [2019-12-07 18:22:46,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-12-07 18:22:46,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 851 transitions. [2019-12-07 18:22:46,526 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 851 transitions. Word has length 108 [2019-12-07 18:22:46,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:46,526 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 851 transitions. [2019-12-07 18:22:46,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:22:46,527 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 851 transitions. [2019-12-07 18:22:46,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-07 18:22:46,529 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:46,529 INFO L410 BasicCegarLoop]: trace histogram [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 18:22:46,529 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:22:46,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:46,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1541134986, now seen corresponding path program 1 times [2019-12-07 18:22:46,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:46,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037156695] [2019-12-07 18:22:46,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:46,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:46,584 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:46,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037156695] [2019-12-07 18:22:46,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:46,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:22:46,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226614061] [2019-12-07 18:22:46,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:22:46,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:46,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:22:46,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:22:46,586 INFO L87 Difference]: Start difference. First operand 659 states and 851 transitions. Second operand 4 states. [2019-12-07 18:22:47,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:47,052 INFO L93 Difference]: Finished difference Result 1578 states and 1998 transitions. [2019-12-07 18:22:47,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:22:47,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-12-07 18:22:47,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:47,057 INFO L225 Difference]: With dead ends: 1578 [2019-12-07 18:22:47,057 INFO L226 Difference]: Without dead ends: 790 [2019-12-07 18:22:47,059 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 18:22:47,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-12-07 18:22:47,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-12-07 18:22:47,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-12-07 18:22:47,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 930 transitions. [2019-12-07 18:22:47,076 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 930 transitions. Word has length 122 [2019-12-07 18:22:47,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:47,076 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 930 transitions. [2019-12-07 18:22:47,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:22:47,076 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 930 transitions. [2019-12-07 18:22:47,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-12-07 18:22:47,079 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:47,079 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:22:47,079 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:22:47,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:47,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1660180891, now seen corresponding path program 1 times [2019-12-07 18:22:47,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:47,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894516110] [2019-12-07 18:22:47,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:47,118 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:47,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894516110] [2019-12-07 18:22:47,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:47,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:22:47,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717184667] [2019-12-07 18:22:47,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:22:47,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:47,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:22:47,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:22:47,120 INFO L87 Difference]: Start difference. First operand 790 states and 930 transitions. Second operand 3 states. [2019-12-07 18:22:47,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:47,427 INFO L93 Difference]: Finished difference Result 2233 states and 2643 transitions. [2019-12-07 18:22:47,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:22:47,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-12-07 18:22:47,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:47,432 INFO L225 Difference]: With dead ends: 2233 [2019-12-07 18:22:47,432 INFO L226 Difference]: Without dead ends: 1445 [2019-12-07 18:22:47,434 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 18:22:47,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-12-07 18:22:47,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1183. [2019-12-07 18:22:47,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-12-07 18:22:47,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1373 transitions. [2019-12-07 18:22:47,453 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1373 transitions. Word has length 123 [2019-12-07 18:22:47,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:47,454 INFO L462 AbstractCegarLoop]: Abstraction has 1183 states and 1373 transitions. [2019-12-07 18:22:47,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:22:47,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1373 transitions. [2019-12-07 18:22:47,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-12-07 18:22:47,455 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:47,456 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-12-07 18:22:47,456 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:22:47,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:47,456 INFO L82 PathProgramCache]: Analyzing trace with hash -767786909, now seen corresponding path program 1 times [2019-12-07 18:22:47,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:47,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590315849] [2019-12-07 18:22:47,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:47,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:47,501 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 18:22:47,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590315849] [2019-12-07 18:22:47,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:47,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:22:47,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54211660] [2019-12-07 18:22:47,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:22:47,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:47,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:22:47,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:22:47,503 INFO L87 Difference]: Start difference. First operand 1183 states and 1373 transitions. Second operand 3 states. [2019-12-07 18:22:47,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:47,836 INFO L93 Difference]: Finished difference Result 3150 states and 3672 transitions. [2019-12-07 18:22:47,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:22:47,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-12-07 18:22:47,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:47,845 INFO L225 Difference]: With dead ends: 3150 [2019-12-07 18:22:47,845 INFO L226 Difference]: Without dead ends: 1969 [2019-12-07 18:22:47,847 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 18:22:47,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-12-07 18:22:47,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1576. [2019-12-07 18:22:47,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-12-07 18:22:47,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1841 transitions. [2019-12-07 18:22:47,883 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1841 transitions. Word has length 127 [2019-12-07 18:22:47,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:47,883 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 1841 transitions. [2019-12-07 18:22:47,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:22:47,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1841 transitions. [2019-12-07 18:22:47,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-12-07 18:22:47,885 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:47,885 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:22:47,885 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:22:47,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:47,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1109954633, now seen corresponding path program 1 times [2019-12-07 18:22:47,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:47,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516920559] [2019-12-07 18:22:47,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:47,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:47,922 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 18:22:47,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516920559] [2019-12-07 18:22:47,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:47,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:22:47,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389417731] [2019-12-07 18:22:47,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:22:47,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:47,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:22:47,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:22:47,923 INFO L87 Difference]: Start difference. First operand 1576 states and 1841 transitions. Second operand 3 states. [2019-12-07 18:22:48,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:48,217 INFO L93 Difference]: Finished difference Result 3281 states and 3832 transitions. [2019-12-07 18:22:48,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:22:48,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-12-07 18:22:48,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:48,223 INFO L225 Difference]: With dead ends: 3281 [2019-12-07 18:22:48,224 INFO L226 Difference]: Without dead ends: 1707 [2019-12-07 18:22:48,225 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 18:22:48,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-12-07 18:22:48,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1576. [2019-12-07 18:22:48,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-12-07 18:22:48,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1841 transitions. [2019-12-07 18:22:48,249 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1841 transitions. Word has length 129 [2019-12-07 18:22:48,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:48,249 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 1841 transitions. [2019-12-07 18:22:48,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:22:48,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1841 transitions. [2019-12-07 18:22:48,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-12-07 18:22:48,251 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:48,251 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:22:48,251 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:22:48,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:48,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1564517898, now seen corresponding path program 1 times [2019-12-07 18:22:48,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:48,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818279721] [2019-12-07 18:22:48,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:48,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:48,288 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:48,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818279721] [2019-12-07 18:22:48,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:48,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:22:48,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46622288] [2019-12-07 18:22:48,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:22:48,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:48,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:22:48,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:22:48,290 INFO L87 Difference]: Start difference. First operand 1576 states and 1841 transitions. Second operand 3 states. [2019-12-07 18:22:48,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:48,555 INFO L93 Difference]: Finished difference Result 3543 states and 4110 transitions. [2019-12-07 18:22:48,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:22:48,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-12-07 18:22:48,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:48,565 INFO L225 Difference]: With dead ends: 3543 [2019-12-07 18:22:48,565 INFO L226 Difference]: Without dead ends: 1969 [2019-12-07 18:22:48,567 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 18:22:48,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-12-07 18:22:48,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838. [2019-12-07 18:22:48,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-12-07 18:22:48,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2124 transitions. [2019-12-07 18:22:48,597 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2124 transitions. Word has length 130 [2019-12-07 18:22:48,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:48,597 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2124 transitions. [2019-12-07 18:22:48,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:22:48,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2124 transitions. [2019-12-07 18:22:48,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-12-07 18:22:48,600 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:48,600 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:22:48,600 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:22:48,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:48,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1099746882, now seen corresponding path program 1 times [2019-12-07 18:22:48,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:48,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679721896] [2019-12-07 18:22:48,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:48,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:48,728 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:48,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679721896] [2019-12-07 18:22:48,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:48,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 18:22:48,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837981563] [2019-12-07 18:22:48,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:22:48,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:48,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:22:48,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:22:48,729 INFO L87 Difference]: Start difference. First operand 1838 states and 2124 transitions. Second operand 8 states. [2019-12-07 18:22:49,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:49,398 INFO L93 Difference]: Finished difference Result 3847 states and 4438 transitions. [2019-12-07 18:22:49,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:22:49,399 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 134 [2019-12-07 18:22:49,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:49,406 INFO L225 Difference]: With dead ends: 3847 [2019-12-07 18:22:49,407 INFO L226 Difference]: Without dead ends: 2142 [2019-12-07 18:22:49,408 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:22:49,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2142 states. [2019-12-07 18:22:49,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2142 to 1838. [2019-12-07 18:22:49,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-12-07 18:22:49,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2112 transitions. [2019-12-07 18:22:49,441 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2112 transitions. Word has length 134 [2019-12-07 18:22:49,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:49,442 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2112 transitions. [2019-12-07 18:22:49,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:22:49,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2112 transitions. [2019-12-07 18:22:49,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-12-07 18:22:49,446 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:49,446 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:22:49,446 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:22:49,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:49,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1909853781, now seen corresponding path program 1 times [2019-12-07 18:22:49,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:49,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707890981] [2019-12-07 18:22:49,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:49,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:49,488 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-12-07 18:22:49,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707890981] [2019-12-07 18:22:49,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:49,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:22:49,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302301578] [2019-12-07 18:22:49,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:22:49,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:49,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:22:49,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:22:49,489 INFO L87 Difference]: Start difference. First operand 1838 states and 2112 transitions. Second operand 3 states. [2019-12-07 18:22:49,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:49,754 INFO L93 Difference]: Finished difference Result 3674 states and 4220 transitions. [2019-12-07 18:22:49,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:22:49,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-12-07 18:22:49,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:49,762 INFO L225 Difference]: With dead ends: 3674 [2019-12-07 18:22:49,763 INFO L226 Difference]: Without dead ends: 1838 [2019-12-07 18:22:49,765 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 18:22:49,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-12-07 18:22:49,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2019-12-07 18:22:49,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-12-07 18:22:49,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 1999 transitions. [2019-12-07 18:22:49,798 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 1999 transitions. Word has length 157 [2019-12-07 18:22:49,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:49,798 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 1999 transitions. [2019-12-07 18:22:49,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:22:49,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 1999 transitions. [2019-12-07 18:22:49,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-12-07 18:22:49,803 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:49,803 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:22:49,804 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:22:49,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:49,804 INFO L82 PathProgramCache]: Analyzing trace with hash -221184622, now seen corresponding path program 1 times [2019-12-07 18:22:49,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:49,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901857332] [2019-12-07 18:22:49,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:49,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:50,360 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:50,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901857332] [2019-12-07 18:22:50,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:50,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 18:22:50,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215954721] [2019-12-07 18:22:50,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 18:22:50,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:50,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 18:22:50,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:22:50,362 INFO L87 Difference]: Start difference. First operand 1838 states and 1999 transitions. Second operand 13 states. [2019-12-07 18:22:51,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:51,283 INFO L93 Difference]: Finished difference Result 3732 states and 4088 transitions. [2019-12-07 18:22:51,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 18:22:51,283 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 167 [2019-12-07 18:22:51,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:51,297 INFO L225 Difference]: With dead ends: 3732 [2019-12-07 18:22:51,297 INFO L226 Difference]: Without dead ends: 2027 [2019-12-07 18:22:51,298 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=174, Unknown=0, NotChecked=0, Total=306 [2019-12-07 18:22:51,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2027 states. [2019-12-07 18:22:51,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2027 to 1765. [2019-12-07 18:22:51,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1765 states. [2019-12-07 18:22:51,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 1916 transitions. [2019-12-07 18:22:51,318 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 1916 transitions. Word has length 167 [2019-12-07 18:22:51,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:51,319 INFO L462 AbstractCegarLoop]: Abstraction has 1765 states and 1916 transitions. [2019-12-07 18:22:51,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 18:22:51,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 1916 transitions. [2019-12-07 18:22:51,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-12-07 18:22:51,323 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:51,324 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:22:51,324 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:22:51,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:51,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1527065083, now seen corresponding path program 1 times [2019-12-07 18:22:51,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:51,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678589116] [2019-12-07 18:22:51,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:51,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:51,389 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-12-07 18:22:51,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678589116] [2019-12-07 18:22:51,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:51,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:22:51,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863904445] [2019-12-07 18:22:51,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:22:51,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:51,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:22:51,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:22:51,390 INFO L87 Difference]: Start difference. First operand 1765 states and 1916 transitions. Second operand 3 states. [2019-12-07 18:22:51,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:51,623 INFO L93 Difference]: Finished difference Result 3528 states and 3830 transitions. [2019-12-07 18:22:51,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:22:51,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2019-12-07 18:22:51,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:51,628 INFO L225 Difference]: With dead ends: 3528 [2019-12-07 18:22:51,628 INFO L226 Difference]: Without dead ends: 1765 [2019-12-07 18:22:51,630 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 18:22:51,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2019-12-07 18:22:51,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1634. [2019-12-07 18:22:51,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1634 states. [2019-12-07 18:22:51,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 1762 transitions. [2019-12-07 18:22:51,646 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 1762 transitions. Word has length 195 [2019-12-07 18:22:51,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:51,646 INFO L462 AbstractCegarLoop]: Abstraction has 1634 states and 1762 transitions. [2019-12-07 18:22:51,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:22:51,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 1762 transitions. [2019-12-07 18:22:51,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-12-07 18:22:51,649 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:51,649 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:22:51,649 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:22:51,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:51,649 INFO L82 PathProgramCache]: Analyzing trace with hash 792554223, now seen corresponding path program 1 times [2019-12-07 18:22:51,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:51,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149678759] [2019-12-07 18:22:51,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:51,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:51,739 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-12-07 18:22:51,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149678759] [2019-12-07 18:22:51,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:51,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:22:51,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471412086] [2019-12-07 18:22:51,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:22:51,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:51,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:22:51,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:22:51,741 INFO L87 Difference]: Start difference. First operand 1634 states and 1762 transitions. Second operand 6 states. [2019-12-07 18:22:52,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:52,057 INFO L93 Difference]: Finished difference Result 3423 states and 3704 transitions. [2019-12-07 18:22:52,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:22:52,057 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 239 [2019-12-07 18:22:52,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:52,064 INFO L225 Difference]: With dead ends: 3423 [2019-12-07 18:22:52,064 INFO L226 Difference]: Without dead ends: 1922 [2019-12-07 18:22:52,065 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:22:52,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1922 states. [2019-12-07 18:22:52,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1922 to 1896. [2019-12-07 18:22:52,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1896 states. [2019-12-07 18:22:52,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2020 transitions. [2019-12-07 18:22:52,083 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2020 transitions. Word has length 239 [2019-12-07 18:22:52,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:52,083 INFO L462 AbstractCegarLoop]: Abstraction has 1896 states and 2020 transitions. [2019-12-07 18:22:52,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:22:52,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2020 transitions. [2019-12-07 18:22:52,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-12-07 18:22:52,085 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:52,085 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2019-12-07 18:22:52,086 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:22:52,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:52,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1426430283, now seen corresponding path program 1 times [2019-12-07 18:22:52,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:52,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520879343] [2019-12-07 18:22:52,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:52,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:52,206 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-12-07 18:22:52,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520879343] [2019-12-07 18:22:52,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:52,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:22:52,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679456563] [2019-12-07 18:22:52,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:22:52,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:52,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:22:52,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:22:52,208 INFO L87 Difference]: Start difference. First operand 1896 states and 2020 transitions. Second operand 5 states. [2019-12-07 18:22:52,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:52,782 INFO L93 Difference]: Finished difference Result 3790 states and 4036 transitions. [2019-12-07 18:22:52,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:22:52,783 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 262 [2019-12-07 18:22:52,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:52,788 INFO L225 Difference]: With dead ends: 3790 [2019-12-07 18:22:52,788 INFO L226 Difference]: Without dead ends: 1765 [2019-12-07 18:22:52,790 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:22:52,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2019-12-07 18:22:52,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1765. [2019-12-07 18:22:52,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1765 states. [2019-12-07 18:22:52,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 1882 transitions. [2019-12-07 18:22:52,807 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 1882 transitions. Word has length 262 [2019-12-07 18:22:52,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:52,807 INFO L462 AbstractCegarLoop]: Abstraction has 1765 states and 1882 transitions. [2019-12-07 18:22:52,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:22:52,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 1882 transitions. [2019-12-07 18:22:52,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-12-07 18:22:52,809 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:52,810 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:52,810 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:22:52,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:52,810 INFO L82 PathProgramCache]: Analyzing trace with hash -42906621, now seen corresponding path program 1 times [2019-12-07 18:22:52,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:52,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559106894] [2019-12-07 18:22:52,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:52,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:53,078 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 301 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-12-07 18:22:53,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559106894] [2019-12-07 18:22:53,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:53,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:22:53,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341404918] [2019-12-07 18:22:53,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:22:53,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:53,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:22:53,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:22:53,080 INFO L87 Difference]: Start difference. First operand 1765 states and 1882 transitions. Second operand 6 states. [2019-12-07 18:22:53,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:53,514 INFO L93 Difference]: Finished difference Result 3467 states and 3713 transitions. [2019-12-07 18:22:53,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:22:53,514 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 273 [2019-12-07 18:22:53,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:53,515 INFO L225 Difference]: With dead ends: 3467 [2019-12-07 18:22:53,515 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 18:22:53,517 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:22:53,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 18:22:53,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 18:22:53,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 18:22:53,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 18:22:53,517 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 273 [2019-12-07 18:22:53,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:53,517 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 18:22:53,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:22:53,517 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 18:22:53,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 18:22:53,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 18:22:53,805 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-12-07 18:22:53,957 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-12-07 18:22:53,960 INFO L246 CegarLoopResult]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-12-07 18:22:53,960 INFO L246 CegarLoopResult]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-12-07 18:22:53,960 INFO L246 CegarLoopResult]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,960 INFO L246 CegarLoopResult]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,960 INFO L246 CegarLoopResult]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,960 INFO L246 CegarLoopResult]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,960 INFO L246 CegarLoopResult]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,960 INFO L246 CegarLoopResult]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,960 INFO L246 CegarLoopResult]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-12-07 18:22:53,960 INFO L246 CegarLoopResult]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-12-07 18:22:53,960 INFO L246 CegarLoopResult]: For program point L566(line 566) no Hoare annotation was computed. [2019-12-07 18:22:53,960 INFO L246 CegarLoopResult]: For program point L533(line 533) no Hoare annotation was computed. [2019-12-07 18:22:53,960 INFO L246 CegarLoopResult]: For program point L500(line 500) no Hoare annotation was computed. [2019-12-07 18:22:53,960 INFO L246 CegarLoopResult]: For program point L467(line 467) no Hoare annotation was computed. [2019-12-07 18:22:53,960 INFO L246 CegarLoopResult]: For program point L434(line 434) no Hoare annotation was computed. [2019-12-07 18:22:53,960 INFO L246 CegarLoopResult]: For program point L401(line 401) no Hoare annotation was computed. [2019-12-07 18:22:53,961 INFO L246 CegarLoopResult]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-12-07 18:22:53,961 INFO L246 CegarLoopResult]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-12-07 18:22:53,961 INFO L246 CegarLoopResult]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,961 INFO L246 CegarLoopResult]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,961 INFO L246 CegarLoopResult]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,961 INFO L246 CegarLoopResult]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,961 INFO L246 CegarLoopResult]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,961 INFO L246 CegarLoopResult]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,961 INFO L246 CegarLoopResult]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-12-07 18:22:53,961 INFO L246 CegarLoopResult]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-12-07 18:22:53,961 INFO L246 CegarLoopResult]: For program point L569(line 569) no Hoare annotation was computed. [2019-12-07 18:22:53,961 INFO L246 CegarLoopResult]: For program point L536(line 536) no Hoare annotation was computed. [2019-12-07 18:22:53,961 INFO L246 CegarLoopResult]: For program point L503(line 503) no Hoare annotation was computed. [2019-12-07 18:22:53,961 INFO L246 CegarLoopResult]: For program point L470(line 470) no Hoare annotation was computed. [2019-12-07 18:22:53,961 INFO L246 CegarLoopResult]: For program point L437(line 437) no Hoare annotation was computed. [2019-12-07 18:22:53,961 INFO L246 CegarLoopResult]: For program point L404(line 404) no Hoare annotation was computed. [2019-12-07 18:22:53,961 INFO L246 CegarLoopResult]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-12-07 18:22:53,961 INFO L246 CegarLoopResult]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-12-07 18:22:53,961 INFO L246 CegarLoopResult]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-12-07 18:22:53,962 INFO L246 CegarLoopResult]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-12-07 18:22:53,962 INFO L246 CegarLoopResult]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-12-07 18:22:53,962 INFO L246 CegarLoopResult]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-12-07 18:22:53,962 INFO L246 CegarLoopResult]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-12-07 18:22:53,962 INFO L246 CegarLoopResult]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,962 INFO L246 CegarLoopResult]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,962 INFO L246 CegarLoopResult]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,962 INFO L246 CegarLoopResult]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,962 INFO L246 CegarLoopResult]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,962 INFO L246 CegarLoopResult]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-12-07 18:22:53,962 INFO L246 CegarLoopResult]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-12-07 18:22:53,962 INFO L246 CegarLoopResult]: For program point L572(line 572) no Hoare annotation was computed. [2019-12-07 18:22:53,962 INFO L246 CegarLoopResult]: For program point L539(line 539) no Hoare annotation was computed. [2019-12-07 18:22:53,962 INFO L246 CegarLoopResult]: For program point L506(line 506) no Hoare annotation was computed. [2019-12-07 18:22:53,962 INFO L246 CegarLoopResult]: For program point L473(line 473) no Hoare annotation was computed. [2019-12-07 18:22:53,962 INFO L246 CegarLoopResult]: For program point L440(line 440) no Hoare annotation was computed. [2019-12-07 18:22:53,962 INFO L246 CegarLoopResult]: For program point L407(line 407) no Hoare annotation was computed. [2019-12-07 18:22:53,962 INFO L246 CegarLoopResult]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-12-07 18:22:53,963 INFO L242 CegarLoopResult]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse4 (= 15 ~a8~0)) (.cse10 (= 1 ~a7~0))) (let ((.cse7 (= ~a17~0 1)) (.cse2 (<= ~a17~0 0)) (.cse5 (<= ~a20~0 0)) (.cse0 (not .cse10)) (.cse9 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse8 (= ~a16~0 5)) (.cse6 (not .cse4)) (.cse3 (= ~a21~0 1)) (.cse11 (= ~a20~0 1))) (or (and (or (= 2 ULTIMATE.start_calculate_output_~input) (= 4 ULTIMATE.start_calculate_output_~input) (= 3 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse3) (and .cse0 .cse7 .cse1 .cse3) (and .cse6 .cse8 (not (= 13 ~a8~0))) (and .cse0 .cse1 .cse3 .cse4 (not .cse9)) (and .cse10 .cse9 .cse1 .cse2 .cse3 .cse5) (and .cse0 .cse1 .cse3 .cse11) (and .cse10 .cse6 .cse1) (and .cse9 .cse6 .cse3) (and .cse1 .cse3 .cse4 .cse8) (and .cse6 .cse3 .cse11)))) [2019-12-07 18:22:53,963 INFO L246 CegarLoopResult]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,963 INFO L246 CegarLoopResult]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,963 INFO L246 CegarLoopResult]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,963 INFO L246 CegarLoopResult]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,963 INFO L246 CegarLoopResult]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,963 INFO L246 CegarLoopResult]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-12-07 18:22:53,963 INFO L246 CegarLoopResult]: For program point L542(line 542) no Hoare annotation was computed. [2019-12-07 18:22:53,963 INFO L246 CegarLoopResult]: For program point L509(line 509) no Hoare annotation was computed. [2019-12-07 18:22:53,963 INFO L246 CegarLoopResult]: For program point L476(line 476) no Hoare annotation was computed. [2019-12-07 18:22:53,963 INFO L246 CegarLoopResult]: For program point L443(line 443) no Hoare annotation was computed. [2019-12-07 18:22:53,963 INFO L246 CegarLoopResult]: For program point L410(line 410) no Hoare annotation was computed. [2019-12-07 18:22:53,963 INFO L246 CegarLoopResult]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-12-07 18:22:53,963 INFO L246 CegarLoopResult]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-12-07 18:22:53,963 INFO L246 CegarLoopResult]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-12-07 18:22:53,964 INFO L246 CegarLoopResult]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-12-07 18:22:53,964 INFO L246 CegarLoopResult]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-12-07 18:22:53,964 INFO L246 CegarLoopResult]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-12-07 18:22:53,964 INFO L246 CegarLoopResult]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-12-07 18:22:53,964 INFO L249 CegarLoopResult]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-12-07 18:22:53,964 INFO L246 CegarLoopResult]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,964 INFO L246 CegarLoopResult]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,964 INFO L246 CegarLoopResult]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,964 INFO L246 CegarLoopResult]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,964 INFO L246 CegarLoopResult]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,964 INFO L246 CegarLoopResult]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-12-07 18:22:53,964 INFO L246 CegarLoopResult]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-12-07 18:22:53,964 INFO L246 CegarLoopResult]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-12-07 18:22:53,964 INFO L246 CegarLoopResult]: For program point L545(line 545) no Hoare annotation was computed. [2019-12-07 18:22:53,964 INFO L246 CegarLoopResult]: For program point L512(line 512) no Hoare annotation was computed. [2019-12-07 18:22:53,964 INFO L246 CegarLoopResult]: For program point L479(line 479) no Hoare annotation was computed. [2019-12-07 18:22:53,964 INFO L246 CegarLoopResult]: For program point L446(line 446) no Hoare annotation was computed. [2019-12-07 18:22:53,964 INFO L246 CegarLoopResult]: For program point L413(line 413) no Hoare annotation was computed. [2019-12-07 18:22:53,964 INFO L246 CegarLoopResult]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-12-07 18:22:53,964 INFO L246 CegarLoopResult]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,965 INFO L246 CegarLoopResult]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,965 INFO L246 CegarLoopResult]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,965 INFO L246 CegarLoopResult]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,965 INFO L246 CegarLoopResult]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-12-07 18:22:53,965 INFO L246 CegarLoopResult]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,965 INFO L246 CegarLoopResult]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-12-07 18:22:53,965 INFO L246 CegarLoopResult]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-12-07 18:22:53,965 INFO L246 CegarLoopResult]: For program point L548(line 548) no Hoare annotation was computed. [2019-12-07 18:22:53,965 INFO L246 CegarLoopResult]: For program point L515(line 515) no Hoare annotation was computed. [2019-12-07 18:22:53,965 INFO L246 CegarLoopResult]: For program point L482(line 482) no Hoare annotation was computed. [2019-12-07 18:22:53,965 INFO L246 CegarLoopResult]: For program point L449(line 449) no Hoare annotation was computed. [2019-12-07 18:22:53,965 INFO L246 CegarLoopResult]: For program point L416(line 416) no Hoare annotation was computed. [2019-12-07 18:22:53,965 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 18:22:53,965 INFO L246 CegarLoopResult]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-12-07 18:22:53,965 INFO L246 CegarLoopResult]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-12-07 18:22:53,965 INFO L246 CegarLoopResult]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-12-07 18:22:53,965 INFO L246 CegarLoopResult]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-12-07 18:22:53,965 INFO L246 CegarLoopResult]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-12-07 18:22:53,965 INFO L246 CegarLoopResult]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-12-07 18:22:53,965 INFO L246 CegarLoopResult]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,966 INFO L242 CegarLoopResult]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse4 (= 15 ~a8~0)) (.cse10 (= 1 ~a7~0))) (let ((.cse7 (= ~a17~0 1)) (.cse2 (<= ~a17~0 0)) (.cse5 (<= ~a20~0 0)) (.cse0 (not .cse10)) (.cse9 (= ~a16~0 4)) (.cse1 (= ~a12~0 8)) (.cse8 (= ~a16~0 5)) (.cse6 (not .cse4)) (.cse3 (= ~a21~0 1)) (.cse11 (= ~a20~0 1))) (or (and (or (= 2 ULTIMATE.start_calculate_output_~input) (= 4 ULTIMATE.start_calculate_output_~input) (= 3 ULTIMATE.start_calculate_output_~input) (= 6 ULTIMATE.start_calculate_output_~input) (= 1 ULTIMATE.start_calculate_output_~input) (= 5 ULTIMATE.start_calculate_output_~input)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse3) (and .cse0 .cse7 .cse1 .cse3) (and .cse6 .cse8 (not (= 13 ~a8~0))) (and .cse0 .cse1 .cse3 .cse4 (not .cse9)) (and .cse10 .cse9 .cse1 .cse2 .cse3 .cse5) (and .cse0 .cse1 .cse3 .cse11) (and .cse10 .cse6 .cse1) (and .cse9 .cse6 .cse3) (and .cse1 .cse3 .cse4 .cse8) (and .cse6 .cse3 .cse11)))) [2019-12-07 18:22:53,966 INFO L246 CegarLoopResult]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,966 INFO L246 CegarLoopResult]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,966 INFO L246 CegarLoopResult]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,966 INFO L246 CegarLoopResult]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,966 INFO L246 CegarLoopResult]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-12-07 18:22:53,966 INFO L246 CegarLoopResult]: For program point L551(line 551) no Hoare annotation was computed. [2019-12-07 18:22:53,966 INFO L246 CegarLoopResult]: For program point L518(line 518) no Hoare annotation was computed. [2019-12-07 18:22:53,966 INFO L246 CegarLoopResult]: For program point L485(line 485) no Hoare annotation was computed. [2019-12-07 18:22:53,966 INFO L246 CegarLoopResult]: For program point L452(line 452) no Hoare annotation was computed. [2019-12-07 18:22:53,966 INFO L246 CegarLoopResult]: For program point L419(line 419) no Hoare annotation was computed. [2019-12-07 18:22:53,966 INFO L246 CegarLoopResult]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-12-07 18:22:53,966 INFO L246 CegarLoopResult]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-12-07 18:22:53,966 INFO L246 CegarLoopResult]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,966 INFO L246 CegarLoopResult]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,966 INFO L246 CegarLoopResult]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,966 INFO L246 CegarLoopResult]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,966 INFO L246 CegarLoopResult]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,966 INFO L246 CegarLoopResult]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-12-07 18:22:53,967 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 18:22:53,967 INFO L246 CegarLoopResult]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-12-07 18:22:53,967 INFO L246 CegarLoopResult]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-12-07 18:22:53,967 INFO L246 CegarLoopResult]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-12-07 18:22:53,967 INFO L246 CegarLoopResult]: For program point L554(line 554) no Hoare annotation was computed. [2019-12-07 18:22:53,967 INFO L246 CegarLoopResult]: For program point L521(line 521) no Hoare annotation was computed. [2019-12-07 18:22:53,967 INFO L246 CegarLoopResult]: For program point L488(line 488) no Hoare annotation was computed. [2019-12-07 18:22:53,967 INFO L246 CegarLoopResult]: For program point L455(line 455) no Hoare annotation was computed. [2019-12-07 18:22:53,967 INFO L246 CegarLoopResult]: For program point L422(line 422) no Hoare annotation was computed. [2019-12-07 18:22:53,967 INFO L246 CegarLoopResult]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-12-07 18:22:53,967 INFO L246 CegarLoopResult]: For program point L588(line 588) no Hoare annotation was computed. [2019-12-07 18:22:53,967 INFO L246 CegarLoopResult]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-12-07 18:22:53,967 INFO L246 CegarLoopResult]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,967 INFO L246 CegarLoopResult]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,967 INFO L246 CegarLoopResult]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,967 INFO L246 CegarLoopResult]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,967 INFO L246 CegarLoopResult]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-12-07 18:22:53,967 INFO L246 CegarLoopResult]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,967 INFO L246 CegarLoopResult]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,967 INFO L246 CegarLoopResult]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-12-07 18:22:53,968 INFO L246 CegarLoopResult]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-12-07 18:22:53,968 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 18:22:53,968 INFO L246 CegarLoopResult]: For program point L557(line 557) no Hoare annotation was computed. [2019-12-07 18:22:53,968 INFO L246 CegarLoopResult]: For program point L524(line 524) no Hoare annotation was computed. [2019-12-07 18:22:53,968 INFO L246 CegarLoopResult]: For program point L491(line 491) no Hoare annotation was computed. [2019-12-07 18:22:53,968 INFO L246 CegarLoopResult]: For program point L458(line 458) no Hoare annotation was computed. [2019-12-07 18:22:53,968 INFO L246 CegarLoopResult]: For program point L425(line 425) no Hoare annotation was computed. [2019-12-07 18:22:53,968 INFO L246 CegarLoopResult]: For program point L392(line 392) no Hoare annotation was computed. [2019-12-07 18:22:53,968 INFO L246 CegarLoopResult]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-12-07 18:22:53,968 INFO L246 CegarLoopResult]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-12-07 18:22:53,968 INFO L246 CegarLoopResult]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-12-07 18:22:53,968 INFO L246 CegarLoopResult]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-12-07 18:22:53,968 INFO L246 CegarLoopResult]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,968 INFO L246 CegarLoopResult]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,968 INFO L246 CegarLoopResult]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,968 INFO L246 CegarLoopResult]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,968 INFO L246 CegarLoopResult]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,968 INFO L246 CegarLoopResult]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-12-07 18:22:53,968 INFO L246 CegarLoopResult]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,968 INFO L246 CegarLoopResult]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-12-07 18:22:53,968 INFO L246 CegarLoopResult]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-12-07 18:22:53,969 INFO L246 CegarLoopResult]: For program point L560(line 560) no Hoare annotation was computed. [2019-12-07 18:22:53,969 INFO L246 CegarLoopResult]: For program point L527(line 527) no Hoare annotation was computed. [2019-12-07 18:22:53,969 INFO L246 CegarLoopResult]: For program point L494(line 494) no Hoare annotation was computed. [2019-12-07 18:22:53,969 INFO L246 CegarLoopResult]: For program point L461(line 461) no Hoare annotation was computed. [2019-12-07 18:22:53,969 INFO L246 CegarLoopResult]: For program point L428(line 428) no Hoare annotation was computed. [2019-12-07 18:22:53,969 INFO L246 CegarLoopResult]: For program point L395(line 395) no Hoare annotation was computed. [2019-12-07 18:22:53,969 INFO L246 CegarLoopResult]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-12-07 18:22:53,969 INFO L246 CegarLoopResult]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-12-07 18:22:53,969 INFO L246 CegarLoopResult]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-12-07 18:22:53,969 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 18:22:53,969 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 479) no Hoare annotation was computed. [2019-12-07 18:22:53,969 INFO L246 CegarLoopResult]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-12-07 18:22:53,969 INFO L246 CegarLoopResult]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-12-07 18:22:53,969 INFO L246 CegarLoopResult]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-12-07 18:22:53,969 INFO L246 CegarLoopResult]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,969 INFO L246 CegarLoopResult]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,969 INFO L246 CegarLoopResult]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,969 INFO L246 CegarLoopResult]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,969 INFO L246 CegarLoopResult]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,969 INFO L246 CegarLoopResult]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 18:22:53,970 INFO L246 CegarLoopResult]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-12-07 18:22:53,970 INFO L246 CegarLoopResult]: For program point L563(line 563) no Hoare annotation was computed. [2019-12-07 18:22:53,970 INFO L246 CegarLoopResult]: For program point L530(line 530) no Hoare annotation was computed. [2019-12-07 18:22:53,970 INFO L246 CegarLoopResult]: For program point L497(line 497) no Hoare annotation was computed. [2019-12-07 18:22:53,970 INFO L246 CegarLoopResult]: For program point L464(line 464) no Hoare annotation was computed. [2019-12-07 18:22:53,970 INFO L246 CegarLoopResult]: For program point L431(line 431) no Hoare annotation was computed. [2019-12-07 18:22:53,970 INFO L246 CegarLoopResult]: For program point L398(line 398) no Hoare annotation was computed. [2019-12-07 18:22:53,970 INFO L246 CegarLoopResult]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-12-07 18:22:53,970 INFO L246 CegarLoopResult]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-12-07 18:22:53,970 INFO L246 CegarLoopResult]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-12-07 18:22:53,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:22:53 BoogieIcfgContainer [2019-12-07 18:22:53,988 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:22:53,988 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:22:53,988 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:22:53,988 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:22:53,988 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:22:44" (3/4) ... [2019-12-07 18:22:53,990 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 18:22:54,006 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 18:22:54,007 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 18:22:54,086 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7bc6d995-f125-485e-94cf-8f136cf71b14/bin/uautomizer/witness.graphml [2019-12-07 18:22:54,086 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:22:54,087 INFO L168 Benchmark]: Toolchain (without parser) took 10426.20 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 396.9 MB). Free memory was 938.0 MB in the beginning and 1.3 GB in the end (delta: -325.8 MB). Peak memory consumption was 71.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:22:54,087 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:22:54,088 INFO L168 Benchmark]: CACSL2BoogieTranslator took 381.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 73.9 MB). Free memory was 938.0 MB in the beginning and 1.0 GB in the end (delta: -109.1 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:22:54,088 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:22:54,088 INFO L168 Benchmark]: Boogie Preprocessor took 40.92 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:22:54,088 INFO L168 Benchmark]: RCFGBuilder took 650.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 919.7 MB in the end (delta: 116.7 MB). Peak memory consumption was 116.7 MB. Max. memory is 11.5 GB. [2019-12-07 18:22:54,088 INFO L168 Benchmark]: TraceAbstraction took 9197.60 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 323.0 MB). Free memory was 919.7 MB in the beginning and 1.3 GB in the end (delta: -372.7 MB). Peak memory consumption was 379.6 MB. Max. memory is 11.5 GB. [2019-12-07 18:22:54,089 INFO L168 Benchmark]: Witness Printer took 98.43 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. [2019-12-07 18:22:54,090 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 381.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 73.9 MB). Free memory was 938.0 MB in the beginning and 1.0 GB in the end (delta: -109.1 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.92 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 650.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 919.7 MB in the end (delta: 116.7 MB). Peak memory consumption was 116.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9197.60 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 323.0 MB). Free memory was 919.7 MB in the beginning and 1.3 GB in the end (delta: -372.7 MB). Peak memory consumption was 379.6 MB. Max. memory is 11.5 GB. * Witness Printer took 98.43 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 479]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((((((((((((2 == input || 4 == input) || 3 == input) || 6 == input) || 1 == input) || 5 == input) && !(1 == a7)) && a12 == 8) && a17 <= 0) && a21 == 1) && 15 == a8) && a20 <= 0) || ((!(15 == a8) && a17 == 1) && a21 == 1)) || (((!(1 == a7) && a17 == 1) && a12 == 8) && a21 == 1)) || ((!(15 == a8) && a16 == 5) && !(13 == a8))) || ((((!(1 == a7) && a12 == 8) && a21 == 1) && 15 == a8) && !(a16 == 4))) || (((((1 == a7 && a16 == 4) && a12 == 8) && a17 <= 0) && a21 == 1) && a20 <= 0)) || (((!(1 == a7) && a12 == 8) && a21 == 1) && a20 == 1)) || ((1 == a7 && !(15 == a8)) && a12 == 8)) || ((a16 == 4 && !(15 == a8)) && a21 == 1)) || (((a12 == 8 && a21 == 1) && 15 == a8) && a16 == 5)) || ((!(15 == a8) && a21 == 1) && a20 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((((((((((((2 == input || 4 == input) || 3 == input) || 6 == input) || 1 == input) || 5 == input) && !(1 == a7)) && a12 == 8) && a17 <= 0) && a21 == 1) && 15 == a8) && a20 <= 0) || ((!(15 == a8) && a17 == 1) && a21 == 1)) || (((!(1 == a7) && a17 == 1) && a12 == 8) && a21 == 1)) || ((!(15 == a8) && a16 == 5) && !(13 == a8))) || ((((!(1 == a7) && a12 == 8) && a21 == 1) && 15 == a8) && !(a16 == 4))) || (((((1 == a7 && a16 == 4) && a12 == 8) && a17 <= 0) && a21 == 1) && a20 <= 0)) || (((!(1 == a7) && a12 == 8) && a21 == 1) && a20 == 1)) || ((1 == a7 && !(15 == a8)) && a12 == 8)) || ((a16 == 4 && !(15 == a8)) && a21 == 1)) || (((a12 == 8 && a21 == 1) && 15 == a8) && a16 == 5)) || ((!(15 == a8) && a21 == 1) && a20 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 8.6s, OverallIterations: 14, TraceHistogramMax: 8, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 799 SDtfs, 3379 SDslu, 175 SDs, 0 SdLazy, 8117 SolverSat, 1000 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1896occurred 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: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 2033 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 46 NumberOfFragments, 349 HoareAnnotationTreeSize, 3 FomulaSimplifications, 17216 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 316 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 2267 NumberOfCodeBlocks, 2267 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2253 ConstructedInterpolants, 0 QuantifiedInterpolants, 1772182 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 1734/1734 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...