./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label39.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem02_label39.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 1e4f61af9a0cb0797f7e34da0b07a857e7ae44f0a7943fff0d2a78c0cd17574b --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-11 23:59:34,758 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 23:59:34,760 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 23:59:34,787 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 23:59:34,787 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 23:59:34,788 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 23:59:34,792 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 23:59:34,796 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 23:59:34,797 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 23:59:34,802 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 23:59:34,802 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 23:59:34,804 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 23:59:34,804 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 23:59:34,806 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 23:59:34,807 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 23:59:34,808 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 23:59:34,809 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 23:59:34,810 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 23:59:34,813 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 23:59:34,814 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 23:59:34,817 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 23:59:34,818 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 23:59:34,819 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 23:59:34,819 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 23:59:34,820 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 23:59:34,823 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 23:59:34,824 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 23:59:34,824 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 23:59:34,825 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 23:59:34,825 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 23:59:34,826 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 23:59:34,826 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 23:59:34,828 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 23:59:34,828 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 23:59:34,828 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 23:59:34,829 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 23:59:34,829 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 23:59:34,829 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 23:59:34,830 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 23:59:34,830 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 23:59:34,830 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 23:59:34,832 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 23:59:34,833 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-11 23:59:34,852 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 23:59:34,853 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 23:59:34,853 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 23:59:34,854 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 23:59:34,854 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 23:59:34,854 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 23:59:34,855 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 23:59:34,855 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 23:59:34,855 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 23:59:34,856 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 23:59:34,856 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 23:59:34,856 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-11 23:59:34,856 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 23:59:34,856 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 23:59:34,856 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 23:59:34,857 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 23:59:34,857 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 23:59:34,857 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 23:59:34,857 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 23:59:34,857 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 23:59:34,857 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 23:59:34,857 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 23:59:34,858 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 23:59:34,858 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 23:59:34,858 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:59:34,858 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 23:59:34,858 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 23:59:34,858 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 23:59:34,859 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-11 23:59:34,859 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-11 23:59:34,859 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 23:59:34,859 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 23:59:34,859 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 23:59:34,859 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 1e4f61af9a0cb0797f7e34da0b07a857e7ae44f0a7943fff0d2a78c0cd17574b [2022-07-11 23:59:35,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 23:59:35,087 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 23:59:35,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 23:59:35,090 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 23:59:35,090 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 23:59:35,091 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label39.c [2022-07-11 23:59:35,151 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e84e7816/0f4a25370b3a4883be7c01cadc58aea8/FLAG9dbd5c99b [2022-07-11 23:59:35,506 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 23:59:35,507 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label39.c [2022-07-11 23:59:35,517 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e84e7816/0f4a25370b3a4883be7c01cadc58aea8/FLAG9dbd5c99b [2022-07-11 23:59:35,895 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e84e7816/0f4a25370b3a4883be7c01cadc58aea8 [2022-07-11 23:59:35,897 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 23:59:35,898 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 23:59:35,914 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 23:59:35,919 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 23:59:35,922 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 23:59:35,922 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:59:35" (1/1) ... [2022-07-11 23:59:35,923 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51562660 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:59:35, skipping insertion in model container [2022-07-11 23:59:35,923 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:59:35" (1/1) ... [2022-07-11 23:59:35,928 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 23:59:35,949 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:59:36,187 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label39.c[18036,18049] [2022-07-11 23:59:36,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:59:36,229 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 23:59:36,276 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label39.c[18036,18049] [2022-07-11 23:59:36,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:59:36,291 INFO L208 MainTranslator]: Completed translation [2022-07-11 23:59:36,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:59:36 WrapperNode [2022-07-11 23:59:36,292 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 23:59:36,293 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 23:59:36,293 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 23:59:36,293 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 23:59:36,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:59:36" (1/1) ... [2022-07-11 23:59:36,314 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:59:36" (1/1) ... [2022-07-11 23:59:36,353 INFO L137 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2022-07-11 23:59:36,354 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 23:59:36,354 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 23:59:36,354 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 23:59:36,354 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 23:59:36,360 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:59:36" (1/1) ... [2022-07-11 23:59:36,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:59:36" (1/1) ... [2022-07-11 23:59:36,378 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:59:36" (1/1) ... [2022-07-11 23:59:36,391 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:59:36" (1/1) ... [2022-07-11 23:59:36,428 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:59:36" (1/1) ... [2022-07-11 23:59:36,440 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:59:36" (1/1) ... [2022-07-11 23:59:36,443 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:59:36" (1/1) ... [2022-07-11 23:59:36,459 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 23:59:36,460 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 23:59:36,460 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 23:59:36,460 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 23:59:36,461 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:59:36" (1/1) ... [2022-07-11 23:59:36,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:59:36,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:59:36,502 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-11 23:59:36,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-11 23:59:36,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 23:59:36,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-11 23:59:36,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 23:59:36,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 23:59:36,642 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 23:59:36,656 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 23:59:37,259 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 23:59:37,268 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 23:59:37,269 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-11 23:59:37,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:59:37 BoogieIcfgContainer [2022-07-11 23:59:37,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 23:59:37,273 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 23:59:37,274 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 23:59:37,276 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 23:59:37,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 11:59:35" (1/3) ... [2022-07-11 23:59:37,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a5191bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:59:37, skipping insertion in model container [2022-07-11 23:59:37,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:59:36" (2/3) ... [2022-07-11 23:59:37,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a5191bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:59:37, skipping insertion in model container [2022-07-11 23:59:37,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:59:37" (3/3) ... [2022-07-11 23:59:37,278 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem02_label39.c [2022-07-11 23:59:37,287 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 23:59:37,287 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 23:59:37,333 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 23:59:37,337 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4fdfe3bd, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@101cc65e [2022-07-11 23:59:37,337 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 23:59:37,340 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 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-07-11 23:59:37,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-11 23:59:37,348 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:59:37,348 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-11 23:59:37,349 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:59:37,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:59:37,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1738135197, now seen corresponding path program 1 times [2022-07-11 23:59:37,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:59:37,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078882579] [2022-07-11 23:59:37,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:59:37,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:59:37,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:59:37,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:59:37,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:59:37,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078882579] [2022-07-11 23:59:37,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078882579] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:59:37,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:59:37,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-11 23:59:37,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690777098] [2022-07-11 23:59:37,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:59:37,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:59:37,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:59:37,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:59:37,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:59:37,810 INFO L87 Difference]: Start difference. First operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 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 37.0) internal successors, (111), 2 states have internal predecessors, (111), 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-07-11 23:59:38,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:59:38,523 INFO L93 Difference]: Finished difference Result 630 states and 1070 transitions. [2022-07-11 23:59:38,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:59:38,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 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 111 [2022-07-11 23:59:38,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:59:38,539 INFO L225 Difference]: With dead ends: 630 [2022-07-11 23:59:38,539 INFO L226 Difference]: Without dead ends: 318 [2022-07-11 23:59:38,560 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-07-11 23:59:38,562 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 119 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-11 23:59:38,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 119 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-11 23:59:38,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2022-07-11 23:59:38,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2022-07-11 23:59:38,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 317 states have (on average 1.473186119873817) internal successors, (467), 317 states have internal predecessors, (467), 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-07-11 23:59:38,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 467 transitions. [2022-07-11 23:59:38,642 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 467 transitions. Word has length 111 [2022-07-11 23:59:38,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:59:38,643 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 467 transitions. [2022-07-11 23:59:38,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 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-07-11 23:59:38,643 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 467 transitions. [2022-07-11 23:59:38,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-11 23:59:38,645 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:59:38,645 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:59:38,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-11 23:59:38,645 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:59:38,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:59:38,646 INFO L85 PathProgramCache]: Analyzing trace with hash -215551336, now seen corresponding path program 1 times [2022-07-11 23:59:38,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:59:38,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71091217] [2022-07-11 23:59:38,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:59:38,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:59:38,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:59:38,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:59:38,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:59:38,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71091217] [2022-07-11 23:59:38,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71091217] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:59:38,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:59:38,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-11 23:59:38,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032553735] [2022-07-11 23:59:38,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:59:38,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:59:38,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:59:38,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:59:38,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:59:38,781 INFO L87 Difference]: Start difference. First operand 318 states and 467 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 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-07-11 23:59:39,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:59:39,265 INFO L93 Difference]: Finished difference Result 919 states and 1357 transitions. [2022-07-11 23:59:39,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:59:39,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 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 115 [2022-07-11 23:59:39,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:59:39,268 INFO L225 Difference]: With dead ends: 919 [2022-07-11 23:59:39,268 INFO L226 Difference]: Without dead ends: 603 [2022-07-11 23:59:39,269 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-07-11 23:59:39,269 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 144 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:59:39,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 121 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-11 23:59:39,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2022-07-11 23:59:39,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 601. [2022-07-11 23:59:39,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 600 states have (on average 1.2933333333333332) internal successors, (776), 600 states have internal predecessors, (776), 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-07-11 23:59:39,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 776 transitions. [2022-07-11 23:59:39,285 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 776 transitions. Word has length 115 [2022-07-11 23:59:39,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:59:39,288 INFO L495 AbstractCegarLoop]: Abstraction has 601 states and 776 transitions. [2022-07-11 23:59:39,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 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-07-11 23:59:39,288 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 776 transitions. [2022-07-11 23:59:39,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-11 23:59:39,291 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:59:39,291 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:59:39,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-11 23:59:39,291 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:59:39,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:59:39,292 INFO L85 PathProgramCache]: Analyzing trace with hash -485950035, now seen corresponding path program 1 times [2022-07-11 23:59:39,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:59:39,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085838154] [2022-07-11 23:59:39,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:59:39,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:59:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:59:39,327 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:59:39,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:59:39,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085838154] [2022-07-11 23:59:39,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085838154] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:59:39,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:59:39,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:59:39,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593342130] [2022-07-11 23:59:39,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:59:39,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:59:39,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:59:39,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:59:39,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:59:39,330 INFO L87 Difference]: Start difference. First operand 601 states and 776 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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-07-11 23:59:39,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:59:39,764 INFO L93 Difference]: Finished difference Result 1486 states and 1976 transitions. [2022-07-11 23:59:39,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:59:39,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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 120 [2022-07-11 23:59:39,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:59:39,767 INFO L225 Difference]: With dead ends: 1486 [2022-07-11 23:59:39,767 INFO L226 Difference]: Without dead ends: 887 [2022-07-11 23:59:39,767 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-07-11 23:59:39,768 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 144 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:59:39,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 255 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-11 23:59:39,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2022-07-11 23:59:39,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 885. [2022-07-11 23:59:39,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 884 states have (on average 1.2330316742081449) internal successors, (1090), 884 states have internal predecessors, (1090), 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-07-11 23:59:39,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1090 transitions. [2022-07-11 23:59:39,794 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1090 transitions. Word has length 120 [2022-07-11 23:59:39,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:59:39,795 INFO L495 AbstractCegarLoop]: Abstraction has 885 states and 1090 transitions. [2022-07-11 23:59:39,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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-07-11 23:59:39,795 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1090 transitions. [2022-07-11 23:59:39,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-11 23:59:39,797 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:59:39,798 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-11 23:59:39,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-11 23:59:39,798 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:59:39,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:59:39,799 INFO L85 PathProgramCache]: Analyzing trace with hash 63576167, now seen corresponding path program 1 times [2022-07-11 23:59:39,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:59:39,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942055076] [2022-07-11 23:59:39,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:59:39,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:59:39,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:59:39,864 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:59:39,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:59:39,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942055076] [2022-07-11 23:59:39,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942055076] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:59:39,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:59:39,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-11 23:59:39,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816364522] [2022-07-11 23:59:39,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:59:39,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:59:39,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:59:39,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:59:39,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:59:39,870 INFO L87 Difference]: Start difference. First operand 885 states and 1090 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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-07-11 23:59:40,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:59:40,228 INFO L93 Difference]: Finished difference Result 2469 states and 3055 transitions. [2022-07-11 23:59:40,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:59:40,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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 121 [2022-07-11 23:59:40,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:59:40,232 INFO L225 Difference]: With dead ends: 2469 [2022-07-11 23:59:40,232 INFO L226 Difference]: Without dead ends: 1586 [2022-07-11 23:59:40,234 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-07-11 23:59:40,234 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 190 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:59:40,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 79 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 23:59:40,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2022-07-11 23:59:40,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1586. [2022-07-11 23:59:40,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1586 states, 1585 states have (on average 1.1962145110410094) internal successors, (1896), 1585 states have internal predecessors, (1896), 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-07-11 23:59:40,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 1896 transitions. [2022-07-11 23:59:40,255 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 1896 transitions. Word has length 121 [2022-07-11 23:59:40,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:59:40,255 INFO L495 AbstractCegarLoop]: Abstraction has 1586 states and 1896 transitions. [2022-07-11 23:59:40,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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-07-11 23:59:40,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 1896 transitions. [2022-07-11 23:59:40,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-11 23:59:40,258 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:59:40,258 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:59:40,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-11 23:59:40,258 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:59:40,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:59:40,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1699634295, now seen corresponding path program 1 times [2022-07-11 23:59:40,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:59:40,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007868674] [2022-07-11 23:59:40,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:59:40,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:59:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:59:40,284 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:59:40,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:59:40,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007868674] [2022-07-11 23:59:40,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007868674] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:59:40,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:59:40,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:59:40,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113409240] [2022-07-11 23:59:40,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:59:40,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:59:40,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:59:40,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:59:40,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:59:40,287 INFO L87 Difference]: Start difference. First operand 1586 states and 1896 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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-07-11 23:59:40,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:59:40,604 INFO L93 Difference]: Finished difference Result 3731 states and 4458 transitions. [2022-07-11 23:59:40,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:59:40,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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 124 [2022-07-11 23:59:40,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:59:40,609 INFO L225 Difference]: With dead ends: 3731 [2022-07-11 23:59:40,609 INFO L226 Difference]: Without dead ends: 2147 [2022-07-11 23:59:40,611 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-07-11 23:59:40,612 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 143 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:59:40,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 270 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 23:59:40,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2147 states. [2022-07-11 23:59:40,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2147 to 2146. [2022-07-11 23:59:40,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2146 states, 2145 states have (on average 1.1566433566433567) internal successors, (2481), 2145 states have internal predecessors, (2481), 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-07-11 23:59:40,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2146 states to 2146 states and 2481 transitions. [2022-07-11 23:59:40,636 INFO L78 Accepts]: Start accepts. Automaton has 2146 states and 2481 transitions. Word has length 124 [2022-07-11 23:59:40,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:59:40,637 INFO L495 AbstractCegarLoop]: Abstraction has 2146 states and 2481 transitions. [2022-07-11 23:59:40,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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-07-11 23:59:40,637 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 2481 transitions. [2022-07-11 23:59:40,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-11 23:59:40,640 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:59:40,640 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-11 23:59:40,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-11 23:59:40,641 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:59:40,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:59:40,641 INFO L85 PathProgramCache]: Analyzing trace with hash -297769562, now seen corresponding path program 1 times [2022-07-11 23:59:40,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:59:40,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277575643] [2022-07-11 23:59:40,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:59:40,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:59:40,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:59:40,670 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:59:40,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:59:40,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277575643] [2022-07-11 23:59:40,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277575643] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:59:40,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:59:40,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:59:40,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176740771] [2022-07-11 23:59:40,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:59:40,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:59:40,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:59:40,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:59:40,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:59:40,672 INFO L87 Difference]: Start difference. First operand 2146 states and 2481 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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-07-11 23:59:40,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:59:40,968 INFO L93 Difference]: Finished difference Result 4291 states and 4962 transitions. [2022-07-11 23:59:40,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:59:40,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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 140 [2022-07-11 23:59:40,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:59:40,974 INFO L225 Difference]: With dead ends: 4291 [2022-07-11 23:59:40,974 INFO L226 Difference]: Without dead ends: 2147 [2022-07-11 23:59:40,976 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-07-11 23:59:40,977 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 162 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:59:40,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 52 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 23:59:40,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2147 states. [2022-07-11 23:59:40,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2147 to 2146. [2022-07-11 23:59:40,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2146 states, 2145 states have (on average 1.131002331002331) internal successors, (2426), 2145 states have internal predecessors, (2426), 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-07-11 23:59:41,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2146 states to 2146 states and 2426 transitions. [2022-07-11 23:59:41,002 INFO L78 Accepts]: Start accepts. Automaton has 2146 states and 2426 transitions. Word has length 140 [2022-07-11 23:59:41,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:59:41,002 INFO L495 AbstractCegarLoop]: Abstraction has 2146 states and 2426 transitions. [2022-07-11 23:59:41,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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-07-11 23:59:41,003 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 2426 transitions. [2022-07-11 23:59:41,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-11 23:59:41,005 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:59:41,005 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2022-07-11 23:59:41,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-11 23:59:41,006 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:59:41,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:59:41,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1227064464, now seen corresponding path program 1 times [2022-07-11 23:59:41,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:59:41,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048459455] [2022-07-11 23:59:41,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:59:41,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:59:41,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:59:41,056 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:59:41,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:59:41,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048459455] [2022-07-11 23:59:41,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048459455] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:59:41,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:59:41,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:59:41,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617332608] [2022-07-11 23:59:41,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:59:41,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:59:41,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:59:41,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:59:41,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:59:41,058 INFO L87 Difference]: Start difference. First operand 2146 states and 2426 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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-07-11 23:59:41,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:59:41,353 INFO L93 Difference]: Finished difference Result 4863 states and 5614 transitions. [2022-07-11 23:59:41,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:59:41,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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 144 [2022-07-11 23:59:41,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:59:41,360 INFO L225 Difference]: With dead ends: 4863 [2022-07-11 23:59:41,360 INFO L226 Difference]: Without dead ends: 2719 [2022-07-11 23:59:41,362 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-07-11 23:59:41,363 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 145 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:59:41,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 256 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 23:59:41,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2719 states. [2022-07-11 23:59:41,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2719 to 2710. [2022-07-11 23:59:41,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2710 states, 2709 states have (on average 1.1432262827611666) internal successors, (3097), 2709 states have internal predecessors, (3097), 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-07-11 23:59:41,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3097 transitions. [2022-07-11 23:59:41,394 INFO L78 Accepts]: Start accepts. Automaton has 2710 states and 3097 transitions. Word has length 144 [2022-07-11 23:59:41,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:59:41,394 INFO L495 AbstractCegarLoop]: Abstraction has 2710 states and 3097 transitions. [2022-07-11 23:59:41,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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-07-11 23:59:41,395 INFO L276 IsEmpty]: Start isEmpty. Operand 2710 states and 3097 transitions. [2022-07-11 23:59:41,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-11 23:59:41,397 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:59:41,398 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-11 23:59:41,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-11 23:59:41,398 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:59:41,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:59:41,398 INFO L85 PathProgramCache]: Analyzing trace with hash -627553387, now seen corresponding path program 1 times [2022-07-11 23:59:41,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:59:41,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327263228] [2022-07-11 23:59:41,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:59:41,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:59:41,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:59:41,474 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-11 23:59:41,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:59:41,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327263228] [2022-07-11 23:59:41,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327263228] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:59:41,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:59:41,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:59:41,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643582801] [2022-07-11 23:59:41,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:59:41,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:59:41,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:59:41,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:59:41,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:59:41,476 INFO L87 Difference]: Start difference. First operand 2710 states and 3097 transitions. Second operand has 4 states, 4 states have (on average 35.75) 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-07-11 23:59:41,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:59:41,932 INFO L93 Difference]: Finished difference Result 6481 states and 7402 transitions. [2022-07-11 23:59:41,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:59:41,933 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) 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 145 [2022-07-11 23:59:41,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:59:41,941 INFO L225 Difference]: With dead ends: 6481 [2022-07-11 23:59:41,941 INFO L226 Difference]: Without dead ends: 3690 [2022-07-11 23:59:41,943 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-07-11 23:59:41,943 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 142 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:59:41,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 117 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-11 23:59:41,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3690 states. [2022-07-11 23:59:41,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3690 to 2990. [2022-07-11 23:59:41,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2990 states, 2989 states have (on average 1.1398461023753763) internal successors, (3407), 2989 states have internal predecessors, (3407), 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-07-11 23:59:41,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2990 states to 2990 states and 3407 transitions. [2022-07-11 23:59:41,976 INFO L78 Accepts]: Start accepts. Automaton has 2990 states and 3407 transitions. Word has length 145 [2022-07-11 23:59:41,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:59:41,976 INFO L495 AbstractCegarLoop]: Abstraction has 2990 states and 3407 transitions. [2022-07-11 23:59:41,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) 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-07-11 23:59:41,977 INFO L276 IsEmpty]: Start isEmpty. Operand 2990 states and 3407 transitions. [2022-07-11 23:59:41,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-07-11 23:59:41,980 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:59:41,980 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-11 23:59:41,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-11 23:59:41,980 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:59:41,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:59:41,981 INFO L85 PathProgramCache]: Analyzing trace with hash 212323633, now seen corresponding path program 1 times [2022-07-11 23:59:41,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:59:41,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684050396] [2022-07-11 23:59:41,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:59:41,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:59:42,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:59:42,017 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-11 23:59:42,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:59:42,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684050396] [2022-07-11 23:59:42,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684050396] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:59:42,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:59:42,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:59:42,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012850494] [2022-07-11 23:59:42,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:59:42,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:59:42,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:59:42,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:59:42,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:59:42,019 INFO L87 Difference]: Start difference. First operand 2990 states and 3407 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 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-07-11 23:59:42,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:59:42,297 INFO L93 Difference]: Finished difference Result 5540 states and 6328 transitions. [2022-07-11 23:59:42,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:59:42,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 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 175 [2022-07-11 23:59:42,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:59:42,303 INFO L225 Difference]: With dead ends: 5540 [2022-07-11 23:59:42,303 INFO L226 Difference]: Without dead ends: 2130 [2022-07-11 23:59:42,306 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-07-11 23:59:42,306 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 121 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:59:42,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 252 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 23:59:42,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2130 states. [2022-07-11 23:59:42,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2130 to 1850. [2022-07-11 23:59:42,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1850 states, 1849 states have (on average 1.1011357490535425) internal successors, (2036), 1849 states have internal predecessors, (2036), 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-07-11 23:59:42,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1850 states and 2036 transitions. [2022-07-11 23:59:42,327 INFO L78 Accepts]: Start accepts. Automaton has 1850 states and 2036 transitions. Word has length 175 [2022-07-11 23:59:42,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:59:42,327 INFO L495 AbstractCegarLoop]: Abstraction has 1850 states and 2036 transitions. [2022-07-11 23:59:42,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 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-07-11 23:59:42,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 2036 transitions. [2022-07-11 23:59:42,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-07-11 23:59:42,330 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:59:42,330 INFO L195 NwaCegarLoop]: trace histogram [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, 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] [2022-07-11 23:59:42,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-11 23:59:42,330 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:59:42,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:59:42,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1817254938, now seen corresponding path program 1 times [2022-07-11 23:59:42,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:59:42,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127710811] [2022-07-11 23:59:42,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:59:42,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:59:42,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:59:42,401 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-11 23:59:42,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:59:42,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127710811] [2022-07-11 23:59:42,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127710811] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:59:42,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:59:42,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:59:42,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854345214] [2022-07-11 23:59:42,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:59:42,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:59:42,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:59:42,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:59:42,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:59:42,405 INFO L87 Difference]: Start difference. First operand 1850 states and 2036 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 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-07-11 23:59:42,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:59:42,771 INFO L93 Difference]: Finished difference Result 4540 states and 5049 transitions. [2022-07-11 23:59:42,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:59:42,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 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 183 [2022-07-11 23:59:42,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:59:42,779 INFO L225 Difference]: With dead ends: 4540 [2022-07-11 23:59:42,779 INFO L226 Difference]: Without dead ends: 2552 [2022-07-11 23:59:42,781 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-07-11 23:59:42,782 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 139 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:59:42,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 212 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 23:59:42,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2022-07-11 23:59:42,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 2411. [2022-07-11 23:59:42,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2411 states, 2410 states have (on average 1.103734439834025) internal successors, (2660), 2410 states have internal predecessors, (2660), 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-07-11 23:59:42,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 2660 transitions. [2022-07-11 23:59:42,815 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 2660 transitions. Word has length 183 [2022-07-11 23:59:42,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:59:42,815 INFO L495 AbstractCegarLoop]: Abstraction has 2411 states and 2660 transitions. [2022-07-11 23:59:42,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 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-07-11 23:59:42,815 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 2660 transitions. [2022-07-11 23:59:42,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-07-11 23:59:42,818 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:59:42,818 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:59:42,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-11 23:59:42,819 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:59:42,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:59:42,820 INFO L85 PathProgramCache]: Analyzing trace with hash 2070776374, now seen corresponding path program 1 times [2022-07-11 23:59:42,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:59:42,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005496969] [2022-07-11 23:59:42,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:59:42,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:59:42,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:59:42,872 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:59:42,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:59:42,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005496969] [2022-07-11 23:59:42,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005496969] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:59:42,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:59:42,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:59:42,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560863556] [2022-07-11 23:59:42,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:59:42,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:59:42,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:59:42,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:59:42,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:59:42,874 INFO L87 Difference]: Start difference. First operand 2411 states and 2660 transitions. Second operand has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 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-07-11 23:59:43,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:59:43,426 INFO L93 Difference]: Finished difference Result 5105 states and 5617 transitions. [2022-07-11 23:59:43,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:59:43,427 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 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 209 [2022-07-11 23:59:43,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:59:43,432 INFO L225 Difference]: With dead ends: 5105 [2022-07-11 23:59:43,432 INFO L226 Difference]: Without dead ends: 2275 [2022-07-11 23:59:43,448 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-07-11 23:59:43,449 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 263 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:59:43,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 259 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-11 23:59:43,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2275 states. [2022-07-11 23:59:43,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2275 to 2130. [2022-07-11 23:59:43,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2130 states, 2129 states have (on average 1.0685767966181305) internal successors, (2275), 2129 states have internal predecessors, (2275), 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-07-11 23:59:43,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 2130 states and 2275 transitions. [2022-07-11 23:59:43,473 INFO L78 Accepts]: Start accepts. Automaton has 2130 states and 2275 transitions. Word has length 209 [2022-07-11 23:59:43,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:59:43,473 INFO L495 AbstractCegarLoop]: Abstraction has 2130 states and 2275 transitions. [2022-07-11 23:59:43,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.25) internal successors, (209), 4 states have internal predecessors, (209), 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-07-11 23:59:43,474 INFO L276 IsEmpty]: Start isEmpty. Operand 2130 states and 2275 transitions. [2022-07-11 23:59:43,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-07-11 23:59:43,476 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:59:43,476 INFO L195 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 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-07-11 23:59:43,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-11 23:59:43,477 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:59:43,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:59:43,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1582426258, now seen corresponding path program 1 times [2022-07-11 23:59:43,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:59:43,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880678733] [2022-07-11 23:59:43,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:59:43,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:59:43,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:59:43,531 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 109 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:59:43,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:59:43,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880678733] [2022-07-11 23:59:43,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880678733] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:59:43,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672975824] [2022-07-11 23:59:43,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:59:43,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:59:43,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:59:43,533 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:59:43,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-11 23:59:43,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:59:43,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-11 23:59:43,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:59:43,800 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-11 23:59:43,800 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:59:43,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672975824] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:59:43,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-11 23:59:43,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-07-11 23:59:43,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931966741] [2022-07-11 23:59:43,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:59:43,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:59:43,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:59:43,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:59:43,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:59:43,803 INFO L87 Difference]: Start difference. First operand 2130 states and 2275 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 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-07-11 23:59:44,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:59:44,051 INFO L93 Difference]: Finished difference Result 4818 states and 5151 transitions. [2022-07-11 23:59:44,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:59:44,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 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 215 [2022-07-11 23:59:44,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:59:44,056 INFO L225 Difference]: With dead ends: 4818 [2022-07-11 23:59:44,056 INFO L226 Difference]: Without dead ends: 1844 [2022-07-11 23:59:44,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:59:44,058 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 34 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:59:44,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 239 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:59:44,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2022-07-11 23:59:44,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1844. [2022-07-11 23:59:44,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1844 states, 1843 states have (on average 1.0520889853499729) internal successors, (1939), 1843 states have internal predecessors, (1939), 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-07-11 23:59:44,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 1844 states and 1939 transitions. [2022-07-11 23:59:44,077 INFO L78 Accepts]: Start accepts. Automaton has 1844 states and 1939 transitions. Word has length 215 [2022-07-11 23:59:44,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:59:44,077 INFO L495 AbstractCegarLoop]: Abstraction has 1844 states and 1939 transitions. [2022-07-11 23:59:44,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 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-07-11 23:59:44,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 1939 transitions. [2022-07-11 23:59:44,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-07-11 23:59:44,080 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:59:44,080 INFO L195 NwaCegarLoop]: trace histogram [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, 2, 2, 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] [2022-07-11 23:59:44,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-11 23:59:44,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-11 23:59:44,292 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:59:44,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:59:44,292 INFO L85 PathProgramCache]: Analyzing trace with hash -2146398300, now seen corresponding path program 1 times [2022-07-11 23:59:44,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:59:44,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482957617] [2022-07-11 23:59:44,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:59:44,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:59:44,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:59:44,470 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 93 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:59:44,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:59:44,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482957617] [2022-07-11 23:59:44,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482957617] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:59:44,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306377025] [2022-07-11 23:59:44,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:59:44,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:59:44,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:59:44,472 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:59:44,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-11 23:59:44,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:59:44,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-11 23:59:44,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:59:44,681 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-07-11 23:59:44,681 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:59:44,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306377025] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:59:44,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-11 23:59:44,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2022-07-11 23:59:44,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614612491] [2022-07-11 23:59:44,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:59:44,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:59:44,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:59:44,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:59:44,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:59:44,683 INFO L87 Difference]: Start difference. First operand 1844 states and 1939 transitions. Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 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-07-11 23:59:44,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:59:44,972 INFO L93 Difference]: Finished difference Result 3258 states and 3439 transitions. [2022-07-11 23:59:44,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:59:44,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 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 241 [2022-07-11 23:59:44,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:59:44,975 INFO L225 Difference]: With dead ends: 3258 [2022-07-11 23:59:44,975 INFO L226 Difference]: Without dead ends: 1276 [2022-07-11 23:59:44,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:59:44,978 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 46 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:59:44,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 179 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 23:59:44,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2022-07-11 23:59:44,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1276. [2022-07-11 23:59:44,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1276 states, 1275 states have (on average 1.0392156862745099) internal successors, (1325), 1275 states have internal predecessors, (1325), 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-07-11 23:59:44,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 1325 transitions. [2022-07-11 23:59:44,991 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 1325 transitions. Word has length 241 [2022-07-11 23:59:44,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:59:44,992 INFO L495 AbstractCegarLoop]: Abstraction has 1276 states and 1325 transitions. [2022-07-11 23:59:44,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 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-07-11 23:59:44,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1325 transitions. [2022-07-11 23:59:44,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2022-07-11 23:59:44,994 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:59:44,994 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, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-11 23:59:45,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-11 23:59:45,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-11 23:59:45,208 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:59:45,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:59:45,208 INFO L85 PathProgramCache]: Analyzing trace with hash 995979598, now seen corresponding path program 1 times [2022-07-11 23:59:45,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:59:45,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031342486] [2022-07-11 23:59:45,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:59:45,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:59:45,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:59:45,267 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:59:45,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:59:45,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031342486] [2022-07-11 23:59:45,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031342486] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:59:45,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:59:45,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:59:45,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256685575] [2022-07-11 23:59:45,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:59:45,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:59:45,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:59:45,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:59:45,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:59:45,269 INFO L87 Difference]: Start difference. First operand 1276 states and 1325 transitions. Second operand has 4 states, 4 states have (on average 61.5) internal successors, (246), 4 states have internal predecessors, (246), 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-07-11 23:59:45,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:59:45,595 INFO L93 Difference]: Finished difference Result 2410 states and 2507 transitions. [2022-07-11 23:59:45,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:59:45,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 61.5) internal successors, (246), 4 states have internal predecessors, (246), 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 246 [2022-07-11 23:59:45,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:59:45,598 INFO L225 Difference]: With dead ends: 2410 [2022-07-11 23:59:45,598 INFO L226 Difference]: Without dead ends: 992 [2022-07-11 23:59:45,598 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-07-11 23:59:45,599 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 229 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:59:45,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 186 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 23:59:45,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2022-07-11 23:59:45,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 991. [2022-07-11 23:59:45,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 990 states have (on average 1.0232323232323233) internal successors, (1013), 990 states have internal predecessors, (1013), 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-07-11 23:59:45,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1013 transitions. [2022-07-11 23:59:45,608 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1013 transitions. Word has length 246 [2022-07-11 23:59:45,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:59:45,608 INFO L495 AbstractCegarLoop]: Abstraction has 991 states and 1013 transitions. [2022-07-11 23:59:45,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.5) internal successors, (246), 4 states have internal predecessors, (246), 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-07-11 23:59:45,608 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1013 transitions. [2022-07-11 23:59:45,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2022-07-11 23:59:45,610 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:59:45,611 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-11 23:59:45,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-11 23:59:45,611 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:59:45,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:59:45,611 INFO L85 PathProgramCache]: Analyzing trace with hash -2093190923, now seen corresponding path program 1 times [2022-07-11 23:59:45,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:59:45,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79680925] [2022-07-11 23:59:45,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:59:45,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:59:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:59:45,827 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 167 proven. 94 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-07-11 23:59:45,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:59:45,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79680925] [2022-07-11 23:59:45,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79680925] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:59:45,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063538276] [2022-07-11 23:59:45,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:59:45,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:59:45,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:59:45,828 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:59:45,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-11 23:59:45,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:59:45,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-11 23:59:45,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:59:46,047 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2022-07-11 23:59:46,047 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:59:46,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063538276] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:59:46,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-11 23:59:46,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-07-11 23:59:46,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262360647] [2022-07-11 23:59:46,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:59:46,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:59:46,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:59:46,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:59:46,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:59:46,049 INFO L87 Difference]: Start difference. First operand 991 states and 1013 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 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-07-11 23:59:46,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:59:46,227 INFO L93 Difference]: Finished difference Result 1557 states and 1598 transitions. [2022-07-11 23:59:46,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:59:46,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 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 281 [2022-07-11 23:59:46,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:59:46,228 INFO L225 Difference]: With dead ends: 1557 [2022-07-11 23:59:46,228 INFO L226 Difference]: Without dead ends: 0 [2022-07-11 23:59:46,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 280 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:59:46,232 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 75 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:59:46,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 37 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:59:46,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-11 23:59:46,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-11 23:59:46,232 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-07-11 23:59:46,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-11 23:59:46,233 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 281 [2022-07-11 23:59:46,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:59:46,233 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-11 23:59:46,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 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-07-11 23:59:46,233 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-11 23:59:46,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-11 23:59:46,235 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-11 23:59:46,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-11 23:59:46,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:59:46,454 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-11 23:59:47,015 INFO L899 garLoopResultBuilder]: For program point L565-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,015 INFO L899 garLoopResultBuilder]: For program point L499-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,015 INFO L899 garLoopResultBuilder]: For program point L433-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,015 INFO L899 garLoopResultBuilder]: For program point L301(lines 301 423) no Hoare annotation was computed. [2022-07-11 23:59:47,015 INFO L899 garLoopResultBuilder]: For program point L235(lines 235 423) no Hoare annotation was computed. [2022-07-11 23:59:47,015 INFO L899 garLoopResultBuilder]: For program point L169(lines 169 423) no Hoare annotation was computed. [2022-07-11 23:59:47,015 INFO L899 garLoopResultBuilder]: For program point L566(line 566) no Hoare annotation was computed. [2022-07-11 23:59:47,015 INFO L899 garLoopResultBuilder]: For program point L500(line 500) no Hoare annotation was computed. [2022-07-11 23:59:47,015 INFO L899 garLoopResultBuilder]: For program point L434(line 434) no Hoare annotation was computed. [2022-07-11 23:59:47,015 INFO L899 garLoopResultBuilder]: For program point L303(lines 303 423) no Hoare annotation was computed. [2022-07-11 23:59:47,015 INFO L899 garLoopResultBuilder]: For program point L105(lines 105 423) no Hoare annotation was computed. [2022-07-11 23:59:47,015 INFO L899 garLoopResultBuilder]: For program point L568-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,016 INFO L899 garLoopResultBuilder]: For program point L502-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,016 INFO L899 garLoopResultBuilder]: For program point L436-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,016 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 423) no Hoare annotation was computed. [2022-07-11 23:59:47,016 INFO L899 garLoopResultBuilder]: For program point L569(line 569) no Hoare annotation was computed. [2022-07-11 23:59:47,016 INFO L899 garLoopResultBuilder]: For program point L503(line 503) no Hoare annotation was computed. [2022-07-11 23:59:47,016 INFO L899 garLoopResultBuilder]: For program point L437(line 437) no Hoare annotation was computed. [2022-07-11 23:59:47,016 INFO L899 garLoopResultBuilder]: For program point L371(lines 371 423) no Hoare annotation was computed. [2022-07-11 23:59:47,016 INFO L899 garLoopResultBuilder]: For program point L571-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,016 INFO L899 garLoopResultBuilder]: For program point L505-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,016 INFO L899 garLoopResultBuilder]: For program point L439-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,016 INFO L899 garLoopResultBuilder]: For program point L307(lines 307 423) no Hoare annotation was computed. [2022-07-11 23:59:47,016 INFO L899 garLoopResultBuilder]: For program point L175(lines 175 423) no Hoare annotation was computed. [2022-07-11 23:59:47,016 INFO L899 garLoopResultBuilder]: For program point L109(lines 109 423) no Hoare annotation was computed. [2022-07-11 23:59:47,016 INFO L899 garLoopResultBuilder]: For program point L572(line 572) no Hoare annotation was computed. [2022-07-11 23:59:47,016 INFO L899 garLoopResultBuilder]: For program point L506(line 506) no Hoare annotation was computed. [2022-07-11 23:59:47,016 INFO L899 garLoopResultBuilder]: For program point L440(line 440) no Hoare annotation was computed. [2022-07-11 23:59:47,016 INFO L899 garLoopResultBuilder]: For program point L308(lines 308 317) no Hoare annotation was computed. [2022-07-11 23:59:47,016 INFO L899 garLoopResultBuilder]: For program point L242(lines 242 423) no Hoare annotation was computed. [2022-07-11 23:59:47,016 INFO L899 garLoopResultBuilder]: For program point L308-2(lines 308 317) no Hoare annotation was computed. [2022-07-11 23:59:47,016 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 423) no Hoare annotation was computed. [2022-07-11 23:59:47,017 INFO L899 garLoopResultBuilder]: For program point L574-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,017 INFO L899 garLoopResultBuilder]: For program point L508-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,017 INFO L899 garLoopResultBuilder]: For program point L442-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,017 INFO L899 garLoopResultBuilder]: For program point L244(lines 244 423) no Hoare annotation was computed. [2022-07-11 23:59:47,017 INFO L899 garLoopResultBuilder]: For program point L575(line 575) no Hoare annotation was computed. [2022-07-11 23:59:47,017 INFO L899 garLoopResultBuilder]: For program point L509(line 509) no Hoare annotation was computed. [2022-07-11 23:59:47,017 INFO L899 garLoopResultBuilder]: For program point L443(line 443) no Hoare annotation was computed. [2022-07-11 23:59:47,017 INFO L899 garLoopResultBuilder]: For program point L179(lines 179 423) no Hoare annotation was computed. [2022-07-11 23:59:47,017 INFO L899 garLoopResultBuilder]: For program point L378(lines 378 423) no Hoare annotation was computed. [2022-07-11 23:59:47,017 INFO L899 garLoopResultBuilder]: For program point L48(lines 48 423) no Hoare annotation was computed. [2022-07-11 23:59:47,017 INFO L899 garLoopResultBuilder]: For program point L577-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,017 INFO L899 garLoopResultBuilder]: For program point L511-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,017 INFO L899 garLoopResultBuilder]: For program point L445-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,017 INFO L899 garLoopResultBuilder]: For program point L247(lines 247 423) no Hoare annotation was computed. [2022-07-11 23:59:47,017 INFO L899 garLoopResultBuilder]: For program point L578(line 578) no Hoare annotation was computed. [2022-07-11 23:59:47,017 INFO L899 garLoopResultBuilder]: For program point L512(line 512) no Hoare annotation was computed. [2022-07-11 23:59:47,017 INFO L899 garLoopResultBuilder]: For program point L446(line 446) no Hoare annotation was computed. [2022-07-11 23:59:47,017 INFO L899 garLoopResultBuilder]: For program point L248(lines 248 256) no Hoare annotation was computed. [2022-07-11 23:59:47,017 INFO L899 garLoopResultBuilder]: For program point L248-2(lines 248 256) no Hoare annotation was computed. [2022-07-11 23:59:47,018 INFO L899 garLoopResultBuilder]: For program point L116(lines 116 423) no Hoare annotation was computed. [2022-07-11 23:59:47,018 INFO L899 garLoopResultBuilder]: For program point L580-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,018 INFO L899 garLoopResultBuilder]: For program point L514-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,018 INFO L899 garLoopResultBuilder]: For program point L448-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,018 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 423) no Hoare annotation was computed. [2022-07-11 23:59:47,018 INFO L899 garLoopResultBuilder]: For program point L581(line 581) no Hoare annotation was computed. [2022-07-11 23:59:47,018 INFO L899 garLoopResultBuilder]: For program point L515(line 515) no Hoare annotation was computed. [2022-07-11 23:59:47,018 INFO L899 garLoopResultBuilder]: For program point L449(line 449) no Hoare annotation was computed. [2022-07-11 23:59:47,018 INFO L899 garLoopResultBuilder]: For program point L185(lines 185 423) no Hoare annotation was computed. [2022-07-11 23:59:47,018 INFO L899 garLoopResultBuilder]: For program point L583-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,018 INFO L899 garLoopResultBuilder]: For program point L517-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,018 INFO L899 garLoopResultBuilder]: For program point L451-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,018 INFO L899 garLoopResultBuilder]: For program point L385(lines 385 423) no Hoare annotation was computed. [2022-07-11 23:59:47,018 INFO L899 garLoopResultBuilder]: For program point L319(lines 319 423) no Hoare annotation was computed. [2022-07-11 23:59:47,018 INFO L899 garLoopResultBuilder]: For program point L584(line 584) no Hoare annotation was computed. [2022-07-11 23:59:47,018 INFO L899 garLoopResultBuilder]: For program point L518(line 518) no Hoare annotation was computed. [2022-07-11 23:59:47,018 INFO L899 garLoopResultBuilder]: For program point L452(line 452) no Hoare annotation was computed. [2022-07-11 23:59:47,018 INFO L899 garLoopResultBuilder]: For program point L189(lines 189 423) no Hoare annotation was computed. [2022-07-11 23:59:47,018 INFO L899 garLoopResultBuilder]: For program point L123(lines 123 423) no Hoare annotation was computed. [2022-07-11 23:59:47,018 INFO L899 garLoopResultBuilder]: For program point L57(lines 57 423) no Hoare annotation was computed. [2022-07-11 23:59:47,019 INFO L899 garLoopResultBuilder]: For program point L586-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,019 INFO L899 garLoopResultBuilder]: For program point L520-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,019 INFO L899 garLoopResultBuilder]: For program point L454-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,019 INFO L899 garLoopResultBuilder]: For program point L388(lines 388 423) no Hoare annotation was computed. [2022-07-11 23:59:47,019 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-11 23:59:47,019 INFO L899 garLoopResultBuilder]: For program point L587(line 587) no Hoare annotation was computed. [2022-07-11 23:59:47,019 INFO L899 garLoopResultBuilder]: For program point L521(line 521) no Hoare annotation was computed. [2022-07-11 23:59:47,019 INFO L899 garLoopResultBuilder]: For program point L455(line 455) no Hoare annotation was computed. [2022-07-11 23:59:47,019 INFO L899 garLoopResultBuilder]: For program point L390(lines 390 423) no Hoare annotation was computed. [2022-07-11 23:59:47,019 INFO L899 garLoopResultBuilder]: For program point L324(lines 324 423) no Hoare annotation was computed. [2022-07-11 23:59:47,019 INFO L899 garLoopResultBuilder]: For program point L258(lines 258 423) no Hoare annotation was computed. [2022-07-11 23:59:47,019 INFO L899 garLoopResultBuilder]: For program point L60(lines 60 423) no Hoare annotation was computed. [2022-07-11 23:59:47,019 INFO L899 garLoopResultBuilder]: For program point L589-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,019 INFO L899 garLoopResultBuilder]: For program point L523-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,019 INFO L899 garLoopResultBuilder]: For program point L457-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,019 INFO L899 garLoopResultBuilder]: For program point L391(lines 391 397) no Hoare annotation was computed. [2022-07-11 23:59:47,019 INFO L899 garLoopResultBuilder]: For program point L325(lines 325 336) no Hoare annotation was computed. [2022-07-11 23:59:47,019 INFO L899 garLoopResultBuilder]: For program point L391-2(lines 391 397) no Hoare annotation was computed. [2022-07-11 23:59:47,019 INFO L899 garLoopResultBuilder]: For program point L325-2(lines 325 336) no Hoare annotation was computed. [2022-07-11 23:59:47,019 INFO L899 garLoopResultBuilder]: For program point L590(line 590) no Hoare annotation was computed. [2022-07-11 23:59:47,019 INFO L899 garLoopResultBuilder]: For program point L524(line 524) no Hoare annotation was computed. [2022-07-11 23:59:47,020 INFO L899 garLoopResultBuilder]: For program point L458(line 458) no Hoare annotation was computed. [2022-07-11 23:59:47,020 INFO L899 garLoopResultBuilder]: For program point L195(lines 195 423) no Hoare annotation was computed. [2022-07-11 23:59:47,020 INFO L899 garLoopResultBuilder]: For program point L129(lines 129 423) no Hoare annotation was computed. [2022-07-11 23:59:47,020 INFO L899 garLoopResultBuilder]: For program point L592-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,020 INFO L899 garLoopResultBuilder]: For program point L526-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,020 INFO L899 garLoopResultBuilder]: For program point L460-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,020 INFO L899 garLoopResultBuilder]: For program point L64(lines 64 423) no Hoare annotation was computed. [2022-07-11 23:59:47,020 INFO L899 garLoopResultBuilder]: For program point L593(line 593) no Hoare annotation was computed. [2022-07-11 23:59:47,020 INFO L899 garLoopResultBuilder]: For program point L527(line 527) no Hoare annotation was computed. [2022-07-11 23:59:47,020 INFO L899 garLoopResultBuilder]: For program point L461(line 461) no Hoare annotation was computed. [2022-07-11 23:59:47,020 INFO L899 garLoopResultBuilder]: For program point L263(lines 263 423) no Hoare annotation was computed. [2022-07-11 23:59:47,020 INFO L899 garLoopResultBuilder]: For program point L197(lines 197 423) no Hoare annotation was computed. [2022-07-11 23:59:47,020 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-11 23:59:47,020 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 515) no Hoare annotation was computed. [2022-07-11 23:59:47,020 INFO L899 garLoopResultBuilder]: For program point L595-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,020 INFO L899 garLoopResultBuilder]: For program point L529-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,020 INFO L899 garLoopResultBuilder]: For program point L463-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,020 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 423) no Hoare annotation was computed. [2022-07-11 23:59:47,020 INFO L899 garLoopResultBuilder]: For program point L133(lines 133 423) no Hoare annotation was computed. [2022-07-11 23:59:47,021 INFO L899 garLoopResultBuilder]: For program point L596(line 596) no Hoare annotation was computed. [2022-07-11 23:59:47,021 INFO L899 garLoopResultBuilder]: For program point L530(line 530) no Hoare annotation was computed. [2022-07-11 23:59:47,021 INFO L899 garLoopResultBuilder]: For program point L464(line 464) no Hoare annotation was computed. [2022-07-11 23:59:47,021 INFO L899 garLoopResultBuilder]: For program point L399(lines 399 423) no Hoare annotation was computed. [2022-07-11 23:59:47,021 INFO L899 garLoopResultBuilder]: For program point L201(lines 201 423) no Hoare annotation was computed. [2022-07-11 23:59:47,021 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 423) no Hoare annotation was computed. [2022-07-11 23:59:47,021 INFO L899 garLoopResultBuilder]: For program point L598-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,021 INFO L899 garLoopResultBuilder]: For program point L532-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,021 INFO L899 garLoopResultBuilder]: For program point L466-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,021 INFO L899 garLoopResultBuilder]: For program point L599(line 599) no Hoare annotation was computed. [2022-07-11 23:59:47,021 INFO L899 garLoopResultBuilder]: For program point L533(line 533) no Hoare annotation was computed. [2022-07-11 23:59:47,021 INFO L899 garLoopResultBuilder]: For program point L467(line 467) no Hoare annotation was computed. [2022-07-11 23:59:47,021 INFO L899 garLoopResultBuilder]: For program point L269(lines 269 423) no Hoare annotation was computed. [2022-07-11 23:59:47,021 INFO L899 garLoopResultBuilder]: For program point L204(lines 204 423) no Hoare annotation was computed. [2022-07-11 23:59:47,021 INFO L899 garLoopResultBuilder]: For program point L601-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,021 INFO L899 garLoopResultBuilder]: For program point L535-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,021 INFO L899 garLoopResultBuilder]: For program point L469-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,021 INFO L899 garLoopResultBuilder]: For program point L271(lines 271 423) no Hoare annotation was computed. [2022-07-11 23:59:47,021 INFO L899 garLoopResultBuilder]: For program point L602(line 602) no Hoare annotation was computed. [2022-07-11 23:59:47,021 INFO L899 garLoopResultBuilder]: For program point L536(line 536) no Hoare annotation was computed. [2022-07-11 23:59:47,022 INFO L899 garLoopResultBuilder]: For program point L470(line 470) no Hoare annotation was computed. [2022-07-11 23:59:47,022 INFO L899 garLoopResultBuilder]: For program point L404(lines 404 423) no Hoare annotation was computed. [2022-07-11 23:59:47,022 INFO L899 garLoopResultBuilder]: For program point L338(lines 338 423) no Hoare annotation was computed. [2022-07-11 23:59:47,022 INFO L899 garLoopResultBuilder]: For program point L272(lines 272 284) no Hoare annotation was computed. [2022-07-11 23:59:47,022 INFO L899 garLoopResultBuilder]: For program point L272-2(lines 272 284) no Hoare annotation was computed. [2022-07-11 23:59:47,022 INFO L899 garLoopResultBuilder]: For program point L140(lines 140 423) no Hoare annotation was computed. [2022-07-11 23:59:47,022 INFO L899 garLoopResultBuilder]: For program point L75(lines 75 423) no Hoare annotation was computed. [2022-07-11 23:59:47,022 INFO L899 garLoopResultBuilder]: For program point L604-1(lines 604 606) no Hoare annotation was computed. [2022-07-11 23:59:47,022 INFO L899 garLoopResultBuilder]: For program point L538-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,022 INFO L899 garLoopResultBuilder]: For program point L472-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,022 INFO L899 garLoopResultBuilder]: For program point L208(lines 208 423) no Hoare annotation was computed. [2022-07-11 23:59:47,022 INFO L899 garLoopResultBuilder]: For program point L605(line 605) no Hoare annotation was computed. [2022-07-11 23:59:47,022 INFO L899 garLoopResultBuilder]: For program point L539(line 539) no Hoare annotation was computed. [2022-07-11 23:59:47,022 INFO L899 garLoopResultBuilder]: For program point L473(line 473) no Hoare annotation was computed. [2022-07-11 23:59:47,022 INFO L899 garLoopResultBuilder]: For program point L341(lines 341 423) no Hoare annotation was computed. [2022-07-11 23:59:47,022 INFO L899 garLoopResultBuilder]: For program point L408(lines 408 423) no Hoare annotation was computed. [2022-07-11 23:59:47,022 INFO L899 garLoopResultBuilder]: For program point L342(lines 342 345) no Hoare annotation was computed. [2022-07-11 23:59:47,022 INFO L899 garLoopResultBuilder]: For program point L342-2(lines 342 345) no Hoare annotation was computed. [2022-07-11 23:59:47,022 INFO L899 garLoopResultBuilder]: For program point L144(lines 144 423) no Hoare annotation was computed. [2022-07-11 23:59:47,023 INFO L895 garLoopResultBuilder]: At program point L607(lines 39 608) the Hoare annotation is: (let ((.cse3 (= ~a25~0 1))) (let ((.cse10 (<= ~a25~0 0)) (.cse7 (<= 10 ~a28~0)) (.cse12 (not .cse3)) (.cse11 (<= ~a19~0 0)) (.cse1 (<= ~a17~0 7)) (.cse4 (= ~a11~0 0)) (.cse8 (= ~a17~0 8)) (.cse6 (<= 9 ~a28~0)) (.cse0 (= ~a11~0 1)) (.cse9 (= ~a21~0 1)) (.cse2 (<= ~a28~0 10)) (.cse5 (= ~a19~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse6 .cse1 .cse4 .cse2) (and .cse7 .cse8 .cse9 .cse4 .cse2 .cse5) (and .cse6 .cse4 .cse2 .cse5 .cse10) (and .cse4 .cse2 .cse10 .cse11) (and .cse0 .cse2 .cse11) (and .cse7 .cse0 .cse2 .cse12) (and .cse8 (= ~a25~0 ~a11~0) .cse9 .cse4 .cse5 (<= ~a28~0 7)) (and (<= 11 ~a28~0) .cse0 .cse12 .cse5) (and .cse3 .cse4 .cse2 .cse11) (and .cse1 .cse4 .cse2 .cse5) (and .cse8 .cse6 .cse0 .cse9 .cse2 .cse5)))) [2022-07-11 23:59:47,023 INFO L899 garLoopResultBuilder]: For program point L541-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,023 INFO L899 garLoopResultBuilder]: For program point L475-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,023 INFO L899 garLoopResultBuilder]: For program point L79(lines 79 423) no Hoare annotation was computed. [2022-07-11 23:59:47,023 INFO L899 garLoopResultBuilder]: For program point L542(line 542) no Hoare annotation was computed. [2022-07-11 23:59:47,023 INFO L899 garLoopResultBuilder]: For program point L476(line 476) no Hoare annotation was computed. [2022-07-11 23:59:47,023 INFO L899 garLoopResultBuilder]: For program point L212(lines 212 423) no Hoare annotation was computed. [2022-07-11 23:59:47,023 INFO L899 garLoopResultBuilder]: For program point L213(lines 213 220) no Hoare annotation was computed. [2022-07-11 23:59:47,023 INFO L899 garLoopResultBuilder]: For program point L213-2(lines 213 220) no Hoare annotation was computed. [2022-07-11 23:59:47,023 INFO L902 garLoopResultBuilder]: At program point L610(lines 610 627) the Hoare annotation is: true [2022-07-11 23:59:47,023 INFO L899 garLoopResultBuilder]: For program point L544-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,023 INFO L899 garLoopResultBuilder]: For program point L478-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,023 INFO L899 garLoopResultBuilder]: For program point L412(lines 412 423) no Hoare annotation was computed. [2022-07-11 23:59:47,023 INFO L899 garLoopResultBuilder]: For program point L545(line 545) no Hoare annotation was computed. [2022-07-11 23:59:47,023 INFO L899 garLoopResultBuilder]: For program point L479(line 479) no Hoare annotation was computed. [2022-07-11 23:59:47,023 INFO L899 garLoopResultBuilder]: For program point L347(lines 347 423) no Hoare annotation was computed. [2022-07-11 23:59:47,023 INFO L899 garLoopResultBuilder]: For program point L149(lines 149 423) no Hoare annotation was computed. [2022-07-11 23:59:47,023 INFO L899 garLoopResultBuilder]: For program point L414(lines 414 423) no Hoare annotation was computed. [2022-07-11 23:59:47,023 INFO L899 garLoopResultBuilder]: For program point L348(lines 348 357) no Hoare annotation was computed. [2022-07-11 23:59:47,023 INFO L899 garLoopResultBuilder]: For program point L348-2(lines 348 357) no Hoare annotation was computed. [2022-07-11 23:59:47,023 INFO L899 garLoopResultBuilder]: For program point L84(lines 84 423) no Hoare annotation was computed. [2022-07-11 23:59:47,023 INFO L899 garLoopResultBuilder]: For program point L547-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,024 INFO L899 garLoopResultBuilder]: For program point L481-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,024 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 90) no Hoare annotation was computed. [2022-07-11 23:59:47,024 INFO L899 garLoopResultBuilder]: For program point L85-2(lines 85 90) no Hoare annotation was computed. [2022-07-11 23:59:47,024 INFO L899 garLoopResultBuilder]: For program point L548(line 548) no Hoare annotation was computed. [2022-07-11 23:59:47,024 INFO L899 garLoopResultBuilder]: For program point L482(line 482) no Hoare annotation was computed. [2022-07-11 23:59:47,024 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-11 23:59:47,024 INFO L899 garLoopResultBuilder]: For program point L417(lines 417 423) no Hoare annotation was computed. [2022-07-11 23:59:47,024 INFO L899 garLoopResultBuilder]: For program point L153(lines 153 423) no Hoare annotation was computed. [2022-07-11 23:59:47,039 INFO L895 garLoopResultBuilder]: At program point L616-2(lines 616 626) the Hoare annotation is: (let ((.cse3 (= ~a25~0 1))) (let ((.cse10 (<= ~a25~0 0)) (.cse7 (<= 10 ~a28~0)) (.cse12 (not .cse3)) (.cse11 (<= ~a19~0 0)) (.cse1 (<= ~a17~0 7)) (.cse4 (= ~a11~0 0)) (.cse8 (= ~a17~0 8)) (.cse6 (<= 9 ~a28~0)) (.cse0 (= ~a11~0 1)) (.cse9 (= ~a21~0 1)) (.cse2 (<= ~a28~0 10)) (.cse5 (= ~a19~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse6 .cse1 .cse4 .cse2) (and .cse7 .cse8 .cse9 .cse4 .cse2 .cse5) (and .cse6 .cse4 .cse2 .cse5 .cse10) (and .cse4 .cse2 .cse10 .cse11) (and .cse0 .cse2 .cse11) (and .cse7 .cse0 .cse2 .cse12) (and .cse8 (= ~a25~0 ~a11~0) .cse9 .cse4 .cse5 (<= ~a28~0 7)) (and (<= 11 ~a28~0) .cse0 .cse12 .cse5) (and .cse3 .cse4 .cse2 .cse11) (and .cse1 .cse4 .cse2 .cse5) (and .cse8 .cse6 .cse0 .cse9 .cse2 .cse5)))) [2022-07-11 23:59:47,039 INFO L899 garLoopResultBuilder]: For program point L550-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,039 INFO L899 garLoopResultBuilder]: For program point L484-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,039 INFO L899 garLoopResultBuilder]: For program point L286(lines 286 423) no Hoare annotation was computed. [2022-07-11 23:59:47,039 INFO L899 garLoopResultBuilder]: For program point L551(line 551) no Hoare annotation was computed. [2022-07-11 23:59:47,039 INFO L899 garLoopResultBuilder]: For program point L485(line 485) no Hoare annotation was computed. [2022-07-11 23:59:47,039 INFO L899 garLoopResultBuilder]: For program point L419(lines 419 423) no Hoare annotation was computed. [2022-07-11 23:59:47,039 INFO L899 garLoopResultBuilder]: For program point L222(lines 222 423) no Hoare annotation was computed. [2022-07-11 23:59:47,039 INFO L899 garLoopResultBuilder]: For program point L553-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,039 INFO L899 garLoopResultBuilder]: For program point L487-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,039 INFO L899 garLoopResultBuilder]: For program point L554(line 554) no Hoare annotation was computed. [2022-07-11 23:59:47,039 INFO L899 garLoopResultBuilder]: For program point L488(line 488) no Hoare annotation was computed. [2022-07-11 23:59:47,039 INFO L899 garLoopResultBuilder]: For program point L290(lines 290 423) no Hoare annotation was computed. [2022-07-11 23:59:47,040 INFO L899 garLoopResultBuilder]: For program point L158(lines 158 423) no Hoare annotation was computed. [2022-07-11 23:59:47,040 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 423) no Hoare annotation was computed. [2022-07-11 23:59:47,040 INFO L899 garLoopResultBuilder]: For program point L621(line 621) no Hoare annotation was computed. [2022-07-11 23:59:47,040 INFO L899 garLoopResultBuilder]: For program point L225(lines 225 423) no Hoare annotation was computed. [2022-07-11 23:59:47,040 INFO L899 garLoopResultBuilder]: For program point L93(lines 93 99) no Hoare annotation was computed. [2022-07-11 23:59:47,040 INFO L899 garLoopResultBuilder]: For program point L93-2(lines 93 99) no Hoare annotation was computed. [2022-07-11 23:59:47,040 INFO L899 garLoopResultBuilder]: For program point L556-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,040 INFO L899 garLoopResultBuilder]: For program point L490-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,040 INFO L899 garLoopResultBuilder]: For program point L424(lines 424 426) no Hoare annotation was computed. [2022-07-11 23:59:47,040 INFO L899 garLoopResultBuilder]: For program point L424-2(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,040 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-11 23:59:47,040 INFO L899 garLoopResultBuilder]: For program point L557(line 557) no Hoare annotation was computed. [2022-07-11 23:59:47,040 INFO L899 garLoopResultBuilder]: For program point L491(line 491) no Hoare annotation was computed. [2022-07-11 23:59:47,040 INFO L899 garLoopResultBuilder]: For program point L425(line 425) no Hoare annotation was computed. [2022-07-11 23:59:47,040 INFO L899 garLoopResultBuilder]: For program point L359(lines 359 423) no Hoare annotation was computed. [2022-07-11 23:59:47,040 INFO L899 garLoopResultBuilder]: For program point L293(lines 293 423) no Hoare annotation was computed. [2022-07-11 23:59:47,040 INFO L899 garLoopResultBuilder]: For program point L228(lines 228 423) no Hoare annotation was computed. [2022-07-11 23:59:47,040 INFO L899 garLoopResultBuilder]: For program point L559-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,040 INFO L899 garLoopResultBuilder]: For program point L493-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,040 INFO L899 garLoopResultBuilder]: For program point L427-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,040 INFO L899 garLoopResultBuilder]: For program point L560(line 560) no Hoare annotation was computed. [2022-07-11 23:59:47,040 INFO L899 garLoopResultBuilder]: For program point L494(line 494) no Hoare annotation was computed. [2022-07-11 23:59:47,040 INFO L899 garLoopResultBuilder]: For program point L428(line 428) no Hoare annotation was computed. [2022-07-11 23:59:47,041 INFO L899 garLoopResultBuilder]: For program point L296(lines 296 423) no Hoare annotation was computed. [2022-07-11 23:59:47,041 INFO L899 garLoopResultBuilder]: For program point L164(lines 164 423) no Hoare annotation was computed. [2022-07-11 23:59:47,041 INFO L899 garLoopResultBuilder]: For program point L562-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,041 INFO L899 garLoopResultBuilder]: For program point L496-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,041 INFO L899 garLoopResultBuilder]: For program point L430-1(lines 39 608) no Hoare annotation was computed. [2022-07-11 23:59:47,041 INFO L899 garLoopResultBuilder]: For program point L364(lines 364 423) no Hoare annotation was computed. [2022-07-11 23:59:47,041 INFO L899 garLoopResultBuilder]: For program point L563(line 563) no Hoare annotation was computed. [2022-07-11 23:59:47,041 INFO L899 garLoopResultBuilder]: For program point L497(line 497) no Hoare annotation was computed. [2022-07-11 23:59:47,041 INFO L899 garLoopResultBuilder]: For program point L431(line 431) no Hoare annotation was computed. [2022-07-11 23:59:47,041 INFO L899 garLoopResultBuilder]: For program point L233(lines 233 423) no Hoare annotation was computed. [2022-07-11 23:59:47,041 INFO L899 garLoopResultBuilder]: For program point L101(lines 101 423) no Hoare annotation was computed. [2022-07-11 23:59:47,044 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:59:47,045 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-11 23:59:47,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 11:59:47 BoogieIcfgContainer [2022-07-11 23:59:47,075 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-11 23:59:47,075 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-11 23:59:47,075 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-11 23:59:47,075 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-11 23:59:47,076 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:59:37" (3/4) ... [2022-07-11 23:59:47,078 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-11 23:59:47,089 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-07-11 23:59:47,090 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-11 23:59:47,090 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-11 23:59:47,091 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-11 23:59:47,138 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-11 23:59:47,138 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-11 23:59:47,138 INFO L158 Benchmark]: Toolchain (without parser) took 11240.00ms. Allocated memory was 104.9MB in the beginning and 312.5MB in the end (delta: 207.6MB). Free memory was 76.3MB in the beginning and 215.9MB in the end (delta: -139.6MB). Peak memory consumption was 68.5MB. Max. memory is 16.1GB. [2022-07-11 23:59:47,138 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory is still 64.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-11 23:59:47,139 INFO L158 Benchmark]: CACSL2BoogieTranslator took 378.37ms. Allocated memory was 104.9MB in the beginning and 159.4MB in the end (delta: 54.5MB). Free memory was 76.0MB in the beginning and 120.0MB in the end (delta: -44.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-11 23:59:47,139 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.22ms. Allocated memory is still 159.4MB. Free memory was 120.0MB in the beginning and 114.3MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-11 23:59:47,139 INFO L158 Benchmark]: Boogie Preprocessor took 105.08ms. Allocated memory is still 159.4MB. Free memory was 114.3MB in the beginning and 110.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-11 23:59:47,139 INFO L158 Benchmark]: RCFGBuilder took 810.86ms. Allocated memory is still 159.4MB. Free memory was 110.1MB in the beginning and 102.0MB in the end (delta: 8.2MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. [2022-07-11 23:59:47,139 INFO L158 Benchmark]: TraceAbstraction took 9801.30ms. Allocated memory was 159.4MB in the beginning and 312.5MB in the end (delta: 153.1MB). Free memory was 101.1MB in the beginning and 225.5MB in the end (delta: -124.4MB). Peak memory consumption was 124.8MB. Max. memory is 16.1GB. [2022-07-11 23:59:47,140 INFO L158 Benchmark]: Witness Printer took 62.79ms. Allocated memory is still 312.5MB. Free memory was 225.5MB in the beginning and 215.9MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-11 23:59:47,141 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.17ms. Allocated memory is still 104.9MB. Free memory is still 64.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 378.37ms. Allocated memory was 104.9MB in the beginning and 159.4MB in the end (delta: 54.5MB). Free memory was 76.0MB in the beginning and 120.0MB in the end (delta: -44.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.22ms. Allocated memory is still 159.4MB. Free memory was 120.0MB in the beginning and 114.3MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 105.08ms. Allocated memory is still 159.4MB. Free memory was 114.3MB in the beginning and 110.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 810.86ms. Allocated memory is still 159.4MB. Free memory was 110.1MB in the beginning and 102.0MB in the end (delta: 8.2MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. * TraceAbstraction took 9801.30ms. Allocated memory was 159.4MB in the beginning and 312.5MB in the end (delta: 153.1MB). Free memory was 101.1MB in the beginning and 225.5MB in the end (delta: -124.4MB). Peak memory consumption was 124.8MB. Max. memory is 16.1GB. * Witness Printer took 62.79ms. Allocated memory is still 312.5MB. Free memory was 225.5MB in the beginning and 215.9MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. 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: 515]: 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, 227 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.7s, OverallIterations: 15, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2096 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2096 mSDsluCounter, 2633 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 291 mSDsCounter, 896 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5927 IncrementalHoareTripleChecker+Invalid, 6823 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 896 mSolverCounterUnsat, 2342 mSDtfsCounter, 5927 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 783 GetRequests, 755 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2990occurred in iteration=8, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 1282 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 49 NumberOfFragments, 369 HoareAnnotationTreeSize, 3 FomulaSimplifications, 110 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 892 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 3307 NumberOfCodeBlocks, 3307 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 3289 ConstructedInterpolants, 0 QuantifiedInterpolants, 12880 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1211 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 18 InterpolantComputations, 15 PerfectInterpolantSequences, 1816/2045 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: 616]: Loop Invariant Derived loop invariant: (((((((((((((a11 == 1 && a17 <= 7) && a28 <= 10) || ((a25 == 1 && a11 == 0) && a19 == 1)) || (((9 <= a28 && a17 <= 7) && a11 == 0) && a28 <= 10)) || (((((10 <= a28 && a17 == 8) && a21 == 1) && a11 == 0) && a28 <= 10) && a19 == 1)) || ((((9 <= a28 && a11 == 0) && a28 <= 10) && a19 == 1) && a25 <= 0)) || (((a11 == 0 && a28 <= 10) && a25 <= 0) && a19 <= 0)) || ((a11 == 1 && a28 <= 10) && a19 <= 0)) || (((10 <= a28 && a11 == 1) && a28 <= 10) && !(a25 == 1))) || (((((a17 == 8 && a25 == a11) && a21 == 1) && a11 == 0) && a19 == 1) && a28 <= 7)) || (((11 <= a28 && a11 == 1) && !(a25 == 1)) && a19 == 1)) || (((a25 == 1 && a11 == 0) && a28 <= 10) && a19 <= 0)) || (((a17 <= 7 && a11 == 0) && a28 <= 10) && a19 == 1)) || (((((a17 == 8 && 9 <= a28) && a11 == 1) && a21 == 1) && a28 <= 10) && a19 == 1) - InvariantResult [Line: 610]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: (((((((((((((a11 == 1 && a17 <= 7) && a28 <= 10) || ((a25 == 1 && a11 == 0) && a19 == 1)) || (((9 <= a28 && a17 <= 7) && a11 == 0) && a28 <= 10)) || (((((10 <= a28 && a17 == 8) && a21 == 1) && a11 == 0) && a28 <= 10) && a19 == 1)) || ((((9 <= a28 && a11 == 0) && a28 <= 10) && a19 == 1) && a25 <= 0)) || (((a11 == 0 && a28 <= 10) && a25 <= 0) && a19 <= 0)) || ((a11 == 1 && a28 <= 10) && a19 <= 0)) || (((10 <= a28 && a11 == 1) && a28 <= 10) && !(a25 == 1))) || (((((a17 == 8 && a25 == a11) && a21 == 1) && a11 == 0) && a19 == 1) && a28 <= 7)) || (((11 <= a28 && a11 == 1) && !(a25 == 1)) && a19 == 1)) || (((a25 == 1 && a11 == 0) && a28 <= 10) && a19 <= 0)) || (((a17 <= 7 && a11 == 0) && a28 <= 10) && a19 == 1)) || (((((a17 == 8 && 9 <= a28) && a11 == 1) && a21 == 1) && a28 <= 10) && a19 == 1) RESULT: Ultimate proved your program to be correct! [2022-07-11 23:59:47,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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