./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label43.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_2624860e-0bce-4037-98d2-a886815f2ef9/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2624860e-0bce-4037-98d2-a886815f2ef9/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2624860e-0bce-4037-98d2-a886815f2ef9/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2624860e-0bce-4037-98d2-a886815f2ef9/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label43.c -s /tmp/vcloud-vcloud-master/worker/run_dir_2624860e-0bce-4037-98d2-a886815f2ef9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2624860e-0bce-4037-98d2-a886815f2ef9/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 5c739325db675539f25b419a33c8766e100c13e7 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:06:25,036 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:06:25,037 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:06:25,047 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:06:25,048 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:06:25,049 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:06:25,050 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:06:25,053 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:06:25,054 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:06:25,055 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:06:25,056 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:06:25,058 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:06:25,058 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:06:25,059 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:06:25,060 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:06:25,061 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:06:25,062 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:06:25,062 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:06:25,064 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:06:25,066 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:06:25,067 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:06:25,069 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:06:25,070 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:06:25,070 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:06:25,073 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:06:25,073 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:06:25,074 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:06:25,074 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:06:25,075 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:06:25,076 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:06:25,076 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:06:25,077 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:06:25,078 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:06:25,079 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:06:25,080 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:06:25,080 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:06:25,081 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:06:25,081 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:06:25,081 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:06:25,082 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:06:25,083 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:06:25,084 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2624860e-0bce-4037-98d2-a886815f2ef9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:06:25,096 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:06:25,097 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:06:25,098 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:06:25,098 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:06:25,098 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:06:25,099 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:06:25,099 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:06:25,099 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:06:25,099 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:06:25,100 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:06:25,100 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:06:25,100 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:06:25,100 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:06:25,101 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:06:25,101 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:06:25,101 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:06:25,101 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:06:25,102 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:06:25,102 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:06:25,102 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:06:25,102 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:06:25,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:06:25,103 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:06:25,103 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:06:25,103 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:06:25,104 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:06:25,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:06:25,104 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:06:25,104 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_2624860e-0bce-4037-98d2-a886815f2ef9/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 -> 5c739325db675539f25b419a33c8766e100c13e7 [2019-11-16 00:06:25,131 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:06:25,141 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:06:25,144 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:06:25,146 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:06:25,146 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:06:25,147 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2624860e-0bce-4037-98d2-a886815f2ef9/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem01_label43.c [2019-11-16 00:06:25,196 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2624860e-0bce-4037-98d2-a886815f2ef9/bin/uautomizer/data/741e09242/8e5c5928253c4cde9ee64b62712c82f1/FLAGc7fadeed2 [2019-11-16 00:06:25,677 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:06:25,678 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2624860e-0bce-4037-98d2-a886815f2ef9/sv-benchmarks/c/eca-rers2012/Problem01_label43.c [2019-11-16 00:06:25,691 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2624860e-0bce-4037-98d2-a886815f2ef9/bin/uautomizer/data/741e09242/8e5c5928253c4cde9ee64b62712c82f1/FLAGc7fadeed2 [2019-11-16 00:06:25,704 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2624860e-0bce-4037-98d2-a886815f2ef9/bin/uautomizer/data/741e09242/8e5c5928253c4cde9ee64b62712c82f1 [2019-11-16 00:06:25,707 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:06:25,709 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:06:25,714 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:06:25,715 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:06:25,718 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:06:25,719 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:06:25" (1/1) ... [2019-11-16 00:06:25,721 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27d067a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:25, skipping insertion in model container [2019-11-16 00:06:25,721 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:06:25" (1/1) ... [2019-11-16 00:06:25,728 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:06:25,772 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:06:26,172 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:06:26,182 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:06:26,350 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:06:26,365 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:06:26,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:26 WrapperNode [2019-11-16 00:06:26,365 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:06:26,366 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:06:26,366 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:06:26,366 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:06:26,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:26" (1/1) ... [2019-11-16 00:06:26,391 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:26" (1/1) ... [2019-11-16 00:06:26,447 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:06:26,451 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:06:26,451 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:06:26,451 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:06:26,460 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:26" (1/1) ... [2019-11-16 00:06:26,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:26" (1/1) ... [2019-11-16 00:06:26,475 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:26" (1/1) ... [2019-11-16 00:06:26,481 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:26" (1/1) ... [2019-11-16 00:06:26,502 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:26" (1/1) ... [2019-11-16 00:06:26,512 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:26" (1/1) ... [2019-11-16 00:06:26,519 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:26" (1/1) ... [2019-11-16 00:06:26,527 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:06:26,527 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:06:26,528 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:06:26,528 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:06:26,529 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2624860e-0bce-4037-98d2-a886815f2ef9/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-11-16 00:06:26,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:06:26,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:06:27,854 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:06:27,855 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-16 00:06:27,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:06:27 BoogieIcfgContainer [2019-11-16 00:06:27,856 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:06:27,857 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:06:27,857 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:06:27,860 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:06:27,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:06:25" (1/3) ... [2019-11-16 00:06:27,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ef1698b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:06:27, skipping insertion in model container [2019-11-16 00:06:27,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:06:26" (2/3) ... [2019-11-16 00:06:27,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ef1698b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:06:27, skipping insertion in model container [2019-11-16 00:06:27,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:06:27" (3/3) ... [2019-11-16 00:06:27,868 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label43.c [2019-11-16 00:06:27,877 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:06:27,884 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:06:27,895 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:06:27,933 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:06:27,933 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:06:27,933 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:06:27,933 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:06:27,934 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:06:27,934 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:06:27,934 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:06:27,934 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:06:27,953 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-16 00:06:27,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-11-16 00:06:27,976 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:27,976 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:27,978 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:27,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:27,984 INFO L82 PathProgramCache]: Analyzing trace with hash -46355601, now seen corresponding path program 1 times [2019-11-16 00:06:27,992 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:27,992 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101300316] [2019-11-16 00:06:27,993 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:27,993 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:27,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:29,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:29,225 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101300316] [2019-11-16 00:06:29,225 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:29,225 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-16 00:06:29,226 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133345331] [2019-11-16 00:06:29,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:06:29,230 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:29,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:06:29,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:06:29,242 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 10 states. [2019-11-16 00:06:30,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:30,801 INFO L93 Difference]: Finished difference Result 493 states and 846 transitions. [2019-11-16 00:06:30,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:06:30,803 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 128 [2019-11-16 00:06:30,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:30,820 INFO L225 Difference]: With dead ends: 493 [2019-11-16 00:06:30,821 INFO L226 Difference]: Without dead ends: 193 [2019-11-16 00:06:30,825 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:06:30,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-11-16 00:06:30,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2019-11-16 00:06:30,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-11-16 00:06:30,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 264 transitions. [2019-11-16 00:06:30,891 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 264 transitions. Word has length 128 [2019-11-16 00:06:30,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:30,892 INFO L462 AbstractCegarLoop]: Abstraction has 193 states and 264 transitions. [2019-11-16 00:06:30,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:06:30,892 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 264 transitions. [2019-11-16 00:06:30,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-16 00:06:30,906 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:30,907 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:30,907 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:30,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:30,907 INFO L82 PathProgramCache]: Analyzing trace with hash 140870055, now seen corresponding path program 1 times [2019-11-16 00:06:30,908 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:30,908 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408283372] [2019-11-16 00:06:30,908 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:30,908 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:30,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:30,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:31,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:31,080 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408283372] [2019-11-16 00:06:31,083 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:31,083 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:06:31,083 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826072842] [2019-11-16 00:06:31,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:06:31,085 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:31,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:06:31,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:06:31,086 INFO L87 Difference]: Start difference. First operand 193 states and 264 transitions. Second operand 4 states. [2019-11-16 00:06:31,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:31,911 INFO L93 Difference]: Finished difference Result 588 states and 859 transitions. [2019-11-16 00:06:31,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:06:31,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-11-16 00:06:31,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:31,916 INFO L225 Difference]: With dead ends: 588 [2019-11-16 00:06:31,916 INFO L226 Difference]: Without dead ends: 455 [2019-11-16 00:06:31,917 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:06:31,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-11-16 00:06:31,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455. [2019-11-16 00:06:31,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2019-11-16 00:06:31,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 622 transitions. [2019-11-16 00:06:31,957 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 622 transitions. Word has length 132 [2019-11-16 00:06:31,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:31,957 INFO L462 AbstractCegarLoop]: Abstraction has 455 states and 622 transitions. [2019-11-16 00:06:31,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:06:31,958 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 622 transitions. [2019-11-16 00:06:31,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-16 00:06:31,960 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:31,961 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:31,961 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:31,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:31,961 INFO L82 PathProgramCache]: Analyzing trace with hash 119342607, now seen corresponding path program 1 times [2019-11-16 00:06:31,962 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:31,962 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606577601] [2019-11-16 00:06:31,963 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:31,963 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:31,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:31,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:32,048 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:06:32,049 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606577601] [2019-11-16 00:06:32,049 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:32,049 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:06:32,049 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141385566] [2019-11-16 00:06:32,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:06:32,050 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:32,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:06:32,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:06:32,051 INFO L87 Difference]: Start difference. First operand 455 states and 622 transitions. Second operand 4 states. [2019-11-16 00:06:32,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:32,659 INFO L93 Difference]: Finished difference Result 1243 states and 1735 transitions. [2019-11-16 00:06:32,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:06:32,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-11-16 00:06:32,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:32,664 INFO L225 Difference]: With dead ends: 1243 [2019-11-16 00:06:32,664 INFO L226 Difference]: Without dead ends: 848 [2019-11-16 00:06:32,665 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:06:32,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2019-11-16 00:06:32,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 848. [2019-11-16 00:06:32,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 848 states. [2019-11-16 00:06:32,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1129 transitions. [2019-11-16 00:06:32,719 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1129 transitions. Word has length 137 [2019-11-16 00:06:32,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:32,720 INFO L462 AbstractCegarLoop]: Abstraction has 848 states and 1129 transitions. [2019-11-16 00:06:32,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:06:32,720 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1129 transitions. [2019-11-16 00:06:32,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-16 00:06:32,723 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:32,724 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:32,724 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:32,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:32,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1936496881, now seen corresponding path program 1 times [2019-11-16 00:06:32,725 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:32,725 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914062817] [2019-11-16 00:06:32,725 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:32,726 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:32,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:32,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:32,816 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:06:32,816 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914062817] [2019-11-16 00:06:32,817 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:32,817 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:06:32,817 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782986663] [2019-11-16 00:06:32,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:06:32,818 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:32,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:06:32,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:06:32,818 INFO L87 Difference]: Start difference. First operand 848 states and 1129 transitions. Second operand 3 states. [2019-11-16 00:06:33,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:33,326 INFO L93 Difference]: Finished difference Result 2029 states and 2749 transitions. [2019-11-16 00:06:33,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:06:33,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-11-16 00:06:33,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:33,335 INFO L225 Difference]: With dead ends: 2029 [2019-11-16 00:06:33,335 INFO L226 Difference]: Without dead ends: 1241 [2019-11-16 00:06:33,337 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:06:33,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2019-11-16 00:06:33,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 979. [2019-11-16 00:06:33,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 979 states. [2019-11-16 00:06:33,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1309 transitions. [2019-11-16 00:06:33,365 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1309 transitions. Word has length 154 [2019-11-16 00:06:33,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:33,365 INFO L462 AbstractCegarLoop]: Abstraction has 979 states and 1309 transitions. [2019-11-16 00:06:33,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:06:33,366 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1309 transitions. [2019-11-16 00:06:33,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-11-16 00:06:33,369 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:33,370 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:33,370 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:33,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:33,370 INFO L82 PathProgramCache]: Analyzing trace with hash -454003692, now seen corresponding path program 1 times [2019-11-16 00:06:33,371 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:33,371 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601919802] [2019-11-16 00:06:33,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:33,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:33,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:33,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:33,440 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-16 00:06:33,441 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601919802] [2019-11-16 00:06:33,441 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:33,441 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:06:33,442 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731595596] [2019-11-16 00:06:33,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:06:33,442 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:33,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:06:33,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:06:33,443 INFO L87 Difference]: Start difference. First operand 979 states and 1309 transitions. Second operand 3 states. [2019-11-16 00:06:33,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:33,944 INFO L93 Difference]: Finished difference Result 2291 states and 3060 transitions. [2019-11-16 00:06:33,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:06:33,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2019-11-16 00:06:33,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:33,951 INFO L225 Difference]: With dead ends: 2291 [2019-11-16 00:06:33,952 INFO L226 Difference]: Without dead ends: 1372 [2019-11-16 00:06:33,954 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:06:33,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2019-11-16 00:06:33,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1241. [2019-11-16 00:06:33,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1241 states. [2019-11-16 00:06:33,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 1589 transitions. [2019-11-16 00:06:33,990 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 1589 transitions. Word has length 190 [2019-11-16 00:06:33,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:33,991 INFO L462 AbstractCegarLoop]: Abstraction has 1241 states and 1589 transitions. [2019-11-16 00:06:33,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:06:33,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1589 transitions. [2019-11-16 00:06:33,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-11-16 00:06:33,995 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:33,996 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:33,996 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:33,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:33,996 INFO L82 PathProgramCache]: Analyzing trace with hash -149384224, now seen corresponding path program 1 times [2019-11-16 00:06:33,997 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:33,997 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399791935] [2019-11-16 00:06:33,997 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:33,997 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:33,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:34,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:34,107 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-16 00:06:34,108 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399791935] [2019-11-16 00:06:34,109 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:34,109 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:06:34,109 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219563769] [2019-11-16 00:06:34,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:06:34,110 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:34,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:06:34,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:06:34,111 INFO L87 Difference]: Start difference. First operand 1241 states and 1589 transitions. Second operand 5 states. [2019-11-16 00:06:35,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:35,199 INFO L93 Difference]: Finished difference Result 2684 states and 3453 transitions. [2019-11-16 00:06:35,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:06:35,200 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 202 [2019-11-16 00:06:35,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:35,208 INFO L225 Difference]: With dead ends: 2684 [2019-11-16 00:06:35,208 INFO L226 Difference]: Without dead ends: 1503 [2019-11-16 00:06:35,210 INFO L600 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-11-16 00:06:35,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2019-11-16 00:06:35,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1503. [2019-11-16 00:06:35,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-11-16 00:06:35,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1875 transitions. [2019-11-16 00:06:35,244 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1875 transitions. Word has length 202 [2019-11-16 00:06:35,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:35,245 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 1875 transitions. [2019-11-16 00:06:35,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:06:35,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1875 transitions. [2019-11-16 00:06:35,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-11-16 00:06:35,250 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:35,251 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:35,251 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:35,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:35,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1289701893, now seen corresponding path program 1 times [2019-11-16 00:06:35,252 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:35,253 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278091747] [2019-11-16 00:06:35,253 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:35,253 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:35,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:35,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:35,328 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-16 00:06:35,328 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278091747] [2019-11-16 00:06:35,328 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:35,328 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:06:35,329 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265208884] [2019-11-16 00:06:35,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:06:35,329 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:35,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:06:35,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:06:35,330 INFO L87 Difference]: Start difference. First operand 1503 states and 1875 transitions. Second operand 3 states. [2019-11-16 00:06:35,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:35,800 INFO L93 Difference]: Finished difference Result 3339 states and 4162 transitions. [2019-11-16 00:06:35,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:06:35,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-11-16 00:06:35,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:35,808 INFO L225 Difference]: With dead ends: 3339 [2019-11-16 00:06:35,808 INFO L226 Difference]: Without dead ends: 1634 [2019-11-16 00:06:35,811 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:06:35,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2019-11-16 00:06:35,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1372. [2019-11-16 00:06:35,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1372 states. [2019-11-16 00:06:35,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1505 transitions. [2019-11-16 00:06:35,843 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1505 transitions. Word has length 205 [2019-11-16 00:06:35,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:35,843 INFO L462 AbstractCegarLoop]: Abstraction has 1372 states and 1505 transitions. [2019-11-16 00:06:35,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:06:35,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1505 transitions. [2019-11-16 00:06:35,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-11-16 00:06:35,848 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:35,849 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:35,849 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:35,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:35,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1709998072, now seen corresponding path program 1 times [2019-11-16 00:06:35,849 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:35,850 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80506575] [2019-11-16 00:06:35,850 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:35,850 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:35,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:35,978 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-11-16 00:06:35,979 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80506575] [2019-11-16 00:06:35,979 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:35,980 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:06:35,980 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868656820] [2019-11-16 00:06:35,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:06:35,981 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:35,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:06:35,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:06:35,981 INFO L87 Difference]: Start difference. First operand 1372 states and 1505 transitions. Second operand 3 states. [2019-11-16 00:06:36,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:36,436 INFO L93 Difference]: Finished difference Result 3206 states and 3549 transitions. [2019-11-16 00:06:36,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:06:36,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2019-11-16 00:06:36,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:36,437 INFO L225 Difference]: With dead ends: 3206 [2019-11-16 00:06:36,437 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:06:36,440 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:06:36,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:06:36,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:06:36,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:06:36,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:06:36,441 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 244 [2019-11-16 00:06:36,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:36,441 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:06:36,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:06:36,442 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:06:36,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:06:36,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-16 00:06:36,557 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-16 00:06:36,557 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-16 00:06:36,557 INFO L443 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,557 INFO L443 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,557 INFO L443 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,557 INFO L443 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,557 INFO L443 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,558 INFO L443 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,558 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-16 00:06:36,558 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-16 00:06:36,558 INFO L443 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-16 00:06:36,558 INFO L443 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-16 00:06:36,558 INFO L443 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-16 00:06:36,558 INFO L443 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-16 00:06:36,558 INFO L443 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-16 00:06:36,558 INFO L443 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-16 00:06:36,558 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-16 00:06:36,558 INFO L443 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-16 00:06:36,558 INFO L443 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,558 INFO L443 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,558 INFO L443 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,558 INFO L443 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,559 INFO L443 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,559 INFO L443 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,559 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-16 00:06:36,559 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-16 00:06:36,559 INFO L443 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-16 00:06:36,559 INFO L443 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-16 00:06:36,559 INFO L443 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-16 00:06:36,559 INFO L443 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-16 00:06:36,559 INFO L443 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-16 00:06:36,559 INFO L443 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-16 00:06:36,559 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-16 00:06:36,559 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-16 00:06:36,559 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-16 00:06:36,559 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-16 00:06:36,559 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-16 00:06:36,560 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-16 00:06:36,560 INFO L443 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-16 00:06:36,560 INFO L443 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,560 INFO L443 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,560 INFO L443 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,560 INFO L443 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,560 INFO L443 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,560 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-16 00:06:36,560 INFO L443 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-16 00:06:36,560 INFO L443 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-16 00:06:36,560 INFO L443 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-16 00:06:36,560 INFO L443 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-16 00:06:36,561 INFO L443 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-16 00:06:36,561 INFO L443 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-16 00:06:36,561 INFO L443 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-16 00:06:36,561 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-16 00:06:36,564 INFO L439 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (= ~a21~0 1))) (or (and (not (= ~a16~0 6)) .cse0) (= 1 ~a7~0) (and (= ~a17~0 1) .cse0 (= ~a20~0 1)) (and .cse0 (= 15 ~a8~0)))) [2019-11-16 00:06:36,564 INFO L443 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,565 INFO L443 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,565 INFO L443 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,565 INFO L443 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,565 INFO L443 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,565 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-16 00:06:36,565 INFO L443 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-16 00:06:36,566 INFO L443 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-16 00:06:36,566 INFO L443 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-16 00:06:36,566 INFO L443 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-16 00:06:36,566 INFO L443 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-16 00:06:36,566 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-16 00:06:36,566 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-16 00:06:36,566 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-16 00:06:36,566 INFO L443 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-16 00:06:36,567 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-16 00:06:36,567 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-16 00:06:36,567 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-16 00:06:36,567 INFO L446 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-16 00:06:36,567 INFO L443 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,567 INFO L443 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,568 INFO L443 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,568 INFO L443 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,568 INFO L443 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,568 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-16 00:06:36,568 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-16 00:06:36,568 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-16 00:06:36,568 INFO L443 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-16 00:06:36,569 INFO L443 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-16 00:06:36,569 INFO L443 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-16 00:06:36,569 INFO L443 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-16 00:06:36,569 INFO L443 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-16 00:06:36,569 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-16 00:06:36,569 INFO L443 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,569 INFO L443 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,570 INFO L443 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,570 INFO L443 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,570 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-16 00:06:36,570 INFO L443 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,570 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-16 00:06:36,570 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-16 00:06:36,570 INFO L443 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-16 00:06:36,571 INFO L443 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-16 00:06:36,571 INFO L443 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-16 00:06:36,571 INFO L443 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-16 00:06:36,571 INFO L443 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-16 00:06:36,571 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-16 00:06:36,571 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-16 00:06:36,571 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-16 00:06:36,572 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-16 00:06:36,572 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-16 00:06:36,572 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-16 00:06:36,572 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-16 00:06:36,572 INFO L443 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,572 INFO L439 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (= ~a21~0 1))) (or (and (not (= ~a16~0 6)) .cse0) (= 1 ~a7~0) (and (= ~a17~0 1) .cse0 (= ~a20~0 1)) (and .cse0 (= 15 ~a8~0)))) [2019-11-16 00:06:36,573 INFO L443 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,573 INFO L443 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,573 INFO L443 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,573 INFO L443 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,573 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-16 00:06:36,573 INFO L443 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-16 00:06:36,573 INFO L443 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-16 00:06:36,574 INFO L443 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-16 00:06:36,574 INFO L443 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-16 00:06:36,574 INFO L443 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-16 00:06:36,574 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-16 00:06:36,574 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-16 00:06:36,574 INFO L443 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,574 INFO L443 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,575 INFO L443 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,575 INFO L443 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,575 INFO L443 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,575 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-16 00:06:36,575 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-16 00:06:36,575 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-16 00:06:36,575 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-16 00:06:36,576 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-16 00:06:36,576 INFO L443 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-16 00:06:36,576 INFO L443 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-16 00:06:36,576 INFO L443 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-16 00:06:36,576 INFO L443 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-16 00:06:36,576 INFO L443 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-16 00:06:36,576 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-16 00:06:36,577 INFO L443 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-16 00:06:36,577 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-16 00:06:36,577 INFO L443 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,577 INFO L443 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,577 INFO L443 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,577 INFO L443 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,577 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-16 00:06:36,577 INFO L443 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,578 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,578 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-16 00:06:36,578 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-16 00:06:36,578 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-16 00:06:36,578 INFO L443 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-16 00:06:36,578 INFO L443 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-16 00:06:36,578 INFO L443 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-16 00:06:36,579 INFO L443 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-16 00:06:36,579 INFO L443 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-16 00:06:36,579 INFO L443 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-16 00:06:36,579 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-16 00:06:36,579 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-16 00:06:36,579 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-16 00:06:36,579 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-16 00:06:36,580 INFO L443 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,580 INFO L443 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,580 INFO L443 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,580 INFO L443 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,580 INFO L443 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,580 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-16 00:06:36,581 INFO L443 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,581 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-16 00:06:36,581 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-16 00:06:36,581 INFO L443 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-16 00:06:36,581 INFO L443 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-16 00:06:36,581 INFO L443 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-16 00:06:36,581 INFO L443 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-16 00:06:36,581 INFO L443 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-16 00:06:36,582 INFO L443 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-16 00:06:36,582 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-16 00:06:36,582 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-16 00:06:36,582 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-16 00:06:36,582 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-16 00:06:36,582 INFO L443 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-16 00:06:36,582 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-16 00:06:36,583 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-16 00:06:36,583 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 560) no Hoare annotation was computed. [2019-11-16 00:06:36,583 INFO L443 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,583 INFO L443 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,583 INFO L443 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,583 INFO L443 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,584 INFO L443 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,584 INFO L443 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:06:36,584 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-16 00:06:36,584 INFO L443 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-16 00:06:36,584 INFO L443 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-16 00:06:36,584 INFO L443 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-16 00:06:36,584 INFO L443 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-16 00:06:36,584 INFO L443 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-16 00:06:36,585 INFO L443 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-16 00:06:36,585 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-16 00:06:36,585 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-16 00:06:36,585 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-16 00:06:36,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:06:36 BoogieIcfgContainer [2019-11-16 00:06:36,601 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:06:36,601 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:06:36,602 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:06:36,602 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:06:36,602 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:06:27" (3/4) ... [2019-11-16 00:06:36,606 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:06:36,624 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-16 00:06:36,626 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-16 00:06:36,832 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_2624860e-0bce-4037-98d2-a886815f2ef9/bin/uautomizer/witness.graphml [2019-11-16 00:06:36,832 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:06:36,834 INFO L168 Benchmark]: Toolchain (without parser) took 11124.91 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 230.2 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -159.1 MB). Peak memory consumption was 71.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:06:36,834 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:06:36,835 INFO L168 Benchmark]: CACSL2BoogieTranslator took 651.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -141.6 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:06:36,835 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:06:36,836 INFO L168 Benchmark]: Boogie Preprocessor took 76.35 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:06:36,838 INFO L168 Benchmark]: RCFGBuilder took 1328.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 962.3 MB in the end (delta: 109.3 MB). Peak memory consumption was 109.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:06:36,838 INFO L168 Benchmark]: TraceAbstraction took 8744.27 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 119.5 MB). Free memory was 962.3 MB in the beginning and 1.1 GB in the end (delta: -156.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:06:36,839 INFO L168 Benchmark]: Witness Printer took 230.61 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:06:36,841 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 651.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -141.6 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 84.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 76.35 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1328.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 962.3 MB in the end (delta: 109.3 MB). Peak memory consumption was 109.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8744.27 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 119.5 MB). Free memory was 962.3 MB in the beginning and 1.1 GB in the end (delta: -156.4 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 230.61 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 560]: 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: (((!(a16 == 6) && a21 == 1) || 1 == a7) || ((a17 == 1 && a21 == 1) && a20 == 1)) || (a21 == 1 && 15 == a8) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((!(a16 == 6) && a21 == 1) || 1 == a7) || ((a17 == 1 && a21 == 1) && a20 == 1)) || (a21 == 1 && 15 == a8) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 8.6s, OverallIterations: 8, TraceHistogramMax: 6, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 657 SDtfs, 1758 SDslu, 81 SDs, 0 SdLazy, 3723 SolverSat, 641 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1503occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 655 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 38 NumberOfFragments, 59 HoareAnnotationTreeSize, 3 FomulaSimplifications, 798 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 64 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1392 NumberOfCodeBlocks, 1392 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1384 ConstructedInterpolants, 0 QuantifiedInterpolants, 733928 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 686/686 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...