./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label51.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/working_dir_18e34936-a17a-49c7-b005-e642d08e79a8/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_18e34936-a17a-49c7-b005-e642d08e79a8/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_18e34936-a17a-49c7-b005-e642d08e79a8/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_18e34936-a17a-49c7-b005-e642d08e79a8/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label51.c -s /tmp/vcloud-vcloud-master/worker/working_dir_18e34936-a17a-49c7-b005-e642d08e79a8/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_18e34936-a17a-49c7-b005-e642d08e79a8/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 1924a8dde25e8984c73792fdb4b4e419be9487c7 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:54:47,928 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:54:47,930 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:54:47,949 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:54:47,949 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:54:47,950 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:54:47,952 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:54:47,953 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:54:47,954 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:54:47,955 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:54:47,956 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:54:47,957 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:54:47,957 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:54:47,958 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:54:47,959 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:54:47,960 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:54:47,960 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:54:47,961 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:54:47,962 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:54:47,964 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:54:47,965 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:54:47,966 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:54:47,967 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:54:47,967 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:54:47,969 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:54:47,970 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:54:47,970 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:54:47,971 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:54:47,971 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:54:47,972 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:54:47,972 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:54:47,973 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:54:47,973 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:54:47,974 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:54:47,975 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:54:47,975 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:54:47,976 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:54:47,976 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:54:47,976 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:54:47,977 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:54:47,977 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:54:47,978 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_18e34936-a17a-49c7-b005-e642d08e79a8/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 08:54:47,988 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:54:47,989 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:54:47,990 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:54:47,990 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:54:47,990 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:54:47,990 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:54:47,991 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:54:47,991 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:54:47,991 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:54:47,991 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:54:47,991 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 08:54:47,991 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:54:47,991 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 08:54:47,992 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:54:47,992 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:54:47,992 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:54:47,992 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 08:54:47,992 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:54:47,992 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:54:47,992 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:54:47,993 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:54:47,993 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:54:47,993 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:54:47,993 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:54:47,993 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 08:54:47,993 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:54:47,993 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 08:54:47,994 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 08:54:47,994 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/working_dir_18e34936-a17a-49c7-b005-e642d08e79a8/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 -> 1924a8dde25e8984c73792fdb4b4e419be9487c7 [2019-10-22 08:54:48,017 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:54:48,027 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:54:48,030 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:54:48,031 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:54:48,031 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:54:48,032 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_18e34936-a17a-49c7-b005-e642d08e79a8/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem01_label51.c [2019-10-22 08:54:48,083 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_18e34936-a17a-49c7-b005-e642d08e79a8/bin/uautomizer/data/68e9a8a62/7f5af1cecb1e401e9cec586ae97e306c/FLAGb9e5ae00a [2019-10-22 08:54:48,530 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:54:48,531 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_18e34936-a17a-49c7-b005-e642d08e79a8/sv-benchmarks/c/eca-rers2012/Problem01_label51.c [2019-10-22 08:54:48,540 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_18e34936-a17a-49c7-b005-e642d08e79a8/bin/uautomizer/data/68e9a8a62/7f5af1cecb1e401e9cec586ae97e306c/FLAGb9e5ae00a [2019-10-22 08:54:48,861 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_18e34936-a17a-49c7-b005-e642d08e79a8/bin/uautomizer/data/68e9a8a62/7f5af1cecb1e401e9cec586ae97e306c [2019-10-22 08:54:48,863 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:54:48,864 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:54:48,865 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:48,866 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:54:48,871 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:54:48,872 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:48" (1/1) ... [2019-10-22 08:54:48,874 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51cfaec6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:48, skipping insertion in model container [2019-10-22 08:54:48,874 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:48" (1/1) ... [2019-10-22 08:54:48,880 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:54:48,927 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:54:49,380 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:49,385 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:54:49,467 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:49,484 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:54:49,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:49 WrapperNode [2019-10-22 08:54:49,485 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:49,486 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:49,486 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:54:49,486 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:54:49,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:49" (1/1) ... [2019-10-22 08:54:49,526 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:49" (1/1) ... [2019-10-22 08:54:49,589 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:49,589 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:54:49,590 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:54:49,590 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:54:49,599 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:49" (1/1) ... [2019-10-22 08:54:49,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:49" (1/1) ... [2019-10-22 08:54:49,603 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:49" (1/1) ... [2019-10-22 08:54:49,604 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:49" (1/1) ... [2019-10-22 08:54:49,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:49" (1/1) ... [2019-10-22 08:54:49,649 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:49" (1/1) ... [2019-10-22 08:54:49,652 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:49" (1/1) ... [2019-10-22 08:54:49,656 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:54:49,657 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:54:49,657 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:54:49,657 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:54:49,658 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18e34936-a17a-49c7-b005-e642d08e79a8/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-10-22 08:54:49,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:54:49,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:54:50,653 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:54:50,653 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 08:54:50,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:50 BoogieIcfgContainer [2019-10-22 08:54:50,655 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:54:50,655 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:54:50,656 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:54:50,659 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:54:50,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:54:48" (1/3) ... [2019-10-22 08:54:50,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@590ee427 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:54:50, skipping insertion in model container [2019-10-22 08:54:50,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:49" (2/3) ... [2019-10-22 08:54:50,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@590ee427 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:54:50, skipping insertion in model container [2019-10-22 08:54:50,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:50" (3/3) ... [2019-10-22 08:54:50,662 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label51.c [2019-10-22 08:54:50,671 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:54:50,678 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 08:54:50,687 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 08:54:50,707 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:54:50,707 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 08:54:50,707 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:54:50,707 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:54:50,708 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:54:50,708 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:54:50,708 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:54:50,708 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:54:50,724 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-10-22 08:54:50,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-22 08:54:50,733 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:50,734 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] [2019-10-22 08:54:50,736 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:50,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:50,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1145971337, now seen corresponding path program 1 times [2019-10-22 08:54:50,750 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:50,750 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049153435] [2019-10-22 08:54:50,751 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:50,751 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:50,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:50,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:51,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:51,112 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049153435] [2019-10-22 08:54:51,113 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:51,113 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:54:51,114 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141239482] [2019-10-22 08:54:51,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:51,118 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:51,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:51,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:51,134 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 3 states. [2019-10-22 08:54:52,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:52,033 INFO L93 Difference]: Finished difference Result 528 states and 915 transitions. [2019-10-22 08:54:52,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:52,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-10-22 08:54:52,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:52,053 INFO L225 Difference]: With dead ends: 528 [2019-10-22 08:54:52,056 INFO L226 Difference]: Without dead ends: 266 [2019-10-22 08:54:52,061 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-10-22 08:54:52,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-10-22 08:54:52,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2019-10-22 08:54:52,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-10-22 08:54:52,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2019-10-22 08:54:52,114 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 106 [2019-10-22 08:54:52,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:52,115 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2019-10-22 08:54:52,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:52,115 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2019-10-22 08:54:52,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-22 08:54:52,118 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:52,118 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 08:54:52,119 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:52,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:52,119 INFO L82 PathProgramCache]: Analyzing trace with hash 366337359, now seen corresponding path program 1 times [2019-10-22 08:54:52,119 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:52,120 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170245609] [2019-10-22 08:54:52,120 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:52,120 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:52,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:52,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:52,176 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170245609] [2019-10-22 08:54:52,176 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:52,176 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:52,176 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498777373] [2019-10-22 08:54:52,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:54:52,178 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:52,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:54:52,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:54:52,179 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand 4 states. [2019-10-22 08:54:52,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:52,717 INFO L93 Difference]: Finished difference Result 792 states and 1135 transitions. [2019-10-22 08:54:52,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:52,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-10-22 08:54:52,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:52,721 INFO L225 Difference]: With dead ends: 792 [2019-10-22 08:54:52,721 INFO L226 Difference]: Without dead ends: 528 [2019-10-22 08:54:52,723 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-10-22 08:54:52,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-10-22 08:54:52,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2019-10-22 08:54:52,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-10-22 08:54:52,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 720 transitions. [2019-10-22 08:54:52,765 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 720 transitions. Word has length 111 [2019-10-22 08:54:52,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:52,765 INFO L462 AbstractCegarLoop]: Abstraction has 528 states and 720 transitions. [2019-10-22 08:54:52,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:54:52,766 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 720 transitions. [2019-10-22 08:54:52,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-22 08:54:52,770 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:52,771 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-22 08:54:52,771 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:52,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:52,771 INFO L82 PathProgramCache]: Analyzing trace with hash -206300869, now seen corresponding path program 1 times [2019-10-22 08:54:52,771 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:52,772 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846923191] [2019-10-22 08:54:52,772 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:52,772 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:52,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:52,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:52,850 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:52,851 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846923191] [2019-10-22 08:54:52,852 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:52,852 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:54:52,852 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271702389] [2019-10-22 08:54:52,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:52,854 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:52,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:52,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:52,855 INFO L87 Difference]: Start difference. First operand 528 states and 720 transitions. Second operand 3 states. [2019-10-22 08:54:53,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:53,281 INFO L93 Difference]: Finished difference Result 1185 states and 1617 transitions. [2019-10-22 08:54:53,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:53,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-10-22 08:54:53,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:53,285 INFO L225 Difference]: With dead ends: 1185 [2019-10-22 08:54:53,285 INFO L226 Difference]: Without dead ends: 659 [2019-10-22 08:54:53,288 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-10-22 08:54:53,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-10-22 08:54:53,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 528. [2019-10-22 08:54:53,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-10-22 08:54:53,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 714 transitions. [2019-10-22 08:54:53,328 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 714 transitions. Word has length 119 [2019-10-22 08:54:53,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:53,329 INFO L462 AbstractCegarLoop]: Abstraction has 528 states and 714 transitions. [2019-10-22 08:54:53,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:53,329 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 714 transitions. [2019-10-22 08:54:53,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-22 08:54:53,342 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:53,342 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2019-10-22 08:54:53,342 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:53,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:53,343 INFO L82 PathProgramCache]: Analyzing trace with hash -118652371, now seen corresponding path program 1 times [2019-10-22 08:54:53,343 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:53,343 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711672166] [2019-10-22 08:54:53,343 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:53,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:53,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:53,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:53,421 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-22 08:54:53,421 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711672166] [2019-10-22 08:54:53,422 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:53,422 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:53,422 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050270994] [2019-10-22 08:54:53,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:54:53,423 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:53,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:54:53,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:54:53,423 INFO L87 Difference]: Start difference. First operand 528 states and 714 transitions. Second operand 4 states. [2019-10-22 08:54:54,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:54,030 INFO L93 Difference]: Finished difference Result 1971 states and 2669 transitions. [2019-10-22 08:54:54,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:54:54,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-10-22 08:54:54,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:54,036 INFO L225 Difference]: With dead ends: 1971 [2019-10-22 08:54:54,036 INFO L226 Difference]: Without dead ends: 1445 [2019-10-22 08:54:54,037 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-10-22 08:54:54,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-10-22 08:54:54,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1314. [2019-10-22 08:54:54,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2019-10-22 08:54:54,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1706 transitions. [2019-10-22 08:54:54,069 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1706 transitions. Word has length 128 [2019-10-22 08:54:54,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:54,069 INFO L462 AbstractCegarLoop]: Abstraction has 1314 states and 1706 transitions. [2019-10-22 08:54:54,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:54:54,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1706 transitions. [2019-10-22 08:54:54,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-22 08:54:54,072 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:54,072 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 08:54:54,073 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:54,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:54,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1007946460, now seen corresponding path program 1 times [2019-10-22 08:54:54,073 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:54,073 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171007184] [2019-10-22 08:54:54,073 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:54,074 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:54,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:54,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:54,172 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-22 08:54:54,173 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171007184] [2019-10-22 08:54:54,173 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:54,173 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:54,173 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882556305] [2019-10-22 08:54:54,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:54:54,174 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:54,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:54:54,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:54:54,174 INFO L87 Difference]: Start difference. First operand 1314 states and 1706 transitions. Second operand 4 states. [2019-10-22 08:54:54,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:54,708 INFO L93 Difference]: Finished difference Result 2762 states and 3564 transitions. [2019-10-22 08:54:54,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:54:54,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-10-22 08:54:54,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:54,712 INFO L225 Difference]: With dead ends: 2762 [2019-10-22 08:54:54,712 INFO L226 Difference]: Without dead ends: 1450 [2019-10-22 08:54:54,714 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:54:54,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2019-10-22 08:54:54,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1445. [2019-10-22 08:54:54,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-10-22 08:54:54,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1843 transitions. [2019-10-22 08:54:54,743 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1843 transitions. Word has length 134 [2019-10-22 08:54:54,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:54,744 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1843 transitions. [2019-10-22 08:54:54,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:54:54,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1843 transitions. [2019-10-22 08:54:54,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-22 08:54:54,747 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:54,747 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 08:54:54,747 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:54,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:54,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1361139476, now seen corresponding path program 1 times [2019-10-22 08:54:54,748 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:54,748 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606577601] [2019-10-22 08:54:54,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:54,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:54,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:54,894 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-22 08:54:54,894 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606577601] [2019-10-22 08:54:54,895 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:54,895 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:54:54,895 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980638375] [2019-10-22 08:54:54,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:54:54,895 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:54,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:54:54,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:54:54,896 INFO L87 Difference]: Start difference. First operand 1445 states and 1843 transitions. Second operand 5 states. [2019-10-22 08:54:55,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:55,660 INFO L93 Difference]: Finished difference Result 2888 states and 3696 transitions. [2019-10-22 08:54:55,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:54:55,661 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2019-10-22 08:54:55,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:55,665 INFO L225 Difference]: With dead ends: 2888 [2019-10-22 08:54:55,665 INFO L226 Difference]: Without dead ends: 1576 [2019-10-22 08:54:55,667 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-10-22 08:54:55,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2019-10-22 08:54:55,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1576. [2019-10-22 08:54:55,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-10-22 08:54:55,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1968 transitions. [2019-10-22 08:54:55,696 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1968 transitions. Word has length 138 [2019-10-22 08:54:55,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:55,697 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 1968 transitions. [2019-10-22 08:54:55,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:54:55,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1968 transitions. [2019-10-22 08:54:55,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-22 08:54:55,700 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:55,700 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 08:54:55,700 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:55,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:55,700 INFO L82 PathProgramCache]: Analyzing trace with hash -892874449, now seen corresponding path program 1 times [2019-10-22 08:54:55,700 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:55,701 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599142918] [2019-10-22 08:54:55,701 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:55,701 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:55,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:55,739 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-22 08:54:55,740 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599142918] [2019-10-22 08:54:55,740 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:55,740 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:55,740 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392198873] [2019-10-22 08:54:55,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:55,741 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:55,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:55,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:55,741 INFO L87 Difference]: Start difference. First operand 1576 states and 1968 transitions. Second operand 3 states. [2019-10-22 08:54:56,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:56,172 INFO L93 Difference]: Finished difference Result 3674 states and 4634 transitions. [2019-10-22 08:54:56,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:56,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-10-22 08:54:56,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:56,178 INFO L225 Difference]: With dead ends: 3674 [2019-10-22 08:54:56,179 INFO L226 Difference]: Without dead ends: 1969 [2019-10-22 08:54:56,180 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-10-22 08:54:56,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-10-22 08:54:56,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1707. [2019-10-22 08:54:56,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-10-22 08:54:56,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1924 transitions. [2019-10-22 08:54:56,213 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1924 transitions. Word has length 141 [2019-10-22 08:54:56,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:56,213 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 1924 transitions. [2019-10-22 08:54:56,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:56,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1924 transitions. [2019-10-22 08:54:56,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-22 08:54:56,216 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:56,216 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 08:54:56,217 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:56,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:56,217 INFO L82 PathProgramCache]: Analyzing trace with hash 468657843, now seen corresponding path program 1 times [2019-10-22 08:54:56,217 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:56,217 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465884768] [2019-10-22 08:54:56,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:56,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:56,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:56,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:56,344 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:56,344 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465884768] [2019-10-22 08:54:56,345 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:56,345 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:54:56,345 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941546386] [2019-10-22 08:54:56,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:54:56,345 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:56,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:54:56,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:54:56,346 INFO L87 Difference]: Start difference. First operand 1707 states and 1924 transitions. Second operand 5 states. [2019-10-22 08:54:57,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:57,248 INFO L93 Difference]: Finished difference Result 4593 states and 5243 transitions. [2019-10-22 08:54:57,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:54:57,249 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2019-10-22 08:54:57,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:57,258 INFO L225 Difference]: With dead ends: 4593 [2019-10-22 08:54:57,259 INFO L226 Difference]: Without dead ends: 3019 [2019-10-22 08:54:57,261 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-10-22 08:54:57,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3019 states. [2019-10-22 08:54:57,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3019 to 2493. [2019-10-22 08:54:57,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2493 states. [2019-10-22 08:54:57,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2493 states to 2493 states and 2762 transitions. [2019-10-22 08:54:57,314 INFO L78 Accepts]: Start accepts. Automaton has 2493 states and 2762 transitions. Word has length 156 [2019-10-22 08:54:57,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:57,314 INFO L462 AbstractCegarLoop]: Abstraction has 2493 states and 2762 transitions. [2019-10-22 08:54:57,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:54:57,315 INFO L276 IsEmpty]: Start isEmpty. Operand 2493 states and 2762 transitions. [2019-10-22 08:54:57,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-22 08:54:57,319 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:57,319 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 08:54:57,319 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:57,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:57,320 INFO L82 PathProgramCache]: Analyzing trace with hash -779622233, now seen corresponding path program 1 times [2019-10-22 08:54:57,320 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:57,320 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343070913] [2019-10-22 08:54:57,320 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:57,320 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:57,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:57,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:57,449 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-22 08:54:57,450 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343070913] [2019-10-22 08:54:57,450 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:57,450 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:54:57,450 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119155044] [2019-10-22 08:54:57,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:54:57,451 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:57,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:54:57,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:54:57,451 INFO L87 Difference]: Start difference. First operand 2493 states and 2762 transitions. Second operand 4 states. [2019-10-22 08:54:58,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:58,140 INFO L93 Difference]: Finished difference Result 5508 states and 6131 transitions. [2019-10-22 08:54:58,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:54:58,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2019-10-22 08:54:58,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:58,150 INFO L225 Difference]: With dead ends: 5508 [2019-10-22 08:54:58,150 INFO L226 Difference]: Without dead ends: 2886 [2019-10-22 08:54:58,153 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:54:58,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2886 states. [2019-10-22 08:54:58,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2886 to 2493. [2019-10-22 08:54:58,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2493 states. [2019-10-22 08:54:58,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2493 states to 2493 states and 2683 transitions. [2019-10-22 08:54:58,242 INFO L78 Accepts]: Start accepts. Automaton has 2493 states and 2683 transitions. Word has length 185 [2019-10-22 08:54:58,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:58,243 INFO L462 AbstractCegarLoop]: Abstraction has 2493 states and 2683 transitions. [2019-10-22 08:54:58,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:54:58,243 INFO L276 IsEmpty]: Start isEmpty. Operand 2493 states and 2683 transitions. [2019-10-22 08:54:58,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-10-22 08:54:58,250 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:58,251 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 08:54:58,251 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:58,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:58,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1645730410, now seen corresponding path program 1 times [2019-10-22 08:54:58,258 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:58,258 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647575144] [2019-10-22 08:54:58,258 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:58,258 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:58,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:58,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:58,435 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-10-22 08:54:58,435 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647575144] [2019-10-22 08:54:58,436 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:58,436 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:54:58,438 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297016169] [2019-10-22 08:54:58,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:54:58,438 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:58,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:54:58,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:54:58,439 INFO L87 Difference]: Start difference. First operand 2493 states and 2683 transitions. Second operand 6 states. [2019-10-22 08:54:59,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:59,046 INFO L93 Difference]: Finished difference Result 5162 states and 5545 transitions. [2019-10-22 08:54:59,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:54:59,046 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 276 [2019-10-22 08:54:59,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:59,053 INFO L225 Difference]: With dead ends: 5162 [2019-10-22 08:54:59,053 INFO L226 Difference]: Without dead ends: 2671 [2019-10-22 08:54:59,056 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:54:59,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2671 states. [2019-10-22 08:54:59,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2671 to 2362. [2019-10-22 08:54:59,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2362 states. [2019-10-22 08:54:59,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 2529 transitions. [2019-10-22 08:54:59,096 INFO L78 Accepts]: Start accepts. Automaton has 2362 states and 2529 transitions. Word has length 276 [2019-10-22 08:54:59,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:59,097 INFO L462 AbstractCegarLoop]: Abstraction has 2362 states and 2529 transitions. [2019-10-22 08:54:59,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:54:59,097 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 2529 transitions. [2019-10-22 08:54:59,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-10-22 08:54:59,102 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:59,103 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:59,103 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:59,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:59,103 INFO L82 PathProgramCache]: Analyzing trace with hash -731842585, now seen corresponding path program 1 times [2019-10-22 08:54:59,103 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:59,103 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744922533] [2019-10-22 08:54:59,103 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:59,103 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:59,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:59,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:59,214 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-10-22 08:54:59,214 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744922533] [2019-10-22 08:54:59,214 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:59,214 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:59,214 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912798533] [2019-10-22 08:54:59,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:59,215 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:59,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:59,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:59,215 INFO L87 Difference]: Start difference. First operand 2362 states and 2529 transitions. Second operand 3 states. [2019-10-22 08:54:59,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:59,572 INFO L93 Difference]: Finished difference Result 4982 states and 5344 transitions. [2019-10-22 08:54:59,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:59,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2019-10-22 08:54:59,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:59,572 INFO L225 Difference]: With dead ends: 4982 [2019-10-22 08:54:59,572 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 08:54:59,575 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-10-22 08:54:59,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 08:54:59,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 08:54:59,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 08:54:59,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 08:54:59,576 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 292 [2019-10-22 08:54:59,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:59,576 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:54:59,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:59,576 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:54:59,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 08:54:59,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 08:54:59,826 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2019-10-22 08:54:59,961 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2019-10-22 08:54:59,963 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-10-22 08:54:59,963 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-10-22 08:54:59,963 INFO L443 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,963 INFO L443 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,963 INFO L443 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,963 INFO L443 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,963 INFO L443 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,963 INFO L443 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,963 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-10-22 08:54:59,963 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-10-22 08:54:59,963 INFO L443 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-10-22 08:54:59,963 INFO L443 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-10-22 08:54:59,964 INFO L443 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-10-22 08:54:59,964 INFO L443 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-10-22 08:54:59,964 INFO L443 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-10-22 08:54:59,964 INFO L443 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-10-22 08:54:59,964 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-10-22 08:54:59,964 INFO L443 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-10-22 08:54:59,964 INFO L443 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,964 INFO L443 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,964 INFO L443 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,964 INFO L443 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,964 INFO L443 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,964 INFO L443 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,964 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-10-22 08:54:59,964 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-10-22 08:54:59,965 INFO L443 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-10-22 08:54:59,965 INFO L443 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-10-22 08:54:59,965 INFO L443 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-10-22 08:54:59,965 INFO L443 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-10-22 08:54:59,965 INFO L443 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-10-22 08:54:59,965 INFO L443 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-10-22 08:54:59,965 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-10-22 08:54:59,965 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-10-22 08:54:59,965 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-10-22 08:54:59,965 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-10-22 08:54:59,965 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-10-22 08:54:59,965 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-10-22 08:54:59,965 INFO L443 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-10-22 08:54:59,965 INFO L443 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,965 INFO L443 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,966 INFO L443 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,966 INFO L443 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,966 INFO L443 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,966 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-10-22 08:54:59,966 INFO L443 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-10-22 08:54:59,966 INFO L443 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-10-22 08:54:59,966 INFO L443 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-10-22 08:54:59,966 INFO L443 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-10-22 08:54:59,966 INFO L443 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-10-22 08:54:59,966 INFO L443 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-10-22 08:54:59,967 INFO L443 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-10-22 08:54:59,967 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-10-22 08:54:59,968 INFO L439 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse6 (= ~a17~0 1))) (let ((.cse1 (= ~a16~0 4)) (.cse3 (<= ~a17~0 0)) (.cse0 (not (= ~a20~0 1))) (.cse5 (= 5 ~a16~0)) (.cse4 (= 15 ~a8~0)) (.cse2 (not .cse6)) (.cse7 (= ~a16~0 6))) (or (= 1 ~a7~0) (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse6 (= ~a21~0 1)) (and .cse1 .cse3) (and .cse0 .cse4 .cse7) (and .cse0 .cse5) (and (and .cse4 .cse2) .cse7)))) [2019-10-22 08:54:59,968 INFO L443 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,968 INFO L443 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,968 INFO L443 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,968 INFO L443 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,968 INFO L443 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,968 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-10-22 08:54:59,968 INFO L443 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-10-22 08:54:59,968 INFO L443 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-10-22 08:54:59,969 INFO L443 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-10-22 08:54:59,969 INFO L443 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-10-22 08:54:59,969 INFO L443 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-10-22 08:54:59,969 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-10-22 08:54:59,969 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-10-22 08:54:59,969 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-10-22 08:54:59,969 INFO L443 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-10-22 08:54:59,969 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-10-22 08:54:59,969 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-10-22 08:54:59,969 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-10-22 08:54:59,969 INFO L446 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-10-22 08:54:59,969 INFO L443 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,969 INFO L443 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,970 INFO L443 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,970 INFO L443 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,970 INFO L443 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,970 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-10-22 08:54:59,970 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-10-22 08:54:59,970 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-10-22 08:54:59,970 INFO L443 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-10-22 08:54:59,970 INFO L443 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-10-22 08:54:59,970 INFO L443 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-10-22 08:54:59,970 INFO L443 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-10-22 08:54:59,970 INFO L443 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-10-22 08:54:59,970 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-10-22 08:54:59,970 INFO L443 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,971 INFO L443 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,971 INFO L443 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,971 INFO L443 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,971 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-10-22 08:54:59,971 INFO L443 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,971 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-10-22 08:54:59,971 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-10-22 08:54:59,971 INFO L443 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-10-22 08:54:59,971 INFO L443 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-10-22 08:54:59,971 INFO L443 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-10-22 08:54:59,971 INFO L443 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-10-22 08:54:59,971 INFO L443 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-10-22 08:54:59,971 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 08:54:59,972 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-10-22 08:54:59,972 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-10-22 08:54:59,972 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-10-22 08:54:59,972 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-10-22 08:54:59,972 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-10-22 08:54:59,972 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-10-22 08:54:59,972 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 494) no Hoare annotation was computed. [2019-10-22 08:54:59,972 INFO L443 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,972 INFO L439 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse6 (= ~a17~0 1))) (let ((.cse1 (= ~a16~0 4)) (.cse3 (<= ~a17~0 0)) (.cse0 (not (= ~a20~0 1))) (.cse5 (= 5 ~a16~0)) (.cse4 (= 15 ~a8~0)) (.cse2 (not .cse6)) (.cse7 (= ~a16~0 6))) (or (= 1 ~a7~0) (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse6 (= ~a21~0 1)) (and .cse1 .cse3) (and .cse0 .cse4 .cse7) (and .cse0 .cse5) (and (and .cse4 .cse2) .cse7)))) [2019-10-22 08:54:59,972 INFO L443 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,972 INFO L443 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,973 INFO L443 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,973 INFO L443 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,973 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-10-22 08:54:59,973 INFO L443 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-10-22 08:54:59,973 INFO L443 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-10-22 08:54:59,973 INFO L443 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-10-22 08:54:59,973 INFO L443 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-10-22 08:54:59,973 INFO L443 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-10-22 08:54:59,973 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-10-22 08:54:59,973 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-10-22 08:54:59,973 INFO L443 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,973 INFO L443 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,973 INFO L443 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,973 INFO L443 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,973 INFO L443 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,973 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-10-22 08:54:59,974 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 08:54:59,974 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-10-22 08:54:59,974 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-10-22 08:54:59,974 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-10-22 08:54:59,974 INFO L443 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-10-22 08:54:59,974 INFO L443 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-10-22 08:54:59,974 INFO L443 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-10-22 08:54:59,974 INFO L443 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-10-22 08:54:59,974 INFO L443 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-10-22 08:54:59,974 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-10-22 08:54:59,974 INFO L443 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-10-22 08:54:59,976 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-10-22 08:54:59,976 INFO L443 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,976 INFO L443 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,976 INFO L443 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,976 INFO L443 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,976 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-10-22 08:54:59,976 INFO L443 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,976 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,976 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-10-22 08:54:59,976 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-10-22 08:54:59,976 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 08:54:59,976 INFO L443 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-10-22 08:54:59,976 INFO L443 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-10-22 08:54:59,977 INFO L443 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-10-22 08:54:59,977 INFO L443 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-10-22 08:54:59,977 INFO L443 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-10-22 08:54:59,977 INFO L443 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-10-22 08:54:59,977 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-10-22 08:54:59,977 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-10-22 08:54:59,977 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-10-22 08:54:59,977 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-10-22 08:54:59,977 INFO L443 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,977 INFO L443 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,977 INFO L443 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,977 INFO L443 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,977 INFO L443 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,977 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-10-22 08:54:59,977 INFO L443 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,977 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-10-22 08:54:59,978 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-10-22 08:54:59,978 INFO L443 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-10-22 08:54:59,978 INFO L443 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-10-22 08:54:59,978 INFO L443 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-10-22 08:54:59,978 INFO L443 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-10-22 08:54:59,978 INFO L443 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-10-22 08:54:59,978 INFO L443 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-10-22 08:54:59,978 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-10-22 08:54:59,978 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-10-22 08:54:59,978 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-10-22 08:54:59,978 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-10-22 08:54:59,978 INFO L443 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-10-22 08:54:59,978 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-10-22 08:54:59,978 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-10-22 08:54:59,979 INFO L443 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,979 INFO L443 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,979 INFO L443 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,979 INFO L443 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,979 INFO L443 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,979 INFO L443 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:54:59,979 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-10-22 08:54:59,979 INFO L443 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-10-22 08:54:59,979 INFO L443 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-10-22 08:54:59,979 INFO L443 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-10-22 08:54:59,979 INFO L443 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-10-22 08:54:59,979 INFO L443 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-10-22 08:54:59,979 INFO L443 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-10-22 08:54:59,980 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-10-22 08:54:59,980 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-10-22 08:54:59,980 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-10-22 08:54:59,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:54:59 BoogieIcfgContainer [2019-10-22 08:54:59,997 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:54:59,997 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:54:59,997 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:54:59,997 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:55:00,003 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:50" (3/4) ... [2019-10-22 08:55:00,005 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 08:55:00,023 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-10-22 08:55:00,031 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 08:55:00,161 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_18e34936-a17a-49c7-b005-e642d08e79a8/bin/uautomizer/witness.graphml [2019-10-22 08:55:00,161 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:55:00,162 INFO L168 Benchmark]: Toolchain (without parser) took 11297.99 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 411.6 MB). Free memory was 940.5 MB in the beginning and 1.2 GB in the end (delta: -286.5 MB). Peak memory consumption was 125.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:00,163 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:00,163 INFO L168 Benchmark]: CACSL2BoogieTranslator took 619.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 940.5 MB in the beginning and 1.1 GB in the end (delta: -162.3 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:00,163 INFO L168 Benchmark]: Boogie Procedure Inliner took 103.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:00,163 INFO L168 Benchmark]: Boogie Preprocessor took 66.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:00,164 INFO L168 Benchmark]: RCFGBuilder took 998.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 977.3 MB in the end (delta: 114.7 MB). Peak memory consumption was 114.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:00,164 INFO L168 Benchmark]: TraceAbstraction took 9341.42 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 285.7 MB). Free memory was 977.3 MB in the beginning and 1.3 GB in the end (delta: -277.0 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:00,164 INFO L168 Benchmark]: Witness Printer took 163.79 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:00,166 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 619.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 940.5 MB in the beginning and 1.1 GB in the end (delta: -162.3 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 103.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 66.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 998.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 977.3 MB in the end (delta: 114.7 MB). Peak memory consumption was 114.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9341.42 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 285.7 MB). Free memory was 977.3 MB in the beginning and 1.3 GB in the end (delta: -277.0 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. * Witness Printer took 163.79 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 494]: 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: ((((((1 == a7 || ((!(a20 == 1) && a16 == 4) && !(a17 == 1))) || ((a17 <= 0 && 15 == a8) && 5 == a16)) || (a17 == 1 && a21 == 1)) || (a16 == 4 && a17 <= 0)) || ((!(a20 == 1) && 15 == a8) && a16 == 6)) || (!(a20 == 1) && 5 == a16)) || ((15 == a8 && !(a17 == 1)) && a16 == 6) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((1 == a7 || ((!(a20 == 1) && a16 == 4) && !(a17 == 1))) || ((a17 <= 0 && 15 == a8) && 5 == a16)) || (a17 == 1 && a21 == 1)) || (a16 == 4 && a17 <= 0)) || ((!(a20 == 1) && 15 == a8) && a16 == 6)) || (!(a20 == 1) && 5 == a16)) || ((15 == a8 && !(a17 == 1)) && a16 == 6) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 9.2s, OverallIterations: 11, TraceHistogramMax: 7, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 1027 SDtfs, 2372 SDslu, 126 SDs, 0 SdLazy, 5885 SolverSat, 828 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2493occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 1757 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 51 NumberOfFragments, 143 HoareAnnotationTreeSize, 3 FomulaSimplifications, 5143 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 206 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1786 NumberOfCodeBlocks, 1786 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1775 ConstructedInterpolants, 0 QuantifiedInterpolants, 601234 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 1139/1139 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...