./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem11_label33.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95299524-91e1-4cb6-a397-e13d81af67da/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95299524-91e1-4cb6-a397-e13d81af67da/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95299524-91e1-4cb6-a397-e13d81af67da/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95299524-91e1-4cb6-a397-e13d81af67da/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem11_label33.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95299524-91e1-4cb6-a397-e13d81af67da/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95299524-91e1-4cb6-a397-e13d81af67da/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7166744474158954665024dc8c8b3712d72f905c129b3d2684427468d2506fe1 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 21:09:41,377 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:09:41,380 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:09:41,412 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:09:41,413 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:09:41,414 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:09:41,415 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:09:41,417 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:09:41,419 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:09:41,420 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:09:41,422 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:09:41,423 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:09:41,423 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:09:41,425 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:09:41,426 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:09:41,427 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:09:41,428 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:09:41,429 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:09:41,431 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:09:41,433 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:09:41,434 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:09:41,442 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:09:41,443 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:09:41,449 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:09:41,452 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:09:41,453 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:09:41,453 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:09:41,454 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:09:41,454 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:09:41,455 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:09:41,456 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:09:41,457 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:09:41,458 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:09:41,458 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:09:41,460 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:09:41,460 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:09:41,461 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:09:41,461 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:09:41,461 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:09:41,462 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:09:41,463 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:09:41,464 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95299524-91e1-4cb6-a397-e13d81af67da/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 21:09:41,485 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:09:41,486 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:09:41,486 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:09:41,486 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:09:41,487 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:09:41,487 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:09:41,488 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:09:41,488 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:09:41,489 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:09:41,489 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:09:41,489 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 21:09:41,489 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:09:41,490 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 21:09:41,490 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:09:41,490 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 21:09:41,491 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:09:41,491 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 21:09:41,491 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 21:09:41,491 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 21:09:41,492 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:09:41,492 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 21:09:41,492 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:09:41,493 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:09:41,493 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:09:41,493 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:09:41,493 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:09:41,494 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:09:41,494 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 21:09:41,494 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:09:41,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 21:09:41,494 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 21:09:41,495 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 21:09:41,495 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 21:09:41,495 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95299524-91e1-4cb6-a397-e13d81af67da/bin/uautomizer-Dbtcem3rbc/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_worker_vcloud-master_on_vcloud-master/run_dir_95299524-91e1-4cb6-a397-e13d81af67da/bin/uautomizer-Dbtcem3rbc 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(reach_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 -> 7166744474158954665024dc8c8b3712d72f905c129b3d2684427468d2506fe1 [2022-11-02 21:09:41,728 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:09:41,757 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:09:41,760 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:09:41,761 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:09:41,762 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:09:41,763 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95299524-91e1-4cb6-a397-e13d81af67da/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/eca-rers2012/Problem11_label33.c [2022-11-02 21:09:41,860 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95299524-91e1-4cb6-a397-e13d81af67da/bin/uautomizer-Dbtcem3rbc/data/197813c68/ffb99058c69d4774a7166b5d04a30cbc/FLAGd53e11446 [2022-11-02 21:09:42,522 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:09:42,522 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95299524-91e1-4cb6-a397-e13d81af67da/sv-benchmarks/c/eca-rers2012/Problem11_label33.c [2022-11-02 21:09:42,549 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95299524-91e1-4cb6-a397-e13d81af67da/bin/uautomizer-Dbtcem3rbc/data/197813c68/ffb99058c69d4774a7166b5d04a30cbc/FLAGd53e11446 [2022-11-02 21:09:42,778 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95299524-91e1-4cb6-a397-e13d81af67da/bin/uautomizer-Dbtcem3rbc/data/197813c68/ffb99058c69d4774a7166b5d04a30cbc [2022-11-02 21:09:42,780 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:09:42,783 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:09:42,787 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:09:42,788 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:09:42,792 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:09:42,792 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:09:42" (1/1) ... [2022-11-02 21:09:42,795 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3652283e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:42, skipping insertion in model container [2022-11-02 21:09:42,795 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:09:42" (1/1) ... [2022-11-02 21:09:42,803 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:09:42,879 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:09:43,087 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95299524-91e1-4cb6-a397-e13d81af67da/sv-benchmarks/c/eca-rers2012/Problem11_label33.c[4121,4134] [2022-11-02 21:09:43,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:09:43,421 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:09:43,449 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95299524-91e1-4cb6-a397-e13d81af67da/sv-benchmarks/c/eca-rers2012/Problem11_label33.c[4121,4134] [2022-11-02 21:09:43,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:09:43,701 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:09:43,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:43 WrapperNode [2022-11-02 21:09:43,702 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:09:43,703 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:09:43,703 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:09:43,703 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:09:43,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:43" (1/1) ... [2022-11-02 21:09:43,739 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:43" (1/1) ... [2022-11-02 21:09:43,863 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 999 [2022-11-02 21:09:43,863 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:09:43,864 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:09:43,864 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:09:43,865 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:09:43,874 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:43" (1/1) ... [2022-11-02 21:09:43,874 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:43" (1/1) ... [2022-11-02 21:09:43,890 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:43" (1/1) ... [2022-11-02 21:09:43,890 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:43" (1/1) ... [2022-11-02 21:09:43,948 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:43" (1/1) ... [2022-11-02 21:09:43,971 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:43" (1/1) ... [2022-11-02 21:09:43,984 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:43" (1/1) ... [2022-11-02 21:09:43,999 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:43" (1/1) ... [2022-11-02 21:09:44,016 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:09:44,017 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:09:44,018 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:09:44,018 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:09:44,020 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:43" (1/1) ... [2022-11-02 21:09:44,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:09:44,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95299524-91e1-4cb6-a397-e13d81af67da/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:09:44,131 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95299524-91e1-4cb6-a397-e13d81af67da/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:09:44,249 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95299524-91e1-4cb6-a397-e13d81af67da/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:09:44,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:09:44,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:09:44,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:09:44,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:09:44,341 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:09:44,343 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:09:46,259 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:09:46,267 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:09:46,268 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 21:09:46,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:09:46 BoogieIcfgContainer [2022-11-02 21:09:46,270 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:09:46,272 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:09:46,272 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:09:46,276 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:09:46,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:09:42" (1/3) ... [2022-11-02 21:09:46,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a5cd3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:09:46, skipping insertion in model container [2022-11-02 21:09:46,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:09:43" (2/3) ... [2022-11-02 21:09:46,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a5cd3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:09:46, skipping insertion in model container [2022-11-02 21:09:46,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:09:46" (3/3) ... [2022-11-02 21:09:46,279 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label33.c [2022-11-02 21:09:46,297 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:09:46,298 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 21:09:46,352 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:09:46,359 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4ae13d08, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:09:46,359 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 21:09:46,371 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:46,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-02 21:09:46,381 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:09:46,382 INFO L195 NwaCegarLoop]: 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] [2022-11-02 21:09:46,382 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:09:46,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:46,391 INFO L85 PathProgramCache]: Analyzing trace with hash -716875070, now seen corresponding path program 1 times [2022-11-02 21:09:46,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:46,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377079941] [2022-11-02 21:09:46,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:46,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:46,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:46,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:09:46,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:46,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377079941] [2022-11-02 21:09:46,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377079941] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:46,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:46,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:09:46,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904654920] [2022-11-02 21:09:46,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:46,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:09:46,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:46,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:09:46,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:09:46,818 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:48,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:09:48,200 INFO L93 Difference]: Finished difference Result 761 states and 1345 transitions. [2022-11-02 21:09:48,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:09:48,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-02 21:09:48,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:09:48,219 INFO L225 Difference]: With dead ends: 761 [2022-11-02 21:09:48,220 INFO L226 Difference]: Without dead ends: 413 [2022-11-02 21:09:48,224 INFO L412 NwaCegarLoop]: 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 [2022-11-02 21:09:48,227 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 200 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:09:48,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 222 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-02 21:09:48,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2022-11-02 21:09:48,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2022-11-02 21:09:48,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 1.453883495145631) internal successors, (599), 412 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:48,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 599 transitions. [2022-11-02 21:09:48,289 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 599 transitions. Word has length 28 [2022-11-02 21:09:48,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:09:48,289 INFO L495 AbstractCegarLoop]: Abstraction has 413 states and 599 transitions. [2022-11-02 21:09:48,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:48,290 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 599 transitions. [2022-11-02 21:09:48,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-11-02 21:09:48,293 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:09:48,293 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:09:48,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 21:09:48,294 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:09:48,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:48,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1836683206, now seen corresponding path program 1 times [2022-11-02 21:09:48,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:48,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998112386] [2022-11-02 21:09:48,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:48,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:48,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:48,521 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:09:48,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:48,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998112386] [2022-11-02 21:09:48,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998112386] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:48,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:48,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:09:48,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895477084] [2022-11-02 21:09:48,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:48,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:09:48,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:48,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:09:48,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:09:48,526 INFO L87 Difference]: Start difference. First operand 413 states and 599 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:49,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:09:49,571 INFO L93 Difference]: Finished difference Result 1211 states and 1763 transitions. [2022-11-02 21:09:49,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:09:49,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2022-11-02 21:09:49,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:09:49,575 INFO L225 Difference]: With dead ends: 1211 [2022-11-02 21:09:49,575 INFO L226 Difference]: Without dead ends: 800 [2022-11-02 21:09:49,577 INFO L412 NwaCegarLoop]: 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 [2022-11-02 21:09:49,578 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 142 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:09:49,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 120 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 21:09:49,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2022-11-02 21:09:49,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 789. [2022-11-02 21:09:49,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.3743654822335025) internal successors, (1083), 788 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:49,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1083 transitions. [2022-11-02 21:09:49,612 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1083 transitions. Word has length 96 [2022-11-02 21:09:49,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:09:49,613 INFO L495 AbstractCegarLoop]: Abstraction has 789 states and 1083 transitions. [2022-11-02 21:09:49,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:49,613 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1083 transitions. [2022-11-02 21:09:49,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-02 21:09:49,616 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:09:49,616 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:09:49,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 21:09:49,617 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:09:49,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:49,617 INFO L85 PathProgramCache]: Analyzing trace with hash 867693909, now seen corresponding path program 1 times [2022-11-02 21:09:49,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:49,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898786357] [2022-11-02 21:09:49,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:49,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:49,949 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:09:49,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:49,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898786357] [2022-11-02 21:09:49,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898786357] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:49,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:49,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:09:49,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071057751] [2022-11-02 21:09:49,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:49,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:09:49,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:49,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:09:49,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:09:49,957 INFO L87 Difference]: Start difference. First operand 789 states and 1083 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:50,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:09:50,936 INFO L93 Difference]: Finished difference Result 1945 states and 2612 transitions. [2022-11-02 21:09:50,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:09:50,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2022-11-02 21:09:50,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:09:50,941 INFO L225 Difference]: With dead ends: 1945 [2022-11-02 21:09:50,942 INFO L226 Difference]: Without dead ends: 1158 [2022-11-02 21:09:50,943 INFO L412 NwaCegarLoop]: 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 [2022-11-02 21:09:50,944 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 119 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 21:09:50,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 190 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 21:09:50,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2022-11-02 21:09:50,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1157. [2022-11-02 21:09:50,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1156 states have (on average 1.2707612456747406) internal successors, (1469), 1156 states have internal predecessors, (1469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:50,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1469 transitions. [2022-11-02 21:09:50,993 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1469 transitions. Word has length 98 [2022-11-02 21:09:50,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:09:50,993 INFO L495 AbstractCegarLoop]: Abstraction has 1157 states and 1469 transitions. [2022-11-02 21:09:50,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:50,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1469 transitions. [2022-11-02 21:09:51,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-11-02 21:09:51,000 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:09:51,001 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:09:51,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 21:09:51,001 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:09:51,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:51,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1002850089, now seen corresponding path program 1 times [2022-11-02 21:09:51,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:51,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860001490] [2022-11-02 21:09:51,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:51,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:51,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:51,318 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:09:51,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:51,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860001490] [2022-11-02 21:09:51,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860001490] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:51,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:51,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:09:51,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465800863] [2022-11-02 21:09:51,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:51,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:09:51,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:51,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:09:51,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:09:51,322 INFO L87 Difference]: Start difference. First operand 1157 states and 1469 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:52,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:09:52,264 INFO L93 Difference]: Finished difference Result 2519 states and 3349 transitions. [2022-11-02 21:09:52,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:09:52,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2022-11-02 21:09:52,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:09:52,274 INFO L225 Difference]: With dead ends: 2519 [2022-11-02 21:09:52,275 INFO L226 Difference]: Without dead ends: 1548 [2022-11-02 21:09:52,278 INFO L412 NwaCegarLoop]: 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 [2022-11-02 21:09:52,283 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 207 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 21:09:52,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 322 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 21:09:52,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2022-11-02 21:09:52,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1545. [2022-11-02 21:09:52,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1544 states have (on average 1.2933937823834196) internal successors, (1997), 1544 states have internal predecessors, (1997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:52,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 1997 transitions. [2022-11-02 21:09:52,324 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 1997 transitions. Word has length 155 [2022-11-02 21:09:52,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:09:52,326 INFO L495 AbstractCegarLoop]: Abstraction has 1545 states and 1997 transitions. [2022-11-02 21:09:52,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:52,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 1997 transitions. [2022-11-02 21:09:52,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-11-02 21:09:52,338 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:09:52,339 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-02 21:09:52,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 21:09:52,339 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:09:52,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:52,340 INFO L85 PathProgramCache]: Analyzing trace with hash -85004655, now seen corresponding path program 1 times [2022-11-02 21:09:52,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:52,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952841295] [2022-11-02 21:09:52,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:52,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:52,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:52,574 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-11-02 21:09:52,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:52,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952841295] [2022-11-02 21:09:52,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952841295] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:52,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:52,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:09:52,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041702518] [2022-11-02 21:09:52,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:52,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:09:52,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:52,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:09:52,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:09:52,579 INFO L87 Difference]: Start difference. First operand 1545 states and 1997 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:53,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:09:53,695 INFO L93 Difference]: Finished difference Result 3650 states and 4815 transitions. [2022-11-02 21:09:53,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:09:53,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 210 [2022-11-02 21:09:53,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:09:53,705 INFO L225 Difference]: With dead ends: 3650 [2022-11-02 21:09:53,705 INFO L226 Difference]: Without dead ends: 2291 [2022-11-02 21:09:53,707 INFO L412 NwaCegarLoop]: 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 [2022-11-02 21:09:53,711 INFO L413 NwaCegarLoop]: 371 mSDtfsCounter, 169 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:09:53,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 392 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-02 21:09:53,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2291 states. [2022-11-02 21:09:53,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2291 to 2098. [2022-11-02 21:09:53,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2098 states, 2097 states have (on average 1.2675250357653791) internal successors, (2658), 2097 states have internal predecessors, (2658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:53,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 2658 transitions. [2022-11-02 21:09:53,756 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 2658 transitions. Word has length 210 [2022-11-02 21:09:53,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:09:53,758 INFO L495 AbstractCegarLoop]: Abstraction has 2098 states and 2658 transitions. [2022-11-02 21:09:53,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:53,761 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 2658 transitions. [2022-11-02 21:09:53,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-11-02 21:09:53,765 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:09:53,765 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-02 21:09:53,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 21:09:53,767 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:09:53,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:53,768 INFO L85 PathProgramCache]: Analyzing trace with hash 78170338, now seen corresponding path program 1 times [2022-11-02 21:09:53,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:53,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53923294] [2022-11-02 21:09:53,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:53,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:53,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:53,987 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-11-02 21:09:53,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:53,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53923294] [2022-11-02 21:09:53,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53923294] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:53,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:53,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:09:53,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42679035] [2022-11-02 21:09:53,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:53,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:09:53,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:53,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:09:53,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:09:53,990 INFO L87 Difference]: Start difference. First operand 2098 states and 2658 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:55,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:09:55,108 INFO L93 Difference]: Finished difference Result 5851 states and 7488 transitions. [2022-11-02 21:09:55,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:09:55,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 216 [2022-11-02 21:09:55,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:09:55,122 INFO L225 Difference]: With dead ends: 5851 [2022-11-02 21:09:55,122 INFO L226 Difference]: Without dead ends: 3755 [2022-11-02 21:09:55,125 INFO L412 NwaCegarLoop]: 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 [2022-11-02 21:09:55,126 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 183 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:09:55,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 144 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 21:09:55,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3755 states. [2022-11-02 21:09:55,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3755 to 3755. [2022-11-02 21:09:55,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3755 states, 3754 states have (on average 1.245338305807139) internal successors, (4675), 3754 states have internal predecessors, (4675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:55,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3755 states to 3755 states and 4675 transitions. [2022-11-02 21:09:55,209 INFO L78 Accepts]: Start accepts. Automaton has 3755 states and 4675 transitions. Word has length 216 [2022-11-02 21:09:55,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:09:55,209 INFO L495 AbstractCegarLoop]: Abstraction has 3755 states and 4675 transitions. [2022-11-02 21:09:55,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:55,210 INFO L276 IsEmpty]: Start isEmpty. Operand 3755 states and 4675 transitions. [2022-11-02 21:09:55,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2022-11-02 21:09:55,215 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:09:55,215 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-02 21:09:55,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 21:09:55,216 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:09:55,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:55,216 INFO L85 PathProgramCache]: Analyzing trace with hash 964138675, now seen corresponding path program 1 times [2022-11-02 21:09:55,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:55,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341876616] [2022-11-02 21:09:55,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:55,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:55,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:56,135 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:09:56,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:56,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341876616] [2022-11-02 21:09:56,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341876616] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:56,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:56,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:09:56,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076506030] [2022-11-02 21:09:56,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:56,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 21:09:56,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:56,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 21:09:56,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-02 21:09:56,138 INFO L87 Difference]: Start difference. First operand 3755 states and 4675 transitions. Second operand has 5 states, 5 states have (on average 49.4) internal successors, (247), 4 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:58,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:09:58,853 INFO L93 Difference]: Finished difference Result 13433 states and 17026 transitions. [2022-11-02 21:09:58,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:09:58,854 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 49.4) internal successors, (247), 4 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 247 [2022-11-02 21:09:58,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:09:58,890 INFO L225 Difference]: With dead ends: 13433 [2022-11-02 21:09:58,890 INFO L226 Difference]: Without dead ends: 9680 [2022-11-02 21:09:58,896 INFO L412 NwaCegarLoop]: 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 [2022-11-02 21:09:58,900 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 413 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1873 mSolverCounterSat, 337 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 2210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 337 IncrementalHoareTripleChecker+Valid, 1873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:09:58,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 106 Invalid, 2210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [337 Valid, 1873 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-11-02 21:09:58,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9680 states. [2022-11-02 21:09:59,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9680 to 9475. [2022-11-02 21:09:59,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9475 states, 9474 states have (on average 1.21638167616635) internal successors, (11524), 9474 states have internal predecessors, (11524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:59,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9475 states to 9475 states and 11524 transitions. [2022-11-02 21:09:59,147 INFO L78 Accepts]: Start accepts. Automaton has 9475 states and 11524 transitions. Word has length 247 [2022-11-02 21:09:59,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:09:59,148 INFO L495 AbstractCegarLoop]: Abstraction has 9475 states and 11524 transitions. [2022-11-02 21:09:59,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.4) internal successors, (247), 4 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:59,149 INFO L276 IsEmpty]: Start isEmpty. Operand 9475 states and 11524 transitions. [2022-11-02 21:09:59,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2022-11-02 21:09:59,159 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:09:59,159 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:09:59,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 21:09:59,160 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:09:59,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:59,160 INFO L85 PathProgramCache]: Analyzing trace with hash 640219882, now seen corresponding path program 1 times [2022-11-02 21:09:59,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:59,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831881401] [2022-11-02 21:09:59,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:59,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:59,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:59,521 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2022-11-02 21:09:59,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:59,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831881401] [2022-11-02 21:09:59,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831881401] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:59,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:59,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:09:59,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474175102] [2022-11-02 21:09:59,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:59,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:09:59,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:59,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:09:59,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:09:59,525 INFO L87 Difference]: Start difference. First operand 9475 states and 11524 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:00,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:00,617 INFO L93 Difference]: Finished difference Result 21155 states and 26096 transitions. [2022-11-02 21:10:00,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:10:00,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 293 [2022-11-02 21:10:00,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:00,672 INFO L225 Difference]: With dead ends: 21155 [2022-11-02 21:10:00,673 INFO L226 Difference]: Without dead ends: 12050 [2022-11-02 21:10:00,682 INFO L412 NwaCegarLoop]: 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 [2022-11-02 21:10:00,683 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 195 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:00,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 151 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 21:10:00,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12050 states. [2022-11-02 21:10:00,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12050 to 9468. [2022-11-02 21:10:00,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9468 states, 9467 states have (on average 1.2162247808175768) internal successors, (11514), 9467 states have internal predecessors, (11514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:00,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9468 states to 9468 states and 11514 transitions. [2022-11-02 21:10:00,925 INFO L78 Accepts]: Start accepts. Automaton has 9468 states and 11514 transitions. Word has length 293 [2022-11-02 21:10:00,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:00,926 INFO L495 AbstractCegarLoop]: Abstraction has 9468 states and 11514 transitions. [2022-11-02 21:10:00,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:00,927 INFO L276 IsEmpty]: Start isEmpty. Operand 9468 states and 11514 transitions. [2022-11-02 21:10:00,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2022-11-02 21:10:00,937 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:00,937 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-02 21:10:00,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 21:10:00,939 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:10:00,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:00,940 INFO L85 PathProgramCache]: Analyzing trace with hash 117863084, now seen corresponding path program 1 times [2022-11-02 21:10:00,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:00,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631056954] [2022-11-02 21:10:00,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:00,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:01,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:01,268 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:10:01,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:01,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631056954] [2022-11-02 21:10:01,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631056954] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:01,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:01,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:10:01,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107234408] [2022-11-02 21:10:01,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:01,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:10:01,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:01,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:10:01,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:10:01,272 INFO L87 Difference]: Start difference. First operand 9468 states and 11514 transitions. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:02,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:02,319 INFO L93 Difference]: Finished difference Result 20054 states and 24754 transitions. [2022-11-02 21:10:02,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:10:02,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 298 [2022-11-02 21:10:02,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:02,341 INFO L225 Difference]: With dead ends: 20054 [2022-11-02 21:10:02,342 INFO L226 Difference]: Without dead ends: 10956 [2022-11-02 21:10:02,352 INFO L412 NwaCegarLoop]: 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 [2022-11-02 21:10:02,355 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 61 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:02,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 335 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 21:10:02,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10956 states. [2022-11-02 21:10:02,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10956 to 10756. [2022-11-02 21:10:02,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10756 states, 10755 states have (on average 1.20371920037192) internal successors, (12946), 10755 states have internal predecessors, (12946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:02,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10756 states to 10756 states and 12946 transitions. [2022-11-02 21:10:02,642 INFO L78 Accepts]: Start accepts. Automaton has 10756 states and 12946 transitions. Word has length 298 [2022-11-02 21:10:02,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:02,643 INFO L495 AbstractCegarLoop]: Abstraction has 10756 states and 12946 transitions. [2022-11-02 21:10:02,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:02,644 INFO L276 IsEmpty]: Start isEmpty. Operand 10756 states and 12946 transitions. [2022-11-02 21:10:02,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2022-11-02 21:10:02,654 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:02,654 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:10:02,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 21:10:02,655 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:10:02,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:02,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1642030569, now seen corresponding path program 1 times [2022-11-02 21:10:02,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:02,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547545971] [2022-11-02 21:10:02,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:02,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:02,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:02,892 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-11-02 21:10:02,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:02,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547545971] [2022-11-02 21:10:02,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547545971] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:02,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:02,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:10:02,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097494684] [2022-11-02 21:10:02,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:02,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:10:02,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:02,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:10:02,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:10:02,899 INFO L87 Difference]: Start difference. First operand 10756 states and 12946 transitions. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:03,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:03,884 INFO L93 Difference]: Finished difference Result 20377 states and 24418 transitions. [2022-11-02 21:10:03,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:10:03,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 312 [2022-11-02 21:10:03,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:03,906 INFO L225 Difference]: With dead ends: 20377 [2022-11-02 21:10:03,906 INFO L226 Difference]: Without dead ends: 9991 [2022-11-02 21:10:03,918 INFO L412 NwaCegarLoop]: 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 [2022-11-02 21:10:03,919 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 137 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:03,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 148 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 21:10:03,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9991 states. [2022-11-02 21:10:04,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9991 to 7599. [2022-11-02 21:10:04,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7599 states, 7598 states have (on average 1.1417478283758884) internal successors, (8675), 7598 states have internal predecessors, (8675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:04,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7599 states to 7599 states and 8675 transitions. [2022-11-02 21:10:04,110 INFO L78 Accepts]: Start accepts. Automaton has 7599 states and 8675 transitions. Word has length 312 [2022-11-02 21:10:04,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:04,111 INFO L495 AbstractCegarLoop]: Abstraction has 7599 states and 8675 transitions. [2022-11-02 21:10:04,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:04,112 INFO L276 IsEmpty]: Start isEmpty. Operand 7599 states and 8675 transitions. [2022-11-02 21:10:04,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2022-11-02 21:10:04,130 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:04,130 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-02 21:10:04,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 21:10:04,131 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:10:04,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:04,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1079031194, now seen corresponding path program 1 times [2022-11-02 21:10:04,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:04,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583098159] [2022-11-02 21:10:04,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:04,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:04,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:04,691 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2022-11-02 21:10:04,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:04,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583098159] [2022-11-02 21:10:04,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583098159] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:04,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:04,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:10:04,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372651199] [2022-11-02 21:10:04,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:04,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:10:04,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:04,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:10:04,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:10:04,694 INFO L87 Difference]: Start difference. First operand 7599 states and 8675 transitions. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:05,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:05,803 INFO L93 Difference]: Finished difference Result 17772 states and 20278 transitions. [2022-11-02 21:10:05,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:10:05,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 397 [2022-11-02 21:10:05,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:05,823 INFO L225 Difference]: With dead ends: 17772 [2022-11-02 21:10:05,823 INFO L226 Difference]: Without dead ends: 9802 [2022-11-02 21:10:05,831 INFO L412 NwaCegarLoop]: 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 [2022-11-02 21:10:05,832 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 121 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:05,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 315 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 21:10:05,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9802 states. [2022-11-02 21:10:05,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9802 to 8698. [2022-11-02 21:10:05,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8698 states, 8697 states have (on average 1.134069219271013) internal successors, (9863), 8697 states have internal predecessors, (9863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:05,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8698 states to 8698 states and 9863 transitions. [2022-11-02 21:10:05,980 INFO L78 Accepts]: Start accepts. Automaton has 8698 states and 9863 transitions. Word has length 397 [2022-11-02 21:10:05,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:05,981 INFO L495 AbstractCegarLoop]: Abstraction has 8698 states and 9863 transitions. [2022-11-02 21:10:05,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:05,981 INFO L276 IsEmpty]: Start isEmpty. Operand 8698 states and 9863 transitions. [2022-11-02 21:10:05,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2022-11-02 21:10:05,998 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:05,998 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:10:05,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 21:10:05,999 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:10:05,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:05,999 INFO L85 PathProgramCache]: Analyzing trace with hash 145108911, now seen corresponding path program 1 times [2022-11-02 21:10:06,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:06,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906417528] [2022-11-02 21:10:06,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:06,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:06,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:07,672 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 355 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-02 21:10:07,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:07,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906417528] [2022-11-02 21:10:07,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906417528] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:07,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:07,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:10:07,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39520437] [2022-11-02 21:10:07,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:07,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:10:07,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:07,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:10:07,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:10:07,676 INFO L87 Difference]: Start difference. First operand 8698 states and 9863 transitions. Second operand has 7 states, 7 states have (on average 53.285714285714285) internal successors, (373), 6 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:09,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:09,770 INFO L93 Difference]: Finished difference Result 20143 states and 22796 transitions. [2022-11-02 21:10:09,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:10:09,771 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 53.285714285714285) internal successors, (373), 6 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 398 [2022-11-02 21:10:09,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:09,791 INFO L225 Difference]: With dead ends: 20143 [2022-11-02 21:10:09,791 INFO L226 Difference]: Without dead ends: 11815 [2022-11-02 21:10:09,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-02 21:10:09,801 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 339 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1737 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 1926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 1737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:09,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 181 Invalid, 1926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 1737 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-02 21:10:09,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11815 states. [2022-11-02 21:10:10,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11815 to 11461. [2022-11-02 21:10:10,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11461 states, 11460 states have (on average 1.1300174520069808) internal successors, (12950), 11460 states have internal predecessors, (12950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:10,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11461 states to 11461 states and 12950 transitions. [2022-11-02 21:10:10,092 INFO L78 Accepts]: Start accepts. Automaton has 11461 states and 12950 transitions. Word has length 398 [2022-11-02 21:10:10,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:10,093 INFO L495 AbstractCegarLoop]: Abstraction has 11461 states and 12950 transitions. [2022-11-02 21:10:10,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 53.285714285714285) internal successors, (373), 6 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:10,094 INFO L276 IsEmpty]: Start isEmpty. Operand 11461 states and 12950 transitions. [2022-11-02 21:10:10,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2022-11-02 21:10:10,119 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:10,119 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:10:10,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 21:10:10,120 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:10:10,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:10,121 INFO L85 PathProgramCache]: Analyzing trace with hash 504044406, now seen corresponding path program 1 times [2022-11-02 21:10:10,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:10,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081914496] [2022-11-02 21:10:10,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:10,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:10,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:11,920 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 357 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-02 21:10:11,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:11,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081914496] [2022-11-02 21:10:11,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081914496] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:10:11,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839719925] [2022-11-02 21:10:11,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:11,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:10:11,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95299524-91e1-4cb6-a397-e13d81af67da/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:10:11,930 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95299524-91e1-4cb6-a397-e13d81af67da/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:10:11,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95299524-91e1-4cb6-a397-e13d81af67da/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 21:10:12,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:12,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 21:10:12,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:10:13,808 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 244 proven. 121 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-02 21:10:13,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:10:18,522 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 244 proven. 121 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-02 21:10:18,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839719925] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:10:18,523 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:10:18,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 10 [2022-11-02 21:10:18,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530642036] [2022-11-02 21:10:18,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:10:18,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 21:10:18,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:18,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 21:10:18,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-11-02 21:10:18,527 INFO L87 Difference]: Start difference. First operand 11461 states and 12950 transitions. Second operand has 11 states, 11 states have (on average 86.45454545454545) internal successors, (951), 10 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:25,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:25,316 INFO L93 Difference]: Finished difference Result 30539 states and 34353 transitions. [2022-11-02 21:10:25,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-02 21:10:25,317 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 86.45454545454545) internal successors, (951), 10 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 408 [2022-11-02 21:10:25,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:25,347 INFO L225 Difference]: With dead ends: 30539 [2022-11-02 21:10:25,348 INFO L226 Difference]: Without dead ends: 18698 [2022-11-02 21:10:25,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 847 GetRequests, 812 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=363, Invalid=969, Unknown=0, NotChecked=0, Total=1332 [2022-11-02 21:10:25,357 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 1398 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 4391 mSolverCounterSat, 971 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1398 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 5362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 971 IncrementalHoareTripleChecker+Valid, 4391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:25,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1398 Valid, 250 Invalid, 5362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [971 Valid, 4391 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-11-02 21:10:25,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18698 states. [2022-11-02 21:10:25,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18698 to 10723. [2022-11-02 21:10:25,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10723 states, 10722 states have (on average 1.104178324939377) internal successors, (11839), 10722 states have internal predecessors, (11839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:25,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10723 states to 10723 states and 11839 transitions. [2022-11-02 21:10:25,578 INFO L78 Accepts]: Start accepts. Automaton has 10723 states and 11839 transitions. Word has length 408 [2022-11-02 21:10:25,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:25,579 INFO L495 AbstractCegarLoop]: Abstraction has 10723 states and 11839 transitions. [2022-11-02 21:10:25,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 86.45454545454545) internal successors, (951), 10 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:25,580 INFO L276 IsEmpty]: Start isEmpty. Operand 10723 states and 11839 transitions. [2022-11-02 21:10:25,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2022-11-02 21:10:25,593 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:25,594 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:10:25,632 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95299524-91e1-4cb6-a397-e13d81af67da/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 21:10:25,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95299524-91e1-4cb6-a397-e13d81af67da/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:10:25,821 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:10:25,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:25,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1509289490, now seen corresponding path program 1 times [2022-11-02 21:10:25,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:25,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829318978] [2022-11-02 21:10:25,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:25,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:25,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:26,469 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 412 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:10:26,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:26,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829318978] [2022-11-02 21:10:26,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829318978] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:26,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:26,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:10:26,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339195229] [2022-11-02 21:10:26,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:26,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:10:26,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:26,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:10:26,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:10:26,473 INFO L87 Difference]: Start difference. First operand 10723 states and 11839 transitions. Second operand has 4 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:28,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:28,094 INFO L93 Difference]: Finished difference Result 23476 states and 25909 transitions. [2022-11-02 21:10:28,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:10:28,095 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 430 [2022-11-02 21:10:28,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:28,115 INFO L225 Difference]: With dead ends: 23476 [2022-11-02 21:10:28,116 INFO L226 Difference]: Without dead ends: 13123 [2022-11-02 21:10:28,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:10:28,123 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 180 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:28,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 63 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1006 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-02 21:10:28,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13123 states. [2022-11-02 21:10:28,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13123 to 12386. [2022-11-02 21:10:28,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12386 states, 12385 states have (on average 1.09245054501413) internal successors, (13530), 12385 states have internal predecessors, (13530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:28,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12386 states to 12386 states and 13530 transitions. [2022-11-02 21:10:28,335 INFO L78 Accepts]: Start accepts. Automaton has 12386 states and 13530 transitions. Word has length 430 [2022-11-02 21:10:28,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:28,336 INFO L495 AbstractCegarLoop]: Abstraction has 12386 states and 13530 transitions. [2022-11-02 21:10:28,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:28,337 INFO L276 IsEmpty]: Start isEmpty. Operand 12386 states and 13530 transitions. [2022-11-02 21:10:28,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2022-11-02 21:10:28,349 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:28,349 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:10:28,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 21:10:28,349 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:10:28,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:28,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1406221149, now seen corresponding path program 1 times [2022-11-02 21:10:28,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:28,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411322927] [2022-11-02 21:10:28,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:28,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:28,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:28,856 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2022-11-02 21:10:28,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:28,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411322927] [2022-11-02 21:10:28,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411322927] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:28,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:28,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:10:28,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500319787] [2022-11-02 21:10:28,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:28,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:10:28,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:28,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:10:28,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:10:28,861 INFO L87 Difference]: Start difference. First operand 12386 states and 13530 transitions. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:29,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:29,878 INFO L93 Difference]: Finished difference Result 26426 states and 28854 transitions. [2022-11-02 21:10:29,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:10:29,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 445 [2022-11-02 21:10:29,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:29,900 INFO L225 Difference]: With dead ends: 26426 [2022-11-02 21:10:29,900 INFO L226 Difference]: Without dead ends: 12568 [2022-11-02 21:10:29,907 INFO L412 NwaCegarLoop]: 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 [2022-11-02 21:10:29,908 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 117 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:29,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 294 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-02 21:10:29,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12568 states. [2022-11-02 21:10:30,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12568 to 10911. [2022-11-02 21:10:30,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10911 states, 10910 states have (on average 1.0778185151237396) internal successors, (11759), 10910 states have internal predecessors, (11759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:30,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10911 states to 10911 states and 11759 transitions. [2022-11-02 21:10:30,093 INFO L78 Accepts]: Start accepts. Automaton has 10911 states and 11759 transitions. Word has length 445 [2022-11-02 21:10:30,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:30,094 INFO L495 AbstractCegarLoop]: Abstraction has 10911 states and 11759 transitions. [2022-11-02 21:10:30,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:30,094 INFO L276 IsEmpty]: Start isEmpty. Operand 10911 states and 11759 transitions. [2022-11-02 21:10:30,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2022-11-02 21:10:30,106 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:30,107 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:10:30,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 21:10:30,107 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:10:30,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:30,108 INFO L85 PathProgramCache]: Analyzing trace with hash 546987130, now seen corresponding path program 1 times [2022-11-02 21:10:30,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:30,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367982670] [2022-11-02 21:10:30,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:30,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:30,431 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 589 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-11-02 21:10:30,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:30,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367982670] [2022-11-02 21:10:30,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367982670] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:30,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:30,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:10:30,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976171479] [2022-11-02 21:10:30,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:30,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:10:30,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:30,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:10:30,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:10:30,434 INFO L87 Difference]: Start difference. First operand 10911 states and 11759 transitions. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:31,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:31,255 INFO L93 Difference]: Finished difference Result 22555 states and 24296 transitions. [2022-11-02 21:10:31,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:10:31,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 483 [2022-11-02 21:10:31,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:31,274 INFO L225 Difference]: With dead ends: 22555 [2022-11-02 21:10:31,274 INFO L226 Difference]: Without dead ends: 12014 [2022-11-02 21:10:31,280 INFO L412 NwaCegarLoop]: 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 [2022-11-02 21:10:31,281 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 68 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:31,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 307 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 21:10:31,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12014 states. [2022-11-02 21:10:31,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12014 to 11830. [2022-11-02 21:10:31,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11830 states, 11829 states have (on average 1.0695747738608505) internal successors, (12652), 11829 states have internal predecessors, (12652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:31,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11830 states to 11830 states and 12652 transitions. [2022-11-02 21:10:31,547 INFO L78 Accepts]: Start accepts. Automaton has 11830 states and 12652 transitions. Word has length 483 [2022-11-02 21:10:31,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:31,548 INFO L495 AbstractCegarLoop]: Abstraction has 11830 states and 12652 transitions. [2022-11-02 21:10:31,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:31,548 INFO L276 IsEmpty]: Start isEmpty. Operand 11830 states and 12652 transitions. [2022-11-02 21:10:31,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2022-11-02 21:10:31,569 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:31,569 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:10:31,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 21:10:31,570 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:10:31,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:31,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1451405169, now seen corresponding path program 1 times [2022-11-02 21:10:31,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:31,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994958858] [2022-11-02 21:10:31,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:31,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:31,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:32,348 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 578 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-11-02 21:10:32,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:32,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994958858] [2022-11-02 21:10:32,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994958858] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:32,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:32,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:10:32,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86605418] [2022-11-02 21:10:32,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:32,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:10:32,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:32,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:10:32,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:10:32,351 INFO L87 Difference]: Start difference. First operand 11830 states and 12652 transitions. Second operand has 4 states, 4 states have (on average 90.5) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:33,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:33,692 INFO L93 Difference]: Finished difference Result 24032 states and 25730 transitions. [2022-11-02 21:10:33,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:10:33,693 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 483 [2022-11-02 21:10:33,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:33,710 INFO L225 Difference]: With dead ends: 24032 [2022-11-02 21:10:33,710 INFO L226 Difference]: Without dead ends: 12572 [2022-11-02 21:10:33,717 INFO L412 NwaCegarLoop]: 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 [2022-11-02 21:10:33,718 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 193 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 1113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:33,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 102 Invalid, 1113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-02 21:10:33,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12572 states. [2022-11-02 21:10:33,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12572 to 12016. [2022-11-02 21:10:33,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12016 states, 12015 states have (on average 1.0689138576779027) internal successors, (12843), 12015 states have internal predecessors, (12843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:33,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12016 states to 12016 states and 12843 transitions. [2022-11-02 21:10:33,988 INFO L78 Accepts]: Start accepts. Automaton has 12016 states and 12843 transitions. Word has length 483 [2022-11-02 21:10:33,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:33,988 INFO L495 AbstractCegarLoop]: Abstraction has 12016 states and 12843 transitions. [2022-11-02 21:10:33,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:33,988 INFO L276 IsEmpty]: Start isEmpty. Operand 12016 states and 12843 transitions. [2022-11-02 21:10:33,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2022-11-02 21:10:33,998 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:33,999 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:10:33,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 21:10:33,999 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:10:34,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:34,000 INFO L85 PathProgramCache]: Analyzing trace with hash 704365135, now seen corresponding path program 1 times [2022-11-02 21:10:34,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:34,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673974583] [2022-11-02 21:10:34,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:34,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:34,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:34,381 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 594 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2022-11-02 21:10:34,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:34,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673974583] [2022-11-02 21:10:34,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673974583] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:34,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:34,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:10:34,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315888532] [2022-11-02 21:10:34,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:34,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:10:34,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:34,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:10:34,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:10:34,384 INFO L87 Difference]: Start difference. First operand 12016 states and 12843 transitions. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:35,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:35,178 INFO L93 Difference]: Finished difference Result 24033 states and 25696 transitions. [2022-11-02 21:10:35,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:10:35,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 488 [2022-11-02 21:10:35,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:35,193 INFO L225 Difference]: With dead ends: 24033 [2022-11-02 21:10:35,194 INFO L226 Difference]: Without dead ends: 12203 [2022-11-02 21:10:35,200 INFO L412 NwaCegarLoop]: 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 [2022-11-02 21:10:35,201 INFO L413 NwaCegarLoop]: 304 mSDtfsCounter, 66 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:35,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 323 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 21:10:35,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12203 states. [2022-11-02 21:10:35,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12203 to 12015. [2022-11-02 21:10:35,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12015 states, 12014 states have (on average 1.057516231063759) internal successors, (12705), 12014 states have internal predecessors, (12705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:35,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12015 states to 12015 states and 12705 transitions. [2022-11-02 21:10:35,374 INFO L78 Accepts]: Start accepts. Automaton has 12015 states and 12705 transitions. Word has length 488 [2022-11-02 21:10:35,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:35,375 INFO L495 AbstractCegarLoop]: Abstraction has 12015 states and 12705 transitions. [2022-11-02 21:10:35,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:35,375 INFO L276 IsEmpty]: Start isEmpty. Operand 12015 states and 12705 transitions. [2022-11-02 21:10:35,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2022-11-02 21:10:35,384 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:35,385 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:10:35,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 21:10:35,385 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:10:35,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:35,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1341858608, now seen corresponding path program 1 times [2022-11-02 21:10:35,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:35,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169832320] [2022-11-02 21:10:35,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:35,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:35,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:35,771 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 605 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-11-02 21:10:35,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:35,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169832320] [2022-11-02 21:10:35,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169832320] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:35,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:35,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:10:35,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283261008] [2022-11-02 21:10:35,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:35,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:10:35,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:35,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:10:35,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:10:35,776 INFO L87 Difference]: Start difference. First operand 12015 states and 12705 transitions. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:36,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:36,553 INFO L93 Difference]: Finished difference Result 25515 states and 27017 transitions. [2022-11-02 21:10:36,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:10:36,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 497 [2022-11-02 21:10:36,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:36,569 INFO L225 Difference]: With dead ends: 25515 [2022-11-02 21:10:36,570 INFO L226 Difference]: Without dead ends: 13870 [2022-11-02 21:10:36,577 INFO L412 NwaCegarLoop]: 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 [2022-11-02 21:10:36,577 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 64 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:36,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 135 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 21:10:36,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13870 states. [2022-11-02 21:10:36,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13870 to 12567. [2022-11-02 21:10:36,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12567 states, 12566 states have (on average 1.0563425115390737) internal successors, (13274), 12566 states have internal predecessors, (13274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:36,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12567 states to 12567 states and 13274 transitions. [2022-11-02 21:10:36,783 INFO L78 Accepts]: Start accepts. Automaton has 12567 states and 13274 transitions. Word has length 497 [2022-11-02 21:10:36,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:36,784 INFO L495 AbstractCegarLoop]: Abstraction has 12567 states and 13274 transitions. [2022-11-02 21:10:36,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:36,784 INFO L276 IsEmpty]: Start isEmpty. Operand 12567 states and 13274 transitions. [2022-11-02 21:10:36,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 565 [2022-11-02 21:10:36,795 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:36,796 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:10:36,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 21:10:36,796 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:10:36,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:36,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1445337457, now seen corresponding path program 1 times [2022-11-02 21:10:36,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:36,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092098796] [2022-11-02 21:10:36,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:36,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:36,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:37,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1070 backedges. 637 proven. 0 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2022-11-02 21:10:37,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:37,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092098796] [2022-11-02 21:10:37,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092098796] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:37,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:37,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:10:37,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507957268] [2022-11-02 21:10:37,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:37,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:10:37,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:37,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:10:37,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:10:37,169 INFO L87 Difference]: Start difference. First operand 12567 states and 13274 transitions. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:37,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:37,851 INFO L93 Difference]: Finished difference Result 24579 states and 25963 transitions. [2022-11-02 21:10:37,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:10:37,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 564 [2022-11-02 21:10:37,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:37,861 INFO L225 Difference]: With dead ends: 24579 [2022-11-02 21:10:37,861 INFO L226 Difference]: Without dead ends: 12382 [2022-11-02 21:10:37,867 INFO L412 NwaCegarLoop]: 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 [2022-11-02 21:10:37,868 INFO L413 NwaCegarLoop]: 303 mSDtfsCounter, 192 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:37,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 325 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 21:10:37,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12382 states. [2022-11-02 21:10:38,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12382 to 12382. [2022-11-02 21:10:38,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12382 states, 12381 states have (on average 1.055084403521525) internal successors, (13063), 12381 states have internal predecessors, (13063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:38,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12382 states to 12382 states and 13063 transitions. [2022-11-02 21:10:38,114 INFO L78 Accepts]: Start accepts. Automaton has 12382 states and 13063 transitions. Word has length 564 [2022-11-02 21:10:38,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:38,115 INFO L495 AbstractCegarLoop]: Abstraction has 12382 states and 13063 transitions. [2022-11-02 21:10:38,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:38,116 INFO L276 IsEmpty]: Start isEmpty. Operand 12382 states and 13063 transitions. [2022-11-02 21:10:38,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2022-11-02 21:10:38,128 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:38,129 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:10:38,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 21:10:38,129 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:10:38,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:38,130 INFO L85 PathProgramCache]: Analyzing trace with hash 688501029, now seen corresponding path program 1 times [2022-11-02 21:10:38,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:38,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809341614] [2022-11-02 21:10:38,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:38,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:38,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:38,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 683 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2022-11-02 21:10:38,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:38,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809341614] [2022-11-02 21:10:38,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809341614] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:38,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:38,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:10:38,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976508428] [2022-11-02 21:10:38,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:38,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:10:38,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:38,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:10:38,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:10:38,733 INFO L87 Difference]: Start difference. First operand 12382 states and 13063 transitions. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:39,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:39,547 INFO L93 Difference]: Finished difference Result 26049 states and 27494 transitions. [2022-11-02 21:10:39,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:10:39,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 590 [2022-11-02 21:10:39,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:39,565 INFO L225 Difference]: With dead ends: 26049 [2022-11-02 21:10:39,566 INFO L226 Difference]: Without dead ends: 14037 [2022-11-02 21:10:39,572 INFO L412 NwaCegarLoop]: 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 [2022-11-02 21:10:39,574 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 143 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:39,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 61 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 21:10:39,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14037 states. [2022-11-02 21:10:39,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14037 to 12746. [2022-11-02 21:10:39,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12746 states, 12745 states have (on average 1.0522557865829738) internal successors, (13411), 12745 states have internal predecessors, (13411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:39,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12746 states to 12746 states and 13411 transitions. [2022-11-02 21:10:39,779 INFO L78 Accepts]: Start accepts. Automaton has 12746 states and 13411 transitions. Word has length 590 [2022-11-02 21:10:39,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:39,779 INFO L495 AbstractCegarLoop]: Abstraction has 12746 states and 13411 transitions. [2022-11-02 21:10:39,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:39,780 INFO L276 IsEmpty]: Start isEmpty. Operand 12746 states and 13411 transitions. [2022-11-02 21:10:39,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2022-11-02 21:10:39,791 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:39,792 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:10:39,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 21:10:39,792 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:10:39,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:39,793 INFO L85 PathProgramCache]: Analyzing trace with hash 54450342, now seen corresponding path program 1 times [2022-11-02 21:10:39,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:39,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737507677] [2022-11-02 21:10:39,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:39,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:39,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:40,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1119 backedges. 889 proven. 0 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2022-11-02 21:10:40,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:40,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737507677] [2022-11-02 21:10:40,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737507677] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:40,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:40,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:10:40,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726072663] [2022-11-02 21:10:40,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:40,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:10:40,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:40,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:10:40,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:10:40,617 INFO L87 Difference]: Start difference. First operand 12746 states and 13411 transitions. Second operand has 4 states, 4 states have (on average 98.5) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:41,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:41,842 INFO L93 Difference]: Finished difference Result 32132 states and 33819 transitions. [2022-11-02 21:10:41,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:10:41,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 98.5) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 595 [2022-11-02 21:10:41,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:41,858 INFO L225 Difference]: With dead ends: 32132 [2022-11-02 21:10:41,859 INFO L226 Difference]: Without dead ends: 19388 [2022-11-02 21:10:41,865 INFO L412 NwaCegarLoop]: 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 [2022-11-02 21:10:41,866 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 203 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:41,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 64 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 952 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 21:10:41,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19388 states. [2022-11-02 21:10:42,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19388 to 16250. [2022-11-02 21:10:42,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16250 states, 16249 states have (on average 1.0510800664656286) internal successors, (17079), 16249 states have internal predecessors, (17079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:42,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16250 states to 16250 states and 17079 transitions. [2022-11-02 21:10:42,069 INFO L78 Accepts]: Start accepts. Automaton has 16250 states and 17079 transitions. Word has length 595 [2022-11-02 21:10:42,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:42,070 INFO L495 AbstractCegarLoop]: Abstraction has 16250 states and 17079 transitions. [2022-11-02 21:10:42,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.5) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:42,070 INFO L276 IsEmpty]: Start isEmpty. Operand 16250 states and 17079 transitions. [2022-11-02 21:10:42,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2022-11-02 21:10:42,082 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:42,082 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:10:42,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 21:10:42,083 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:10:42,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:42,083 INFO L85 PathProgramCache]: Analyzing trace with hash 905967947, now seen corresponding path program 1 times [2022-11-02 21:10:42,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:42,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310581384] [2022-11-02 21:10:42,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:42,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:42,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:42,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1201 backedges. 1064 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-11-02 21:10:42,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:42,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310581384] [2022-11-02 21:10:42,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310581384] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:42,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:42,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:10:42,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925065777] [2022-11-02 21:10:42,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:42,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:10:42,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:42,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:10:42,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:10:42,928 INFO L87 Difference]: Start difference. First operand 16250 states and 17079 transitions. Second operand has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:44,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:44,123 INFO L93 Difference]: Finished difference Result 33977 states and 35796 transitions. [2022-11-02 21:10:44,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:10:44,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 601 [2022-11-02 21:10:44,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:44,140 INFO L225 Difference]: With dead ends: 33977 [2022-11-02 21:10:44,140 INFO L226 Difference]: Without dead ends: 17915 [2022-11-02 21:10:44,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:10:44,148 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 186 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:44,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 73 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 941 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 21:10:44,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17915 states. [2022-11-02 21:10:44,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17915 to 17910. [2022-11-02 21:10:44,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17910 states, 17909 states have (on average 1.0521525489977106) internal successors, (18843), 17909 states have internal predecessors, (18843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:44,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17910 states to 17910 states and 18843 transitions. [2022-11-02 21:10:44,353 INFO L78 Accepts]: Start accepts. Automaton has 17910 states and 18843 transitions. Word has length 601 [2022-11-02 21:10:44,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:44,353 INFO L495 AbstractCegarLoop]: Abstraction has 17910 states and 18843 transitions. [2022-11-02 21:10:44,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:44,353 INFO L276 IsEmpty]: Start isEmpty. Operand 17910 states and 18843 transitions. [2022-11-02 21:10:44,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2022-11-02 21:10:44,364 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:10:44,365 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:10:44,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 21:10:44,366 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:10:44,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:10:44,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1278260760, now seen corresponding path program 1 times [2022-11-02 21:10:44,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:10:44,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186509699] [2022-11-02 21:10:44,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:10:44,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:10:44,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:10:45,129 INFO L134 CoverageAnalysis]: Checked inductivity of 862 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2022-11-02 21:10:45,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:10:45,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186509699] [2022-11-02 21:10:45,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186509699] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:10:45,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:10:45,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:10:45,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926749877] [2022-11-02 21:10:45,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:10:45,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:10:45,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:10:45,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:10:45,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:10:45,132 INFO L87 Difference]: Start difference. First operand 17910 states and 18843 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:45,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:10:45,877 INFO L93 Difference]: Finished difference Result 18097 states and 19041 transitions. [2022-11-02 21:10:45,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:10:45,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 608 [2022-11-02 21:10:45,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:10:45,879 INFO L225 Difference]: With dead ends: 18097 [2022-11-02 21:10:45,879 INFO L226 Difference]: Without dead ends: 0 [2022-11-02 21:10:45,885 INFO L412 NwaCegarLoop]: 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 [2022-11-02 21:10:45,885 INFO L413 NwaCegarLoop]: 300 mSDtfsCounter, 162 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 21:10:45,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 322 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 21:10:45,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-02 21:10:45,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-02 21:10:45,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:45,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-02 21:10:45,887 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 608 [2022-11-02 21:10:45,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:10:45,887 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-02 21:10:45,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:10:45,888 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-02 21:10:45,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-02 21:10:45,890 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-02 21:10:45,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 21:10:45,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-02 21:10:58,270 WARN L234 SmtUtils]: Spent 12.37s on a formula simplification. DAG size of input: 794 DAG size of output: 782 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 21:11:10,241 WARN L234 SmtUtils]: Spent 11.96s on a formula simplification. DAG size of input: 794 DAG size of output: 782 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-02 21:11:17,386 WARN L234 SmtUtils]: Spent 7.13s on a formula simplification. DAG size of input: 782 DAG size of output: 129 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-02 21:11:24,347 WARN L234 SmtUtils]: Spent 6.95s on a formula simplification. DAG size of input: 782 DAG size of output: 129 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-02 21:11:24,352 INFO L899 garLoopResultBuilder]: For program point L498(lines 498 509) no Hoare annotation was computed. [2022-11-02 21:11:24,352 INFO L899 garLoopResultBuilder]: For program point L432(lines 432 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,352 INFO L899 garLoopResultBuilder]: For program point L498-2(lines 498 509) no Hoare annotation was computed. [2022-11-02 21:11:24,352 INFO L899 garLoopResultBuilder]: For program point L168-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,352 INFO L899 garLoopResultBuilder]: For program point L102-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,352 INFO L899 garLoopResultBuilder]: For program point L36-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,354 INFO L899 garLoopResultBuilder]: For program point L1027(lines 1027 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,354 INFO L899 garLoopResultBuilder]: For program point L631(lines 631 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,354 INFO L899 garLoopResultBuilder]: For program point L565(lines 565 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,354 INFO L899 garLoopResultBuilder]: For program point L169(line 169) no Hoare annotation was computed. [2022-11-02 21:11:24,354 INFO L899 garLoopResultBuilder]: For program point L103(line 103) no Hoare annotation was computed. [2022-11-02 21:11:24,354 INFO L899 garLoopResultBuilder]: For program point L37(line 37) no Hoare annotation was computed. [2022-11-02 21:11:24,355 INFO L899 garLoopResultBuilder]: For program point L896(lines 896 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,355 INFO L899 garLoopResultBuilder]: For program point L698(lines 698 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,355 INFO L899 garLoopResultBuilder]: For program point L368(lines 368 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,355 INFO L899 garLoopResultBuilder]: For program point L963(lines 963 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,355 INFO L899 garLoopResultBuilder]: For program point L237(lines 237 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,355 INFO L899 garLoopResultBuilder]: For program point L171-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,355 INFO L899 garLoopResultBuilder]: For program point L105-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,355 INFO L899 garLoopResultBuilder]: For program point L39-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,355 INFO L899 garLoopResultBuilder]: For program point L832(lines 832 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,356 INFO L899 garLoopResultBuilder]: For program point L304(lines 304 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,356 INFO L899 garLoopResultBuilder]: For program point L172(line 172) no Hoare annotation was computed. [2022-11-02 21:11:24,356 INFO L899 garLoopResultBuilder]: For program point L106(line 106) no Hoare annotation was computed. [2022-11-02 21:11:24,356 INFO L899 garLoopResultBuilder]: For program point L40(line 40) no Hoare annotation was computed. [2022-11-02 21:11:24,356 INFO L899 garLoopResultBuilder]: For program point L767(lines 767 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,356 INFO L899 garLoopResultBuilder]: For program point L768(lines 768 778) no Hoare annotation was computed. [2022-11-02 21:11:24,356 INFO L899 garLoopResultBuilder]: For program point L768-2(lines 768 778) no Hoare annotation was computed. [2022-11-02 21:11:24,356 INFO L899 garLoopResultBuilder]: For program point L174-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,357 INFO L899 garLoopResultBuilder]: For program point L108-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,357 INFO L899 garLoopResultBuilder]: For program point L42-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,357 INFO L899 garLoopResultBuilder]: For program point L835(lines 835 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,357 INFO L899 garLoopResultBuilder]: For program point L571(lines 571 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,357 INFO L899 garLoopResultBuilder]: For program point L439(lines 439 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,357 INFO L899 garLoopResultBuilder]: For program point L175(line 175) no Hoare annotation was computed. [2022-11-02 21:11:24,357 INFO L899 garLoopResultBuilder]: For program point L109(line 109) no Hoare annotation was computed. [2022-11-02 21:11:24,357 INFO L899 garLoopResultBuilder]: For program point L43(line 43) no Hoare annotation was computed. [2022-11-02 21:11:24,357 INFO L899 garLoopResultBuilder]: For program point L968(lines 968 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,358 INFO L899 garLoopResultBuilder]: For program point L704(lines 704 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,358 INFO L899 garLoopResultBuilder]: For program point L638(lines 638 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,358 INFO L895 garLoopResultBuilder]: At program point L1035(lines 32 1036) the Hoare annotation is: (let ((.cse22 (+ ~a23~0 43))) (let ((.cse10 (<= .cse22 0)) (.cse21 (not (< 306 ~a23~0))) (.cse17 (= ~a25~0 12))) (let ((.cse14 (= ~a25~0 10)) (.cse11 (<= 261 ~a29~0)) (.cse8 (<= (+ 119992 ~a23~0) 0)) (.cse5 (= ~a25~0 11)) (.cse19 (<= 99915 ~a29~0)) (.cse13 (<= ~a29~0 599998)) (.cse18 (or .cse21 (not .cse17) (not (< 277 ~a29~0)))) (.cse12 (<= ~a25~0 10)) (.cse15 (or (not .cse10) (not (= ~a25~0 9)) (not (<= ~a29~0 140)))) (.cse1 (<= ~a23~0 278)) (.cse2 (< 0 .cse22)) (.cse6 (<= ~a29~0 245)) (.cse0 (= ~a25~0 13)) (.cse4 (= ~a4~0 0)) (.cse20 (<= ~a29~0 274)) (.cse7 (<= ~a23~0 138)) (.cse16 (<= 130 ~a29~0)) (.cse9 (<= (+ ~a29~0 22) 0)) (.cse3 (= ~a4~0 1))) (or (and .cse0 .cse1 (<= 99912 ~a29~0) .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse4 .cse9 .cse7) (and .cse10 .cse11 .cse4 .cse12 .cse13) (and .cse4 .cse9 .cse12 .cse7) (and .cse12 .cse3 .cse14) (and .cse12 .cse15 .cse3 .cse16) (and .cse0 (<= 307 ~a23~0) .cse13 .cse3) (and .cse5 .cse2 .cse3 (<= ~a23~0 312)) (and .cse17 .cse3 .cse18 .cse16) (and .cse1 .cse9 .cse2 .cse6 .cse3) (and .cse6 .cse7 .cse15 .cse3 .cse16) (and .cse4 .cse9 (<= 0 (+ ~a29~0 28553)) .cse14) (and .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse11 .cse4 .cse5 .cse13 .cse8) (and .cse4 .cse12 .cse13 .cse19) (and .cse5 .cse3 .cse16) (and .cse4 .cse2 .cse20 .cse7) (and .cse3 .cse18 .cse19 (or (not .cse0) .cse21)) (and .cse17 .cse4 .cse13 .cse18 .cse16) (and .cse12 .cse7 .cse15 .cse3) (and .cse17 .cse4 .cse9) (and .cse1 .cse17 .cse3) (and .cse0 .cse2 .cse6 .cse3) (and .cse0 .cse4 .cse20 .cse7 .cse16) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 1)) .cse17 .cse9 (= ~a3~0 1) .cse3 (<= 312 ~a23~0) (= ~a8~0 15)))))) [2022-11-02 21:11:24,359 INFO L899 garLoopResultBuilder]: For program point L903(lines 903 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,359 INFO L899 garLoopResultBuilder]: For program point L705(lines 705 715) no Hoare annotation was computed. [2022-11-02 21:11:24,359 INFO L899 garLoopResultBuilder]: For program point L705-2(lines 705 715) no Hoare annotation was computed. [2022-11-02 21:11:24,359 INFO L899 garLoopResultBuilder]: For program point L375(lines 375 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,359 INFO L899 garLoopResultBuilder]: For program point L309(lines 309 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,359 INFO L899 garLoopResultBuilder]: For program point L243(lines 243 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,359 INFO L899 garLoopResultBuilder]: For program point L177-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,360 INFO L899 garLoopResultBuilder]: For program point L111-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,360 INFO L899 garLoopResultBuilder]: For program point L45-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,360 INFO L899 garLoopResultBuilder]: For program point L178(line 178) no Hoare annotation was computed. [2022-11-02 21:11:24,360 INFO L899 garLoopResultBuilder]: For program point L112(line 112) no Hoare annotation was computed. [2022-11-02 21:11:24,360 INFO L899 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2022-11-02 21:11:24,360 INFO L902 garLoopResultBuilder]: At program point L1038(lines 1038 1054) the Hoare annotation is: true [2022-11-02 21:11:24,361 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,361 INFO L899 garLoopResultBuilder]: For program point L510(lines 510 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,361 INFO L899 garLoopResultBuilder]: For program point L180-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,361 INFO L899 garLoopResultBuilder]: For program point L114-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,361 INFO L899 garLoopResultBuilder]: For program point L48-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,361 INFO L899 garLoopResultBuilder]: For program point L973(lines 973 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,361 INFO L899 garLoopResultBuilder]: For program point L841(lines 841 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,362 INFO L899 garLoopResultBuilder]: For program point L181(line 181) no Hoare annotation was computed. [2022-11-02 21:11:24,362 INFO L899 garLoopResultBuilder]: For program point L115(line 115) no Hoare annotation was computed. [2022-11-02 21:11:24,362 INFO L899 garLoopResultBuilder]: For program point L49(line 49) no Hoare annotation was computed. [2022-11-02 21:11:24,362 INFO L899 garLoopResultBuilder]: For program point L908(lines 908 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,362 INFO L899 garLoopResultBuilder]: For program point L446(lines 446 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,362 INFO L899 garLoopResultBuilder]: For program point L380(lines 380 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,362 INFO L899 garLoopResultBuilder]: For program point L645(lines 645 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,363 INFO L899 garLoopResultBuilder]: For program point L315(lines 315 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,363 INFO L899 garLoopResultBuilder]: For program point L183-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,363 INFO L899 garLoopResultBuilder]: For program point L117-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,363 INFO L899 garLoopResultBuilder]: For program point L51-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,363 INFO L899 garLoopResultBuilder]: For program point L250(lines 250 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,363 INFO L899 garLoopResultBuilder]: For program point L184(line 184) no Hoare annotation was computed. [2022-11-02 21:11:24,363 INFO L899 garLoopResultBuilder]: For program point L118(line 118) no Hoare annotation was computed. [2022-11-02 21:11:24,364 INFO L899 garLoopResultBuilder]: For program point L52(line 52) no Hoare annotation was computed. [2022-11-02 21:11:24,364 INFO L899 garLoopResultBuilder]: For program point L779(lines 779 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,364 INFO L895 garLoopResultBuilder]: At program point L1044-2(lines 1044 1053) the Hoare annotation is: (let ((.cse22 (+ ~a23~0 43))) (let ((.cse10 (<= .cse22 0)) (.cse21 (not (< 306 ~a23~0))) (.cse17 (= ~a25~0 12))) (let ((.cse14 (= ~a25~0 10)) (.cse11 (<= 261 ~a29~0)) (.cse8 (<= (+ 119992 ~a23~0) 0)) (.cse5 (= ~a25~0 11)) (.cse19 (<= 99915 ~a29~0)) (.cse13 (<= ~a29~0 599998)) (.cse18 (or .cse21 (not .cse17) (not (< 277 ~a29~0)))) (.cse12 (<= ~a25~0 10)) (.cse15 (or (not .cse10) (not (= ~a25~0 9)) (not (<= ~a29~0 140)))) (.cse1 (<= ~a23~0 278)) (.cse2 (< 0 .cse22)) (.cse6 (<= ~a29~0 245)) (.cse0 (= ~a25~0 13)) (.cse4 (= ~a4~0 0)) (.cse20 (<= ~a29~0 274)) (.cse7 (<= ~a23~0 138)) (.cse16 (<= 130 ~a29~0)) (.cse9 (<= (+ ~a29~0 22) 0)) (.cse3 (= ~a4~0 1))) (or (and .cse0 .cse1 (<= 99912 ~a29~0) .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse4 .cse9 .cse7) (and .cse10 .cse11 .cse4 .cse12 .cse13) (and .cse4 .cse9 .cse12 .cse7) (and .cse12 .cse3 .cse14) (and .cse12 .cse15 .cse3 .cse16) (and .cse0 (<= 307 ~a23~0) .cse13 .cse3) (and .cse5 .cse2 .cse3 (<= ~a23~0 312)) (and .cse17 .cse3 .cse18 .cse16) (and .cse1 .cse9 .cse2 .cse6 .cse3) (and .cse6 .cse7 .cse15 .cse3 .cse16) (and .cse4 .cse9 (<= 0 (+ ~a29~0 28553)) .cse14) (and .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse11 .cse4 .cse5 .cse13 .cse8) (and .cse4 .cse12 .cse13 .cse19) (and .cse5 .cse3 .cse16) (and .cse4 .cse2 .cse20 .cse7) (and .cse3 .cse18 .cse19 (or (not .cse0) .cse21)) (and .cse17 .cse4 .cse13 .cse18 .cse16) (and .cse12 .cse7 .cse15 .cse3) (and .cse17 .cse4 .cse9) (and .cse1 .cse17 .cse3) (and .cse0 .cse2 .cse6 .cse3) (and .cse0 .cse4 .cse20 .cse7 .cse16) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 1)) .cse17 .cse9 (= ~a3~0 1) .cse3 (<= 312 ~a23~0) (= ~a8~0 15)))))) [2022-11-02 21:11:24,364 INFO L899 garLoopResultBuilder]: For program point L846(lines 846 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,365 INFO L899 garLoopResultBuilder]: For program point L582(lines 582 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,365 INFO L899 garLoopResultBuilder]: For program point L186-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,365 INFO L899 garLoopResultBuilder]: For program point L120-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,365 INFO L899 garLoopResultBuilder]: For program point L54-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,365 INFO L899 garLoopResultBuilder]: For program point L979(lines 979 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,365 INFO L899 garLoopResultBuilder]: For program point L913(lines 913 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,365 INFO L899 garLoopResultBuilder]: For program point L517(lines 517 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,366 INFO L899 garLoopResultBuilder]: For program point L187(line 187) no Hoare annotation was computed. [2022-11-02 21:11:24,366 INFO L899 garLoopResultBuilder]: For program point L121(line 121) no Hoare annotation was computed. [2022-11-02 21:11:24,366 INFO L899 garLoopResultBuilder]: For program point L55(line 55) no Hoare annotation was computed. [2022-11-02 21:11:24,366 INFO L899 garLoopResultBuilder]: For program point L980(lines 980 990) no Hoare annotation was computed. [2022-11-02 21:11:24,366 INFO L899 garLoopResultBuilder]: For program point L914(lines 914 924) no Hoare annotation was computed. [2022-11-02 21:11:24,366 INFO L899 garLoopResultBuilder]: For program point L980-2(lines 980 990) no Hoare annotation was computed. [2022-11-02 21:11:24,366 INFO L899 garLoopResultBuilder]: For program point L914-2(lines 914 924) no Hoare annotation was computed. [2022-11-02 21:11:24,367 INFO L899 garLoopResultBuilder]: For program point L716(lines 716 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,367 INFO L899 garLoopResultBuilder]: For program point L320(lines 320 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,367 INFO L899 garLoopResultBuilder]: For program point L585(lines 585 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,367 INFO L899 garLoopResultBuilder]: For program point L453(lines 453 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,367 INFO L899 garLoopResultBuilder]: For program point L387(lines 387 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,367 INFO L899 garLoopResultBuilder]: For program point L189-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,368 INFO L899 garLoopResultBuilder]: For program point L123-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,368 INFO L899 garLoopResultBuilder]: For program point L57-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,368 INFO L899 garLoopResultBuilder]: For program point L784(lines 784 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,368 INFO L899 garLoopResultBuilder]: For program point L652(lines 652 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,368 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-02 21:11:24,368 INFO L899 garLoopResultBuilder]: For program point L190(line 190) no Hoare annotation was computed. [2022-11-02 21:11:24,368 INFO L899 garLoopResultBuilder]: For program point L124(line 124) no Hoare annotation was computed. [2022-11-02 21:11:24,369 INFO L899 garLoopResultBuilder]: For program point L58(line 58) no Hoare annotation was computed. [2022-11-02 21:11:24,369 INFO L899 garLoopResultBuilder]: For program point L1049(line 1049) no Hoare annotation was computed. [2022-11-02 21:11:24,369 INFO L899 garLoopResultBuilder]: For program point L851(lines 851 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,369 INFO L899 garLoopResultBuilder]: For program point L257(lines 257 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,369 INFO L899 garLoopResultBuilder]: For program point L192-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,369 INFO L899 garLoopResultBuilder]: For program point L126-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,369 INFO L899 garLoopResultBuilder]: For program point L60-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,370 INFO L899 garLoopResultBuilder]: For program point L193(line 193) no Hoare annotation was computed. [2022-11-02 21:11:24,370 INFO L899 garLoopResultBuilder]: For program point L127(line 127) no Hoare annotation was computed. [2022-11-02 21:11:24,370 INFO L899 garLoopResultBuilder]: For program point L61(line 61) no Hoare annotation was computed. [2022-11-02 21:11:24,370 INFO L899 garLoopResultBuilder]: For program point L722(lines 722 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,370 INFO L899 garLoopResultBuilder]: For program point L524(lines 524 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,370 INFO L899 garLoopResultBuilder]: For program point L657(lines 657 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,370 INFO L899 garLoopResultBuilder]: For program point L591(lines 591 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,371 INFO L899 garLoopResultBuilder]: For program point L525(lines 525 535) no Hoare annotation was computed. [2022-11-02 21:11:24,371 INFO L899 garLoopResultBuilder]: For program point L525-2(lines 525 535) no Hoare annotation was computed. [2022-11-02 21:11:24,371 INFO L899 garLoopResultBuilder]: For program point L327(lines 327 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,371 INFO L899 garLoopResultBuilder]: For program point L195-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,371 INFO L899 garLoopResultBuilder]: For program point L129-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,371 INFO L899 garLoopResultBuilder]: For program point L63-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,371 INFO L899 garLoopResultBuilder]: For program point L856(lines 856 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,372 INFO L899 garLoopResultBuilder]: For program point L790(lines 790 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,372 INFO L899 garLoopResultBuilder]: For program point L658(lines 658 667) no Hoare annotation was computed. [2022-11-02 21:11:24,372 INFO L899 garLoopResultBuilder]: For program point L658-2(lines 658 667) no Hoare annotation was computed. [2022-11-02 21:11:24,372 INFO L899 garLoopResultBuilder]: For program point L460(lines 460 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,372 INFO L899 garLoopResultBuilder]: For program point L394(lines 394 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,372 INFO L899 garLoopResultBuilder]: For program point L196(line 196) no Hoare annotation was computed. [2022-11-02 21:11:24,373 INFO L899 garLoopResultBuilder]: For program point L130(line 130) no Hoare annotation was computed. [2022-11-02 21:11:24,373 INFO L899 garLoopResultBuilder]: For program point L64(line 64) no Hoare annotation was computed. [2022-11-02 21:11:24,373 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-02 21:11:24,373 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 100) no Hoare annotation was computed. [2022-11-02 21:11:24,373 INFO L899 garLoopResultBuilder]: For program point L264(lines 264 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,373 INFO L899 garLoopResultBuilder]: For program point L198-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,373 INFO L899 garLoopResultBuilder]: For program point L132-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,374 INFO L899 garLoopResultBuilder]: For program point L66-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,374 INFO L899 garLoopResultBuilder]: For program point L991(lines 991 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,374 INFO L899 garLoopResultBuilder]: For program point L925(lines 925 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,374 INFO L899 garLoopResultBuilder]: For program point L727(lines 727 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,374 INFO L899 garLoopResultBuilder]: For program point L199(line 199) no Hoare annotation was computed. [2022-11-02 21:11:24,374 INFO L899 garLoopResultBuilder]: For program point L133(line 133) no Hoare annotation was computed. [2022-11-02 21:11:24,374 INFO L899 garLoopResultBuilder]: For program point L67(line 67) no Hoare annotation was computed. [2022-11-02 21:11:24,375 INFO L899 garLoopResultBuilder]: For program point L926(lines 926 936) no Hoare annotation was computed. [2022-11-02 21:11:24,375 INFO L899 garLoopResultBuilder]: For program point L926-2(lines 926 936) no Hoare annotation was computed. [2022-11-02 21:11:24,375 INFO L899 garLoopResultBuilder]: For program point L728(lines 728 740) no Hoare annotation was computed. [2022-11-02 21:11:24,375 INFO L899 garLoopResultBuilder]: For program point L728-2(lines 728 740) no Hoare annotation was computed. [2022-11-02 21:11:24,375 INFO L899 garLoopResultBuilder]: For program point L596(lines 596 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,375 INFO L899 garLoopResultBuilder]: For program point L332(lines 332 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,375 INFO L899 garLoopResultBuilder]: For program point L597(lines 597 607) no Hoare annotation was computed. [2022-11-02 21:11:24,376 INFO L899 garLoopResultBuilder]: For program point L597-2(lines 597 607) no Hoare annotation was computed. [2022-11-02 21:11:24,376 INFO L899 garLoopResultBuilder]: For program point L201-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,376 INFO L899 garLoopResultBuilder]: For program point L135-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,376 INFO L899 garLoopResultBuilder]: For program point L69-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,376 INFO L899 garLoopResultBuilder]: For program point L862(lines 862 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,376 INFO L899 garLoopResultBuilder]: For program point L466(lines 466 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,376 INFO L899 garLoopResultBuilder]: For program point L202(line 202) no Hoare annotation was computed. [2022-11-02 21:11:24,377 INFO L899 garLoopResultBuilder]: For program point L136(line 136) no Hoare annotation was computed. [2022-11-02 21:11:24,377 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2022-11-02 21:11:24,377 INFO L899 garLoopResultBuilder]: For program point L797(lines 797 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,377 INFO L899 garLoopResultBuilder]: For program point L401(lines 401 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,377 INFO L899 garLoopResultBuilder]: For program point L270(lines 270 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,377 INFO L899 garLoopResultBuilder]: For program point L204-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,377 INFO L899 garLoopResultBuilder]: For program point L138-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,378 INFO L899 garLoopResultBuilder]: For program point L72-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,378 INFO L899 garLoopResultBuilder]: For program point L205(line 205) no Hoare annotation was computed. [2022-11-02 21:11:24,378 INFO L899 garLoopResultBuilder]: For program point L139(line 139) no Hoare annotation was computed. [2022-11-02 21:11:24,378 INFO L899 garLoopResultBuilder]: For program point L73(line 73) no Hoare annotation was computed. [2022-11-02 21:11:24,378 INFO L899 garLoopResultBuilder]: For program point L998(lines 998 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,378 INFO L899 garLoopResultBuilder]: For program point L668(lines 668 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,378 INFO L899 garLoopResultBuilder]: For program point L536(lines 536 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,379 INFO L899 garLoopResultBuilder]: For program point L339(lines 339 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,379 INFO L899 garLoopResultBuilder]: For program point L207-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,379 INFO L899 garLoopResultBuilder]: For program point L141-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,379 INFO L899 garLoopResultBuilder]: For program point L75-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,379 INFO L899 garLoopResultBuilder]: For program point L802(lines 802 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,379 INFO L899 garLoopResultBuilder]: For program point L208(line 208) no Hoare annotation was computed. [2022-11-02 21:11:24,380 INFO L899 garLoopResultBuilder]: For program point L142(line 142) no Hoare annotation was computed. [2022-11-02 21:11:24,380 INFO L899 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2022-11-02 21:11:24,380 INFO L899 garLoopResultBuilder]: For program point L869(lines 869 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,380 INFO L899 garLoopResultBuilder]: For program point L473(lines 473 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,380 INFO L899 garLoopResultBuilder]: For program point L275(lines 275 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,380 INFO L899 garLoopResultBuilder]: For program point L408(lines 408 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,380 INFO L899 garLoopResultBuilder]: For program point L210-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,381 INFO L899 garLoopResultBuilder]: For program point L144-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,381 INFO L899 garLoopResultBuilder]: For program point L78-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,381 INFO L899 garLoopResultBuilder]: For program point L1003(lines 1003 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,381 INFO L899 garLoopResultBuilder]: For program point L937(lines 937 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,381 INFO L899 garLoopResultBuilder]: For program point L673(lines 673 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,381 INFO L899 garLoopResultBuilder]: For program point L541(lines 541 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,381 INFO L899 garLoopResultBuilder]: For program point L409(lines 409 420) no Hoare annotation was computed. [2022-11-02 21:11:24,382 INFO L899 garLoopResultBuilder]: For program point L409-2(lines 409 420) no Hoare annotation was computed. [2022-11-02 21:11:24,382 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-11-02 21:11:24,382 INFO L899 garLoopResultBuilder]: For program point L145(line 145) no Hoare annotation was computed. [2022-11-02 21:11:24,382 INFO L899 garLoopResultBuilder]: For program point L79(line 79) no Hoare annotation was computed. [2022-11-02 21:11:24,382 INFO L899 garLoopResultBuilder]: For program point L608(lines 608 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,382 INFO L899 garLoopResultBuilder]: For program point L344(lines 344 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,382 INFO L899 garLoopResultBuilder]: For program point L278(lines 278 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,383 INFO L899 garLoopResultBuilder]: For program point L741(lines 741 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,383 INFO L899 garLoopResultBuilder]: For program point L213-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,383 INFO L899 garLoopResultBuilder]: For program point L147-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,383 INFO L899 garLoopResultBuilder]: For program point L81-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,383 INFO L899 garLoopResultBuilder]: For program point L214(line 214) no Hoare annotation was computed. [2022-11-02 21:11:24,383 INFO L899 garLoopResultBuilder]: For program point L148(line 148) no Hoare annotation was computed. [2022-11-02 21:11:24,383 INFO L899 garLoopResultBuilder]: For program point L82(line 82) no Hoare annotation was computed. [2022-11-02 21:11:24,384 INFO L899 garLoopResultBuilder]: For program point L875(lines 875 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,384 INFO L899 garLoopResultBuilder]: For program point L809(lines 809 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,384 INFO L899 garLoopResultBuilder]: For program point L942(lines 942 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,384 INFO L899 garLoopResultBuilder]: For program point L876(lines 876 885) no Hoare annotation was computed. [2022-11-02 21:11:24,384 INFO L899 garLoopResultBuilder]: For program point L876-2(lines 876 885) no Hoare annotation was computed. [2022-11-02 21:11:24,384 INFO L899 garLoopResultBuilder]: For program point L480(lines 480 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,384 INFO L899 garLoopResultBuilder]: For program point L150-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,385 INFO L899 garLoopResultBuilder]: For program point L84-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,385 INFO L899 garLoopResultBuilder]: For program point L613(lines 613 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,385 INFO L899 garLoopResultBuilder]: For program point L547(lines 547 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,385 INFO L899 garLoopResultBuilder]: For program point L151(line 151) no Hoare annotation was computed. [2022-11-02 21:11:24,385 INFO L899 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2022-11-02 21:11:24,385 INFO L899 garLoopResultBuilder]: For program point L1010(lines 1010 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,385 INFO L899 garLoopResultBuilder]: For program point L680(lines 680 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,386 INFO L899 garLoopResultBuilder]: For program point L614(lines 614 624) no Hoare annotation was computed. [2022-11-02 21:11:24,386 INFO L899 garLoopResultBuilder]: For program point L614-2(lines 614 624) no Hoare annotation was computed. [2022-11-02 21:11:24,386 INFO L899 garLoopResultBuilder]: For program point L350(lines 350 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,386 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-02 21:11:24,386 INFO L899 garLoopResultBuilder]: For program point L285(lines 285 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,386 INFO L899 garLoopResultBuilder]: For program point L153-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,386 INFO L899 garLoopResultBuilder]: For program point L87-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,387 INFO L899 garLoopResultBuilder]: For program point L814(lines 814 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,387 INFO L899 garLoopResultBuilder]: For program point L748(lines 748 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,387 INFO L899 garLoopResultBuilder]: For program point L154(line 154) no Hoare annotation was computed. [2022-11-02 21:11:24,387 INFO L899 garLoopResultBuilder]: For program point L88(line 88) no Hoare annotation was computed. [2022-11-02 21:11:24,387 INFO L899 garLoopResultBuilder]: For program point L815(lines 815 825) no Hoare annotation was computed. [2022-11-02 21:11:24,387 INFO L899 garLoopResultBuilder]: For program point L815-2(lines 815 825) no Hoare annotation was computed. [2022-11-02 21:11:24,387 INFO L899 garLoopResultBuilder]: For program point L552(lines 552 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,388 INFO L899 garLoopResultBuilder]: For program point L156-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,388 INFO L899 garLoopResultBuilder]: For program point L90-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,388 INFO L899 garLoopResultBuilder]: For program point L1015(lines 1015 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,388 INFO L899 garLoopResultBuilder]: For program point L949(lines 949 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,388 INFO L899 garLoopResultBuilder]: For program point L685(lines 685 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,388 INFO L899 garLoopResultBuilder]: For program point L487(lines 487 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,388 INFO L899 garLoopResultBuilder]: For program point L421(lines 421 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,389 INFO L899 garLoopResultBuilder]: For program point L157(line 157) no Hoare annotation was computed. [2022-11-02 21:11:24,389 INFO L899 garLoopResultBuilder]: For program point L91(line 91) no Hoare annotation was computed. [2022-11-02 21:11:24,389 INFO L899 garLoopResultBuilder]: For program point L950(lines 950 962) no Hoare annotation was computed. [2022-11-02 21:11:24,389 INFO L899 garLoopResultBuilder]: For program point L950-2(lines 950 962) no Hoare annotation was computed. [2022-11-02 21:11:24,389 INFO L899 garLoopResultBuilder]: For program point L488(lines 488 496) no Hoare annotation was computed. [2022-11-02 21:11:24,389 INFO L899 garLoopResultBuilder]: For program point L488-2(lines 488 496) no Hoare annotation was computed. [2022-11-02 21:11:24,389 INFO L899 garLoopResultBuilder]: For program point L356(lines 356 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,390 INFO L899 garLoopResultBuilder]: For program point L290(lines 290 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,390 INFO L899 garLoopResultBuilder]: For program point L224(lines 224 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,390 INFO L899 garLoopResultBuilder]: For program point L753(lines 753 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,390 INFO L899 garLoopResultBuilder]: For program point L159-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,390 INFO L899 garLoopResultBuilder]: For program point L93-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,390 INFO L899 garLoopResultBuilder]: For program point L886(lines 886 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,391 INFO L899 garLoopResultBuilder]: For program point L160(line 160) no Hoare annotation was computed. [2022-11-02 21:11:24,391 INFO L899 garLoopResultBuilder]: For program point L94(line 94) no Hoare annotation was computed. [2022-11-02 21:11:24,391 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-02 21:11:24,391 INFO L899 garLoopResultBuilder]: For program point L162-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,391 INFO L899 garLoopResultBuilder]: For program point L96-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,391 INFO L899 garLoopResultBuilder]: For program point L691(lines 691 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,391 INFO L899 garLoopResultBuilder]: For program point L625(lines 625 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,392 INFO L899 garLoopResultBuilder]: For program point L559(lines 559 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,392 INFO L899 garLoopResultBuilder]: For program point L427(lines 427 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,392 INFO L899 garLoopResultBuilder]: For program point L163(line 163) no Hoare annotation was computed. [2022-11-02 21:11:24,392 INFO L899 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2022-11-02 21:11:24,392 INFO L899 garLoopResultBuilder]: For program point L1022(lines 1022 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,392 INFO L899 garLoopResultBuilder]: For program point L891(lines 891 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,393 INFO L899 garLoopResultBuilder]: For program point L363(lines 363 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,393 INFO L899 garLoopResultBuilder]: For program point L297(lines 297 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,393 INFO L899 garLoopResultBuilder]: For program point L231(lines 231 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,393 INFO L899 garLoopResultBuilder]: For program point L165-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,393 INFO L899 garLoopResultBuilder]: For program point L99-1(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,393 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 35) no Hoare annotation was computed. [2022-11-02 21:11:24,393 INFO L899 garLoopResultBuilder]: For program point L33-2(lines 32 1036) no Hoare annotation was computed. [2022-11-02 21:11:24,394 INFO L899 garLoopResultBuilder]: For program point L826(lines 826 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,394 INFO L899 garLoopResultBuilder]: For program point L760(lines 760 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,394 INFO L899 garLoopResultBuilder]: For program point L166(line 166) no Hoare annotation was computed. [2022-11-02 21:11:24,394 INFO L899 garLoopResultBuilder]: For program point L100(line 100) no Hoare annotation was computed. [2022-11-02 21:11:24,394 INFO L899 garLoopResultBuilder]: For program point L34(line 34) no Hoare annotation was computed. [2022-11-02 21:11:24,394 INFO L899 garLoopResultBuilder]: For program point L497(lines 497 1034) no Hoare annotation was computed. [2022-11-02 21:11:24,398 INFO L444 BasicCegarLoop]: Path program 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] [2022-11-02 21:11:24,400 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 21:11:24,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 09:11:24 BoogieIcfgContainer [2022-11-02 21:11:24,426 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 21:11:24,427 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 21:11:24,427 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 21:11:24,427 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 21:11:24,428 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:09:46" (3/4) ... [2022-11-02 21:11:24,438 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 21:11:24,469 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-11-02 21:11:24,471 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-02 21:11:24,472 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-02 21:11:24,473 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 21:11:24,619 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95299524-91e1-4cb6-a397-e13d81af67da/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 21:11:24,619 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 21:11:24,620 INFO L158 Benchmark]: Toolchain (without parser) took 101837.66ms. Allocated memory was 127.9MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 92.0MB in the beginning and 514.6MB in the end (delta: -422.6MB). Peak memory consumption was 677.9MB. Max. memory is 16.1GB. [2022-11-02 21:11:24,620 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 92.3MB. Free memory was 46.0MB in the beginning and 45.9MB in the end (delta: 45.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 21:11:24,621 INFO L158 Benchmark]: CACSL2BoogieTranslator took 914.99ms. Allocated memory is still 127.9MB. Free memory was 91.7MB in the beginning and 70.6MB in the end (delta: 21.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-02 21:11:24,622 INFO L158 Benchmark]: Boogie Procedure Inliner took 160.55ms. Allocated memory is still 127.9MB. Free memory was 70.6MB in the beginning and 53.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-02 21:11:24,623 INFO L158 Benchmark]: Boogie Preprocessor took 152.17ms. Allocated memory is still 127.9MB. Free memory was 53.8MB in the beginning and 44.1MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 21:11:24,623 INFO L158 Benchmark]: RCFGBuilder took 2252.95ms. Allocated memory was 127.9MB in the beginning and 188.7MB in the end (delta: 60.8MB). Free memory was 44.1MB in the beginning and 94.8MB in the end (delta: -50.6MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. [2022-11-02 21:11:24,625 INFO L158 Benchmark]: TraceAbstraction took 98153.98ms. Allocated memory was 188.7MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 93.7MB in the beginning and 530.1MB in the end (delta: -436.4MB). Peak memory consumption was 723.4MB. Max. memory is 16.1GB. [2022-11-02 21:11:24,626 INFO L158 Benchmark]: Witness Printer took 193.01ms. Allocated memory is still 1.2GB. Free memory was 530.1MB in the beginning and 514.6MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-02 21:11:24,637 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 92.3MB. Free memory was 46.0MB in the beginning and 45.9MB in the end (delta: 45.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 914.99ms. Allocated memory is still 127.9MB. Free memory was 91.7MB in the beginning and 70.6MB in the end (delta: 21.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 160.55ms. Allocated memory is still 127.9MB. Free memory was 70.6MB in the beginning and 53.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 152.17ms. Allocated memory is still 127.9MB. Free memory was 53.8MB in the beginning and 44.1MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 2252.95ms. Allocated memory was 127.9MB in the beginning and 188.7MB in the end (delta: 60.8MB). Free memory was 44.1MB in the beginning and 94.8MB in the end (delta: -50.6MB). Peak memory consumption was 25.3MB. Max. memory is 16.1GB. * TraceAbstraction took 98153.98ms. Allocated memory was 188.7MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 93.7MB in the beginning and 530.1MB in the end (delta: -436.4MB). Peak memory consumption was 723.4MB. Max. memory is 16.1GB. * Witness Printer took 193.01ms. Allocated memory is still 1.2GB. Free memory was 530.1MB in the beginning and 514.6MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 100]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 98.1s, OverallIterations: 24, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 34.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 38.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5258 SdHoareTripleChecker+Valid, 29.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5258 mSDsluCounter, 4945 SdHoareTripleChecker+Invalid, 24.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 794 mSDsCounter, 3346 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20840 IncrementalHoareTripleChecker+Invalid, 24186 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3346 mSolverCounterUnsat, 4151 mSDtfsCounter, 20840 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 924 GetRequests, 852 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17910occurred in iteration=23, InterpolantAutomatonStates: 115, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 24079 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 267 NumberOfFragments, 937 HoareAnnotationTreeSize, 3 FomulaSimplifications, 14878 FormulaSimplificationTreeSizeReduction, 24.3s HoareSimplificationTime, 3 FomulaSimplificationsInter, 240356 FormulaSimplificationTreeSizeReductionInter, 14.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 17.8s InterpolantComputationTime, 9348 NumberOfCodeBlocks, 9348 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 9730 ConstructedInterpolants, 0 QuantifiedInterpolants, 34066 SizeOfPredicates, 1 NumberOfNonLiveVariables, 556 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 26 InterpolantComputations, 23 PerfectInterpolantSequences, 12176/12426 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((a25 == 13 && a23 <= 278) && 99912 <= a29) && 0 < a23 + 43) && a4 == 1) || ((((a4 == 0 && a25 == 11) && a29 <= 245) && a23 <= 138) && 119992 + a23 <= 0)) || (((a25 == 13 && a4 == 0) && a29 + 22 <= 0) && a23 <= 138)) || ((((a23 + 43 <= 0 && 261 <= a29) && a4 == 0) && a25 <= 10) && a29 <= 599998)) || (((a4 == 0 && a29 + 22 <= 0) && a25 <= 10) && a23 <= 138)) || ((a25 <= 10 && a4 == 1) && a25 == 10)) || (((a25 <= 10 && ((!(a23 + 43 <= 0) || !(a25 == 9)) || !(a29 <= 140))) && a4 == 1) && 130 <= a29)) || (((a25 == 13 && 307 <= a23) && a29 <= 599998) && a4 == 1)) || (((a25 == 11 && 0 < a23 + 43) && a4 == 1) && a23 <= 312)) || (((a25 == 12 && a4 == 1) && ((!(306 < a23) || !(a25 == 12)) || !(277 < a29))) && 130 <= a29)) || ((((a23 <= 278 && a29 + 22 <= 0) && 0 < a23 + 43) && a29 <= 245) && a4 == 1)) || ((((a29 <= 245 && a23 <= 138) && ((!(a23 + 43 <= 0) || !(a25 == 9)) || !(a29 <= 140))) && a4 == 1) && 130 <= a29)) || (((a4 == 0 && a29 + 22 <= 0) && 0 <= a29 + 28553) && a25 == 10)) || ((((a4 == 0 && a25 == 11) && a29 + 22 <= 0) && a29 <= 245) && a23 <= 138)) || ((((261 <= a29 && a4 == 0) && a25 == 11) && a29 <= 599998) && 119992 + a23 <= 0)) || (((a4 == 0 && a25 <= 10) && a29 <= 599998) && 99915 <= a29)) || ((a25 == 11 && a4 == 1) && 130 <= a29)) || (((a4 == 0 && 0 < a23 + 43) && a29 <= 274) && a23 <= 138)) || (((a4 == 1 && ((!(306 < a23) || !(a25 == 12)) || !(277 < a29))) && 99915 <= a29) && (!(a25 == 13) || !(306 < a23)))) || ((((a25 == 12 && a4 == 0) && a29 <= 599998) && ((!(306 < a23) || !(a25 == 12)) || !(277 < a29))) && 130 <= a29)) || (((a25 <= 10 && a23 <= 138) && ((!(a23 + 43 <= 0) || !(a25 == 9)) || !(a29 <= 140))) && a4 == 1)) || ((a25 == 12 && a4 == 0) && a29 + 22 <= 0)) || ((a23 <= 278 && a25 == 12) && a4 == 1)) || (((a25 == 13 && 0 < a23 + 43) && a29 <= 245) && a4 == 1)) || ((((a25 == 13 && a4 == 0) && a29 <= 274) && a23 <= 138) && 130 <= a29)) || ((((((!(input == 1) && a25 == 12) && a29 + 22 <= 0) && a3 == 1) && a4 == 1) && 312 <= a23) && a8 == 15) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((a25 == 13 && a23 <= 278) && 99912 <= a29) && 0 < a23 + 43) && a4 == 1) || ((((a4 == 0 && a25 == 11) && a29 <= 245) && a23 <= 138) && 119992 + a23 <= 0)) || (((a25 == 13 && a4 == 0) && a29 + 22 <= 0) && a23 <= 138)) || ((((a23 + 43 <= 0 && 261 <= a29) && a4 == 0) && a25 <= 10) && a29 <= 599998)) || (((a4 == 0 && a29 + 22 <= 0) && a25 <= 10) && a23 <= 138)) || ((a25 <= 10 && a4 == 1) && a25 == 10)) || (((a25 <= 10 && ((!(a23 + 43 <= 0) || !(a25 == 9)) || !(a29 <= 140))) && a4 == 1) && 130 <= a29)) || (((a25 == 13 && 307 <= a23) && a29 <= 599998) && a4 == 1)) || (((a25 == 11 && 0 < a23 + 43) && a4 == 1) && a23 <= 312)) || (((a25 == 12 && a4 == 1) && ((!(306 < a23) || !(a25 == 12)) || !(277 < a29))) && 130 <= a29)) || ((((a23 <= 278 && a29 + 22 <= 0) && 0 < a23 + 43) && a29 <= 245) && a4 == 1)) || ((((a29 <= 245 && a23 <= 138) && ((!(a23 + 43 <= 0) || !(a25 == 9)) || !(a29 <= 140))) && a4 == 1) && 130 <= a29)) || (((a4 == 0 && a29 + 22 <= 0) && 0 <= a29 + 28553) && a25 == 10)) || ((((a4 == 0 && a25 == 11) && a29 + 22 <= 0) && a29 <= 245) && a23 <= 138)) || ((((261 <= a29 && a4 == 0) && a25 == 11) && a29 <= 599998) && 119992 + a23 <= 0)) || (((a4 == 0 && a25 <= 10) && a29 <= 599998) && 99915 <= a29)) || ((a25 == 11 && a4 == 1) && 130 <= a29)) || (((a4 == 0 && 0 < a23 + 43) && a29 <= 274) && a23 <= 138)) || (((a4 == 1 && ((!(306 < a23) || !(a25 == 12)) || !(277 < a29))) && 99915 <= a29) && (!(a25 == 13) || !(306 < a23)))) || ((((a25 == 12 && a4 == 0) && a29 <= 599998) && ((!(306 < a23) || !(a25 == 12)) || !(277 < a29))) && 130 <= a29)) || (((a25 <= 10 && a23 <= 138) && ((!(a23 + 43 <= 0) || !(a25 == 9)) || !(a29 <= 140))) && a4 == 1)) || ((a25 == 12 && a4 == 0) && a29 + 22 <= 0)) || ((a23 <= 278 && a25 == 12) && a4 == 1)) || (((a25 == 13 && 0 < a23 + 43) && a29 <= 245) && a4 == 1)) || ((((a25 == 13 && a4 == 0) && a29 <= 274) && a23 <= 138) && 130 <= a29)) || ((((((!(input == 1) && a25 == 12) && a29 + 22 <= 0) && a3 == 1) && a4 == 1) && 312 <= a23) && a8 == 15) - InvariantResult [Line: 1038]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-02 21:11:24,688 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95299524-91e1-4cb6-a397-e13d81af67da/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE