./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label33.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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/Problem11_label33.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 7166744474158954665024dc8c8b3712d72f905c129b3d2684427468d2506fe1 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 12:41:49,941 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 12:41:49,970 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 12:41:50,001 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 12:41:50,002 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 12:41:50,003 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 12:41:50,007 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 12:41:50,011 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 12:41:50,013 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 12:41:50,018 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 12:41:50,018 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 12:41:50,020 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 12:41:50,020 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 12:41:50,022 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 12:41:50,023 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 12:41:50,024 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 12:41:50,025 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 12:41:50,026 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 12:41:50,029 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 12:41:50,034 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 12:41:50,040 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 12:41:50,041 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 12:41:50,041 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 12:41:50,042 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 12:41:50,043 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 12:41:50,045 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 12:41:50,046 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 12:41:50,046 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 12:41:50,047 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 12:41:50,047 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 12:41:50,048 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 12:41:50,049 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 12:41:50,050 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 12:41:50,050 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 12:41:50,051 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 12:41:50,051 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 12:41:50,052 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 12:41:50,052 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 12:41:50,052 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 12:41:50,052 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 12:41:50,053 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 12:41:50,054 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 12:41:50,055 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 12:41:50,078 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 12:41:50,083 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 12:41:50,083 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 12:41:50,083 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 12:41:50,084 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 12:41:50,084 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 12:41:50,084 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 12:41:50,084 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 12:41:50,085 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 12:41:50,085 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 12:41:50,085 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 12:41:50,085 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 12:41:50,085 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 12:41:50,085 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 12:41:50,085 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 12:41:50,085 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 12:41:50,085 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 12:41:50,085 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 12:41:50,086 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 12:41:50,086 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 12:41:50,086 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 12:41:50,086 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 12:41:50,086 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 12:41:50,086 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 12:41:50,086 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 12:41:50,086 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 12:41:50,086 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 12:41:50,087 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 12:41:50,087 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 12:41:50,087 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 12:41:50,087 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 12:41:50,087 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 12:41:50,087 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 12:41:50,087 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 -> 7166744474158954665024dc8c8b3712d72f905c129b3d2684427468d2506fe1 [2022-07-13 12:41:50,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 12:41:50,273 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 12:41:50,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 12:41:50,276 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 12:41:50,277 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 12:41:50,277 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label33.c [2022-07-13 12:41:50,352 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c131d2420/736369b32b3d4d9e9b7fe647579e32d7/FLAG32c9ca55f [2022-07-13 12:41:50,784 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 12:41:50,785 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label33.c [2022-07-13 12:41:50,810 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c131d2420/736369b32b3d4d9e9b7fe647579e32d7/FLAG32c9ca55f [2022-07-13 12:41:50,820 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c131d2420/736369b32b3d4d9e9b7fe647579e32d7 [2022-07-13 12:41:50,822 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 12:41:50,823 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 12:41:50,824 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 12:41:50,824 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 12:41:50,826 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 12:41:50,827 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 12:41:50" (1/1) ... [2022-07-13 12:41:50,828 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@464eab5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 12:41:50, skipping insertion in model container [2022-07-13 12:41:50,828 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 12:41:50" (1/1) ... [2022-07-13 12:41:50,832 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 12:41:50,866 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 12:41:50,999 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/Problem11_label33.c[4121,4134] [2022-07-13 12:41:51,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 12:41:51,165 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 12:41:51,177 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/Problem11_label33.c[4121,4134] [2022-07-13 12:41:51,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 12:41:51,253 INFO L208 MainTranslator]: Completed translation [2022-07-13 12:41:51,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 12:41:51 WrapperNode [2022-07-13 12:41:51,254 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 12:41:51,255 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 12:41:51,256 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 12:41:51,256 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 12:41:51,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 12:41:51" (1/1) ... [2022-07-13 12:41:51,289 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 12:41:51" (1/1) ... [2022-07-13 12:41:51,392 INFO L137 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 999 [2022-07-13 12:41:51,392 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 12:41:51,394 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 12:41:51,394 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 12:41:51,394 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 12:41:51,400 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 12:41:51" (1/1) ... [2022-07-13 12:41:51,400 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 12:41:51" (1/1) ... [2022-07-13 12:41:51,409 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 12:41:51" (1/1) ... [2022-07-13 12:41:51,410 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 12:41:51" (1/1) ... [2022-07-13 12:41:51,446 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 12:41:51" (1/1) ... [2022-07-13 12:41:51,467 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 12:41:51" (1/1) ... [2022-07-13 12:41:51,485 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 12:41:51" (1/1) ... [2022-07-13 12:41:51,499 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 12:41:51,500 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 12:41:51,501 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 12:41:51,501 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 12:41:51,502 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 12:41:51" (1/1) ... [2022-07-13 12:41:51,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 12:41:51,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 12:41:51,526 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-13 12:41:51,536 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-13 12:41:51,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 12:41:51,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 12:41:51,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 12:41:51,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 12:41:51,591 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 12:41:51,592 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 12:41:52,716 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 12:41:52,728 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 12:41:52,728 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 12:41:52,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 12:41:52 BoogieIcfgContainer [2022-07-13 12:41:52,731 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 12:41:52,733 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 12:41:52,733 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 12:41:52,735 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 12:41:52,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 12:41:50" (1/3) ... [2022-07-13 12:41:52,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5af7d11c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 12:41:52, skipping insertion in model container [2022-07-13 12:41:52,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 12:41:51" (2/3) ... [2022-07-13 12:41:52,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5af7d11c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 12:41:52, skipping insertion in model container [2022-07-13 12:41:52,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 12:41:52" (3/3) ... [2022-07-13 12:41:52,737 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem11_label33.c [2022-07-13 12:41:52,747 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 12:41:52,748 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 12:41:52,790 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 12:41:52,797 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@3ba9b37a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3a648d73 [2022-07-13 12:41:52,798 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 12:41:52,802 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:41:52,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-13 12:41:52,807 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 12:41:52,808 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 12:41:52,808 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 12:41:52,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 12:41:52,812 INFO L85 PathProgramCache]: Analyzing trace with hash -716875070, now seen corresponding path program 1 times [2022-07-13 12:41:52,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 12:41:52,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409304756] [2022-07-13 12:41:52,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 12:41:52,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 12:41:52,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 12:41:52,945 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-13 12:41:52,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 12:41:52,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409304756] [2022-07-13 12:41:52,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409304756] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 12:41:52,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 12:41:52,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 12:41:52,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933278301] [2022-07-13 12:41:52,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 12:41:52,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 12:41:52,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 12:41:52,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 12:41:52,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 12:41:52,971 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:41:53,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 12:41:53,806 INFO L93 Difference]: Finished difference Result 761 states and 1345 transitions. [2022-07-13 12:41:53,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 12:41:53,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-13 12:41:53,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 12:41:53,817 INFO L225 Difference]: With dead ends: 761 [2022-07-13 12:41:53,817 INFO L226 Difference]: Without dead ends: 413 [2022-07-13 12:41:53,820 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-13 12:41:53,822 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 200 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 12:41:53,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 222 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 12:41:53,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2022-07-13 12:41:53,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2022-07-13 12:41:53,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 1.453883495145631) internal successors, (599), 412 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:41:53,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 599 transitions. [2022-07-13 12:41:53,863 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 599 transitions. Word has length 28 [2022-07-13 12:41:53,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 12:41:53,864 INFO L495 AbstractCegarLoop]: Abstraction has 413 states and 599 transitions. [2022-07-13 12:41:53,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:41:53,864 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 599 transitions. [2022-07-13 12:41:53,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-13 12:41:53,867 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 12:41:53,867 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 12:41:53,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 12:41:53,867 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 12:41:53,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 12:41:53,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1836683206, now seen corresponding path program 1 times [2022-07-13 12:41:53,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 12:41:53,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430023863] [2022-07-13 12:41:53,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 12:41:53,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 12:41:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 12:41:53,982 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 12:41:53,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 12:41:53,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430023863] [2022-07-13 12:41:53,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430023863] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 12:41:53,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 12:41:53,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 12:41:53,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961330194] [2022-07-13 12:41:53,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 12:41:53,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 12:41:53,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 12:41:53,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 12:41:53,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 12:41:53,986 INFO L87 Difference]: Start difference. First operand 413 states and 599 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:41:54,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 12:41:54,614 INFO L93 Difference]: Finished difference Result 1211 states and 1763 transitions. [2022-07-13 12:41:54,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 12:41:54,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2022-07-13 12:41:54,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 12:41:54,618 INFO L225 Difference]: With dead ends: 1211 [2022-07-13 12:41:54,618 INFO L226 Difference]: Without dead ends: 800 [2022-07-13 12:41:54,619 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-13 12:41:54,620 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 142 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 12:41:54,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 120 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 12:41:54,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2022-07-13 12:41:54,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 789. [2022-07-13 12:41:54,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.3743654822335025) internal successors, (1083), 788 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:41:54,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1083 transitions. [2022-07-13 12:41:54,642 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1083 transitions. Word has length 96 [2022-07-13 12:41:54,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 12:41:54,642 INFO L495 AbstractCegarLoop]: Abstraction has 789 states and 1083 transitions. [2022-07-13 12:41:54,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:41:54,643 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1083 transitions. [2022-07-13 12:41:54,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-13 12:41:54,644 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 12:41:54,645 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 12:41:54,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 12:41:54,645 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 12:41:54,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 12:41:54,645 INFO L85 PathProgramCache]: Analyzing trace with hash 867693909, now seen corresponding path program 1 times [2022-07-13 12:41:54,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 12:41:54,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469510893] [2022-07-13 12:41:54,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 12:41:54,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 12:41:54,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 12:41:54,751 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 12:41:54,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 12:41:54,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469510893] [2022-07-13 12:41:54,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469510893] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 12:41:54,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 12:41:54,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 12:41:54,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536223089] [2022-07-13 12:41:54,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 12:41:54,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 12:41:54,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 12:41:54,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 12:41:54,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 12:41:54,753 INFO L87 Difference]: Start difference. First operand 789 states and 1083 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:41:55,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 12:41:55,340 INFO L93 Difference]: Finished difference Result 1945 states and 2612 transitions. [2022-07-13 12:41:55,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 12:41:55,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2022-07-13 12:41:55,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 12:41:55,345 INFO L225 Difference]: With dead ends: 1945 [2022-07-13 12:41:55,345 INFO L226 Difference]: Without dead ends: 1158 [2022-07-13 12:41:55,346 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-13 12:41:55,347 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 119 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 12:41:55,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 190 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 12:41:55,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2022-07-13 12:41:55,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1157. [2022-07-13 12:41:55,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1156 states have (on average 1.2707612456747406) internal successors, (1469), 1156 states have internal predecessors, (1469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:41:55,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1469 transitions. [2022-07-13 12:41:55,364 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1469 transitions. Word has length 98 [2022-07-13 12:41:55,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 12:41:55,365 INFO L495 AbstractCegarLoop]: Abstraction has 1157 states and 1469 transitions. [2022-07-13 12:41:55,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:41:55,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1469 transitions. [2022-07-13 12:41:55,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-07-13 12:41:55,368 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 12:41:55,368 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 12:41:55,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 12:41:55,368 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 12:41:55,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 12:41:55,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1002850089, now seen corresponding path program 1 times [2022-07-13 12:41:55,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 12:41:55,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765926467] [2022-07-13 12:41:55,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 12:41:55,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 12:41:55,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 12:41:55,466 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 12:41:55,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 12:41:55,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765926467] [2022-07-13 12:41:55,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765926467] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 12:41:55,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 12:41:55,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 12:41:55,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740300200] [2022-07-13 12:41:55,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 12:41:55,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 12:41:55,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 12:41:55,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 12:41:55,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 12:41:55,471 INFO L87 Difference]: Start difference. First operand 1157 states and 1469 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:41:56,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 12:41:56,036 INFO L93 Difference]: Finished difference Result 2519 states and 3349 transitions. [2022-07-13 12:41:56,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 12:41:56,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2022-07-13 12:41:56,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 12:41:56,041 INFO L225 Difference]: With dead ends: 2519 [2022-07-13 12:41:56,041 INFO L226 Difference]: Without dead ends: 1548 [2022-07-13 12:41:56,042 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-13 12:41:56,043 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 207 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 12:41:56,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 322 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 12:41:56,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2022-07-13 12:41:56,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1545. [2022-07-13 12:41:56,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1544 states have (on average 1.2933937823834196) internal successors, (1997), 1544 states have internal predecessors, (1997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:41:56,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 1997 transitions. [2022-07-13 12:41:56,066 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 1997 transitions. Word has length 155 [2022-07-13 12:41:56,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 12:41:56,067 INFO L495 AbstractCegarLoop]: Abstraction has 1545 states and 1997 transitions. [2022-07-13 12:41:56,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:41:56,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 1997 transitions. [2022-07-13 12:41:56,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-07-13 12:41:56,070 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 12:41:56,070 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 12:41:56,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 12:41:56,071 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 12:41:56,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 12:41:56,071 INFO L85 PathProgramCache]: Analyzing trace with hash -85004655, now seen corresponding path program 1 times [2022-07-13 12:41:56,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 12:41:56,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841617130] [2022-07-13 12:41:56,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 12:41:56,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 12:41:56,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 12:41:56,216 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-07-13 12:41:56,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 12:41:56,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841617130] [2022-07-13 12:41:56,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841617130] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 12:41:56,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 12:41:56,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 12:41:56,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776963247] [2022-07-13 12:41:56,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 12:41:56,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 12:41:56,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 12:41:56,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 12:41:56,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 12:41:56,219 INFO L87 Difference]: Start difference. First operand 1545 states and 1997 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:41:56,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 12:41:56,849 INFO L93 Difference]: Finished difference Result 3650 states and 4815 transitions. [2022-07-13 12:41:56,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 12:41:56,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 210 [2022-07-13 12:41:56,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 12:41:56,855 INFO L225 Difference]: With dead ends: 3650 [2022-07-13 12:41:56,855 INFO L226 Difference]: Without dead ends: 2291 [2022-07-13 12:41:56,857 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-13 12:41:56,858 INFO L413 NwaCegarLoop]: 371 mSDtfsCounter, 169 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 12:41:56,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 392 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 12:41:56,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2291 states. [2022-07-13 12:41:56,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2291 to 2098. [2022-07-13 12:41:56,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2098 states, 2097 states have (on average 1.2675250357653791) internal successors, (2658), 2097 states have internal predecessors, (2658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:41:56,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 2658 transitions. [2022-07-13 12:41:56,882 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 2658 transitions. Word has length 210 [2022-07-13 12:41:56,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 12:41:56,883 INFO L495 AbstractCegarLoop]: Abstraction has 2098 states and 2658 transitions. [2022-07-13 12:41:56,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:41:56,883 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 2658 transitions. [2022-07-13 12:41:56,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-07-13 12:41:56,885 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 12:41:56,885 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 12:41:56,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 12:41:56,886 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 12:41:56,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 12:41:56,886 INFO L85 PathProgramCache]: Analyzing trace with hash 78170338, now seen corresponding path program 1 times [2022-07-13 12:41:56,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 12:41:56,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166472675] [2022-07-13 12:41:56,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 12:41:56,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 12:41:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 12:41:56,952 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-13 12:41:56,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 12:41:56,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166472675] [2022-07-13 12:41:56,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166472675] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 12:41:56,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 12:41:56,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 12:41:56,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274402052] [2022-07-13 12:41:56,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 12:41:56,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 12:41:56,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 12:41:56,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 12:41:56,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 12:41:56,954 INFO L87 Difference]: Start difference. First operand 2098 states and 2658 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:41:57,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 12:41:57,555 INFO L93 Difference]: Finished difference Result 5851 states and 7488 transitions. [2022-07-13 12:41:57,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 12:41:57,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 216 [2022-07-13 12:41:57,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 12:41:57,572 INFO L225 Difference]: With dead ends: 5851 [2022-07-13 12:41:57,572 INFO L226 Difference]: Without dead ends: 3755 [2022-07-13 12:41:57,575 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-13 12:41:57,576 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 183 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 12:41:57,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 144 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 12:41:57,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3755 states. [2022-07-13 12:41:57,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3755 to 3755. [2022-07-13 12:41:57,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3755 states, 3754 states have (on average 1.245338305807139) internal successors, (4675), 3754 states have internal predecessors, (4675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:41:57,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3755 states to 3755 states and 4675 transitions. [2022-07-13 12:41:57,637 INFO L78 Accepts]: Start accepts. Automaton has 3755 states and 4675 transitions. Word has length 216 [2022-07-13 12:41:57,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 12:41:57,638 INFO L495 AbstractCegarLoop]: Abstraction has 3755 states and 4675 transitions. [2022-07-13 12:41:57,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:41:57,638 INFO L276 IsEmpty]: Start isEmpty. Operand 3755 states and 4675 transitions. [2022-07-13 12:41:57,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2022-07-13 12:41:57,641 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 12:41:57,641 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 12:41:57,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 12:41:57,641 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 12:41:57,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 12:41:57,642 INFO L85 PathProgramCache]: Analyzing trace with hash 964138675, now seen corresponding path program 1 times [2022-07-13 12:41:57,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 12:41:57,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742328160] [2022-07-13 12:41:57,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 12:41:57,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 12:41:57,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 12:41:57,805 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 12:41:57,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 12:41:57,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742328160] [2022-07-13 12:41:57,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742328160] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 12:41:57,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 12:41:57,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 12:41:57,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305821007] [2022-07-13 12:41:57,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 12:41:57,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 12:41:57,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 12:41:57,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 12:41:57,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-13 12:41:57,808 INFO L87 Difference]: Start difference. First operand 3755 states and 4675 transitions. Second operand has 5 states, 5 states have (on average 49.4) internal successors, (247), 4 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:41:59,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 12:41:59,260 INFO L93 Difference]: Finished difference Result 13433 states and 17026 transitions. [2022-07-13 12:41:59,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 12:41:59,261 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 49.4) internal successors, (247), 4 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 247 [2022-07-13 12:41:59,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 12:41:59,285 INFO L225 Difference]: With dead ends: 13433 [2022-07-13 12:41:59,286 INFO L226 Difference]: Without dead ends: 9680 [2022-07-13 12:41:59,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-13 12:41:59,293 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 413 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1873 mSolverCounterSat, 337 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 2210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 337 IncrementalHoareTripleChecker+Valid, 1873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-13 12:41:59,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 106 Invalid, 2210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [337 Valid, 1873 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-13 12:41:59,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9680 states. [2022-07-13 12:41:59,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9680 to 9475. [2022-07-13 12:41:59,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9475 states, 9474 states have (on average 1.21638167616635) internal successors, (11524), 9474 states have internal predecessors, (11524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:41:59,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9475 states to 9475 states and 11524 transitions. [2022-07-13 12:41:59,428 INFO L78 Accepts]: Start accepts. Automaton has 9475 states and 11524 transitions. Word has length 247 [2022-07-13 12:41:59,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 12:41:59,428 INFO L495 AbstractCegarLoop]: Abstraction has 9475 states and 11524 transitions. [2022-07-13 12:41:59,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.4) internal successors, (247), 4 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:41:59,429 INFO L276 IsEmpty]: Start isEmpty. Operand 9475 states and 11524 transitions. [2022-07-13 12:41:59,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2022-07-13 12:41:59,435 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 12:41:59,435 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 12:41:59,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 12:41:59,436 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 12:41:59,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 12:41:59,436 INFO L85 PathProgramCache]: Analyzing trace with hash 640219882, now seen corresponding path program 1 times [2022-07-13 12:41:59,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 12:41:59,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407301860] [2022-07-13 12:41:59,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 12:41:59,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 12:41:59,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 12:41:59,556 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2022-07-13 12:41:59,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 12:41:59,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407301860] [2022-07-13 12:41:59,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407301860] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 12:41:59,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 12:41:59,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 12:41:59,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730453479] [2022-07-13 12:41:59,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 12:41:59,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 12:41:59,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 12:41:59,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 12:41:59,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 12:41:59,558 INFO L87 Difference]: Start difference. First operand 9475 states and 11524 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:00,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 12:42:00,209 INFO L93 Difference]: Finished difference Result 21155 states and 26096 transitions. [2022-07-13 12:42:00,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 12:42:00,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 293 [2022-07-13 12:42:00,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 12:42:00,268 INFO L225 Difference]: With dead ends: 21155 [2022-07-13 12:42:00,268 INFO L226 Difference]: Without dead ends: 12050 [2022-07-13 12:42:00,277 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-13 12:42:00,278 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 195 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 12:42:00,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 151 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 12:42:00,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12050 states. [2022-07-13 12:42:00,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12050 to 9468. [2022-07-13 12:42:00,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9468 states, 9467 states have (on average 1.2162247808175768) internal successors, (11514), 9467 states have internal predecessors, (11514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:00,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9468 states to 9468 states and 11514 transitions. [2022-07-13 12:42:00,468 INFO L78 Accepts]: Start accepts. Automaton has 9468 states and 11514 transitions. Word has length 293 [2022-07-13 12:42:00,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 12:42:00,470 INFO L495 AbstractCegarLoop]: Abstraction has 9468 states and 11514 transitions. [2022-07-13 12:42:00,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:00,470 INFO L276 IsEmpty]: Start isEmpty. Operand 9468 states and 11514 transitions. [2022-07-13 12:42:00,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2022-07-13 12:42:00,477 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 12:42:00,478 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 12:42:00,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 12:42:00,480 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 12:42:00,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 12:42:00,481 INFO L85 PathProgramCache]: Analyzing trace with hash 117863084, now seen corresponding path program 1 times [2022-07-13 12:42:00,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 12:42:00,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060110927] [2022-07-13 12:42:00,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 12:42:00,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 12:42:00,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 12:42:00,590 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 12:42:00,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 12:42:00,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060110927] [2022-07-13 12:42:00,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060110927] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 12:42:00,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 12:42:00,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 12:42:00,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543637996] [2022-07-13 12:42:00,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 12:42:00,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 12:42:00,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 12:42:00,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 12:42:00,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 12:42:00,593 INFO L87 Difference]: Start difference. First operand 9468 states and 11514 transitions. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:01,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 12:42:01,179 INFO L93 Difference]: Finished difference Result 20054 states and 24754 transitions. [2022-07-13 12:42:01,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 12:42:01,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 298 [2022-07-13 12:42:01,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 12:42:01,204 INFO L225 Difference]: With dead ends: 20054 [2022-07-13 12:42:01,204 INFO L226 Difference]: Without dead ends: 10956 [2022-07-13 12:42:01,214 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-13 12:42:01,216 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 61 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 12:42:01,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 335 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 12:42:01,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10956 states. [2022-07-13 12:42:01,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10956 to 10756. [2022-07-13 12:42:01,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10756 states, 10755 states have (on average 1.20371920037192) internal successors, (12946), 10755 states have internal predecessors, (12946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:01,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10756 states to 10756 states and 12946 transitions. [2022-07-13 12:42:01,356 INFO L78 Accepts]: Start accepts. Automaton has 10756 states and 12946 transitions. Word has length 298 [2022-07-13 12:42:01,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 12:42:01,356 INFO L495 AbstractCegarLoop]: Abstraction has 10756 states and 12946 transitions. [2022-07-13 12:42:01,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:01,357 INFO L276 IsEmpty]: Start isEmpty. Operand 10756 states and 12946 transitions. [2022-07-13 12:42:01,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2022-07-13 12:42:01,363 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 12:42:01,364 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 12:42:01,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 12:42:01,364 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 12:42:01,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 12:42:01,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1642030569, now seen corresponding path program 1 times [2022-07-13 12:42:01,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 12:42:01,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297803623] [2022-07-13 12:42:01,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 12:42:01,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 12:42:01,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 12:42:01,497 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 248 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-07-13 12:42:01,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 12:42:01,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297803623] [2022-07-13 12:42:01,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297803623] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 12:42:01,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 12:42:01,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 12:42:01,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931671322] [2022-07-13 12:42:01,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 12:42:01,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 12:42:01,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 12:42:01,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 12:42:01,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 12:42:01,499 INFO L87 Difference]: Start difference. First operand 10756 states and 12946 transitions. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:02,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 12:42:02,050 INFO L93 Difference]: Finished difference Result 20377 states and 24418 transitions. [2022-07-13 12:42:02,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 12:42:02,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 312 [2022-07-13 12:42:02,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 12:42:02,064 INFO L225 Difference]: With dead ends: 20377 [2022-07-13 12:42:02,065 INFO L226 Difference]: Without dead ends: 9991 [2022-07-13 12:42:02,074 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-13 12:42:02,075 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 137 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 12:42:02,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 148 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 12:42:02,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9991 states. [2022-07-13 12:42:02,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9991 to 7599. [2022-07-13 12:42:02,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7599 states, 7598 states have (on average 1.1417478283758884) internal successors, (8675), 7598 states have internal predecessors, (8675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:02,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7599 states to 7599 states and 8675 transitions. [2022-07-13 12:42:02,196 INFO L78 Accepts]: Start accepts. Automaton has 7599 states and 8675 transitions. Word has length 312 [2022-07-13 12:42:02,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 12:42:02,197 INFO L495 AbstractCegarLoop]: Abstraction has 7599 states and 8675 transitions. [2022-07-13 12:42:02,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:02,197 INFO L276 IsEmpty]: Start isEmpty. Operand 7599 states and 8675 transitions. [2022-07-13 12:42:02,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2022-07-13 12:42:02,208 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 12:42:02,208 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 12:42:02,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 12:42:02,209 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 12:42:02,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 12:42:02,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1079031194, now seen corresponding path program 1 times [2022-07-13 12:42:02,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 12:42:02,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004903493] [2022-07-13 12:42:02,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 12:42:02,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 12:42:02,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 12:42:02,346 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2022-07-13 12:42:02,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 12:42:02,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004903493] [2022-07-13 12:42:02,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004903493] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 12:42:02,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 12:42:02,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 12:42:02,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010968311] [2022-07-13 12:42:02,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 12:42:02,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 12:42:02,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 12:42:02,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 12:42:02,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 12:42:02,348 INFO L87 Difference]: Start difference. First operand 7599 states and 8675 transitions. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:02,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 12:42:02,981 INFO L93 Difference]: Finished difference Result 17772 states and 20278 transitions. [2022-07-13 12:42:02,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 12:42:02,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 397 [2022-07-13 12:42:02,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 12:42:02,994 INFO L225 Difference]: With dead ends: 17772 [2022-07-13 12:42:02,994 INFO L226 Difference]: Without dead ends: 9802 [2022-07-13 12:42:03,000 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-13 12:42:03,001 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 121 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 12:42:03,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 315 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 12:42:03,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9802 states. [2022-07-13 12:42:03,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9802 to 8698. [2022-07-13 12:42:03,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8698 states, 8697 states have (on average 1.134069219271013) internal successors, (9863), 8697 states have internal predecessors, (9863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:03,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8698 states to 8698 states and 9863 transitions. [2022-07-13 12:42:03,092 INFO L78 Accepts]: Start accepts. Automaton has 8698 states and 9863 transitions. Word has length 397 [2022-07-13 12:42:03,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 12:42:03,093 INFO L495 AbstractCegarLoop]: Abstraction has 8698 states and 9863 transitions. [2022-07-13 12:42:03,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:03,094 INFO L276 IsEmpty]: Start isEmpty. Operand 8698 states and 9863 transitions. [2022-07-13 12:42:03,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2022-07-13 12:42:03,103 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 12:42:03,104 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 12:42:03,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 12:42:03,104 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 12:42:03,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 12:42:03,104 INFO L85 PathProgramCache]: Analyzing trace with hash 145108911, now seen corresponding path program 1 times [2022-07-13 12:42:03,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 12:42:03,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633945102] [2022-07-13 12:42:03,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 12:42:03,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 12:42:03,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 12:42:03,404 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 355 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-13 12:42:03,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 12:42:03,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633945102] [2022-07-13 12:42:03,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633945102] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 12:42:03,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 12:42:03,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 12:42:03,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184096971] [2022-07-13 12:42:03,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 12:42:03,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 12:42:03,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 12:42:03,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 12:42:03,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-13 12:42:03,407 INFO L87 Difference]: Start difference. First operand 8698 states and 9863 transitions. Second operand has 7 states, 7 states have (on average 53.285714285714285) internal successors, (373), 6 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:04,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 12:42:04,649 INFO L93 Difference]: Finished difference Result 20143 states and 22796 transitions. [2022-07-13 12:42:04,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 12:42:04,650 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 53.285714285714285) internal successors, (373), 6 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 398 [2022-07-13 12:42:04,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 12:42:04,666 INFO L225 Difference]: With dead ends: 20143 [2022-07-13 12:42:04,666 INFO L226 Difference]: Without dead ends: 11815 [2022-07-13 12:42:04,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-13 12:42:04,675 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 339 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1737 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 1926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 1737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-13 12:42:04,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 181 Invalid, 1926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 1737 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-13 12:42:04,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11815 states. [2022-07-13 12:42:04,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11815 to 11461. [2022-07-13 12:42:04,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11461 states, 11460 states have (on average 1.1300174520069808) internal successors, (12950), 11460 states have internal predecessors, (12950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:04,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11461 states to 11461 states and 12950 transitions. [2022-07-13 12:42:04,849 INFO L78 Accepts]: Start accepts. Automaton has 11461 states and 12950 transitions. Word has length 398 [2022-07-13 12:42:04,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 12:42:04,849 INFO L495 AbstractCegarLoop]: Abstraction has 11461 states and 12950 transitions. [2022-07-13 12:42:04,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 53.285714285714285) internal successors, (373), 6 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:04,850 INFO L276 IsEmpty]: Start isEmpty. Operand 11461 states and 12950 transitions. [2022-07-13 12:42:04,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2022-07-13 12:42:04,861 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 12:42:04,861 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 12:42:04,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 12:42:04,862 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 12:42:04,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 12:42:04,862 INFO L85 PathProgramCache]: Analyzing trace with hash 504044406, now seen corresponding path program 1 times [2022-07-13 12:42:04,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 12:42:04,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016240155] [2022-07-13 12:42:04,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 12:42:04,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 12:42:04,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 12:42:05,125 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 357 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-13 12:42:05,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 12:42:05,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016240155] [2022-07-13 12:42:05,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016240155] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 12:42:05,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324224268] [2022-07-13 12:42:05,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 12:42:05,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 12:42:05,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 12:42:05,128 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-13 12:42:05,131 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-13 12:42:05,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 12:42:05,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 12:42:05,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 12:42:06,193 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 244 proven. 121 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-13 12:42:06,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 12:42:08,571 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 244 proven. 121 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-13 12:42:08,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324224268] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 12:42:08,572 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 12:42:08,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 10 [2022-07-13 12:42:08,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745006303] [2022-07-13 12:42:08,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 12:42:08,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 12:42:08,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 12:42:08,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 12:42:08,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-07-13 12:42:08,574 INFO L87 Difference]: Start difference. First operand 11461 states and 12950 transitions. Second operand has 11 states, 11 states have (on average 86.45454545454545) internal successors, (951), 10 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:12,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 12:42:12,521 INFO L93 Difference]: Finished difference Result 30539 states and 34353 transitions. [2022-07-13 12:42:12,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-13 12:42:12,522 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 86.45454545454545) internal successors, (951), 10 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 408 [2022-07-13 12:42:12,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 12:42:12,546 INFO L225 Difference]: With dead ends: 30539 [2022-07-13 12:42:12,546 INFO L226 Difference]: Without dead ends: 18698 [2022-07-13 12:42:12,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 847 GetRequests, 811 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=363, Invalid=969, Unknown=0, NotChecked=0, Total=1332 [2022-07-13 12:42:12,558 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 1398 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 4391 mSolverCounterSat, 971 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1398 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 5362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 971 IncrementalHoareTripleChecker+Valid, 4391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-13 12:42:12,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1398 Valid, 250 Invalid, 5362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [971 Valid, 4391 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-13 12:42:12,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18698 states. [2022-07-13 12:42:12,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18698 to 10723. [2022-07-13 12:42:12,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10723 states, 10722 states have (on average 1.104178324939377) internal successors, (11839), 10722 states have internal predecessors, (11839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:12,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10723 states to 10723 states and 11839 transitions. [2022-07-13 12:42:12,745 INFO L78 Accepts]: Start accepts. Automaton has 10723 states and 11839 transitions. Word has length 408 [2022-07-13 12:42:12,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 12:42:12,746 INFO L495 AbstractCegarLoop]: Abstraction has 10723 states and 11839 transitions. [2022-07-13 12:42:12,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 86.45454545454545) internal successors, (951), 10 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:12,746 INFO L276 IsEmpty]: Start isEmpty. Operand 10723 states and 11839 transitions. [2022-07-13 12:42:12,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2022-07-13 12:42:12,756 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 12:42:12,756 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 12:42:12,786 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-13 12:42:12,971 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,SelfDestructingSolverStorable12 [2022-07-13 12:42:12,972 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 12:42:12,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 12:42:12,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1509289490, now seen corresponding path program 1 times [2022-07-13 12:42:12,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 12:42:12,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596769397] [2022-07-13 12:42:12,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 12:42:12,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 12:42:13,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 12:42:13,100 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 412 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 12:42:13,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 12:42:13,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596769397] [2022-07-13 12:42:13,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596769397] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 12:42:13,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 12:42:13,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 12:42:13,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273818068] [2022-07-13 12:42:13,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 12:42:13,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 12:42:13,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 12:42:13,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 12:42:13,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 12:42:13,103 INFO L87 Difference]: Start difference. First operand 10723 states and 11839 transitions. Second operand has 4 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:13,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 12:42:13,945 INFO L93 Difference]: Finished difference Result 23476 states and 25909 transitions. [2022-07-13 12:42:13,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 12:42:13,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 430 [2022-07-13 12:42:13,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 12:42:13,960 INFO L225 Difference]: With dead ends: 23476 [2022-07-13 12:42:13,960 INFO L226 Difference]: Without dead ends: 13123 [2022-07-13 12:42:13,967 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-13 12:42:13,968 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 180 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 12:42:13,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 63 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1006 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 12:42:13,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13123 states. [2022-07-13 12:42:14,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13123 to 12386. [2022-07-13 12:42:14,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12386 states, 12385 states have (on average 1.09245054501413) internal successors, (13530), 12385 states have internal predecessors, (13530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:14,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12386 states to 12386 states and 13530 transitions. [2022-07-13 12:42:14,109 INFO L78 Accepts]: Start accepts. Automaton has 12386 states and 13530 transitions. Word has length 430 [2022-07-13 12:42:14,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 12:42:14,109 INFO L495 AbstractCegarLoop]: Abstraction has 12386 states and 13530 transitions. [2022-07-13 12:42:14,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:14,110 INFO L276 IsEmpty]: Start isEmpty. Operand 12386 states and 13530 transitions. [2022-07-13 12:42:14,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2022-07-13 12:42:14,164 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 12:42:14,165 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 12:42:14,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 12:42:14,165 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 12:42:14,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 12:42:14,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1406221149, now seen corresponding path program 1 times [2022-07-13 12:42:14,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 12:42:14,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715070539] [2022-07-13 12:42:14,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 12:42:14,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 12:42:14,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 12:42:14,307 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2022-07-13 12:42:14,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 12:42:14,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715070539] [2022-07-13 12:42:14,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715070539] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 12:42:14,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 12:42:14,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 12:42:14,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766411681] [2022-07-13 12:42:14,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 12:42:14,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 12:42:14,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 12:42:14,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 12:42:14,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 12:42:14,310 INFO L87 Difference]: Start difference. First operand 12386 states and 13530 transitions. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:14,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 12:42:14,880 INFO L93 Difference]: Finished difference Result 26426 states and 28854 transitions. [2022-07-13 12:42:14,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 12:42:14,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 445 [2022-07-13 12:42:14,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 12:42:14,894 INFO L225 Difference]: With dead ends: 26426 [2022-07-13 12:42:14,894 INFO L226 Difference]: Without dead ends: 12568 [2022-07-13 12:42:14,902 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-13 12:42:14,902 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 117 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 12:42:14,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 294 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 12:42:14,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12568 states. [2022-07-13 12:42:15,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12568 to 10911. [2022-07-13 12:42:15,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10911 states, 10910 states have (on average 1.0778185151237396) internal successors, (11759), 10910 states have internal predecessors, (11759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:15,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10911 states to 10911 states and 11759 transitions. [2022-07-13 12:42:15,025 INFO L78 Accepts]: Start accepts. Automaton has 10911 states and 11759 transitions. Word has length 445 [2022-07-13 12:42:15,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 12:42:15,025 INFO L495 AbstractCegarLoop]: Abstraction has 10911 states and 11759 transitions. [2022-07-13 12:42:15,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:15,025 INFO L276 IsEmpty]: Start isEmpty. Operand 10911 states and 11759 transitions. [2022-07-13 12:42:15,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2022-07-13 12:42:15,035 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 12:42:15,035 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 12:42:15,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-13 12:42:15,036 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 12:42:15,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 12:42:15,036 INFO L85 PathProgramCache]: Analyzing trace with hash 546987130, now seen corresponding path program 1 times [2022-07-13 12:42:15,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 12:42:15,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712953573] [2022-07-13 12:42:15,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 12:42:15,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 12:42:15,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 12:42:15,156 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 589 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-07-13 12:42:15,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 12:42:15,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712953573] [2022-07-13 12:42:15,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712953573] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 12:42:15,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 12:42:15,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 12:42:15,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687219753] [2022-07-13 12:42:15,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 12:42:15,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 12:42:15,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 12:42:15,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 12:42:15,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 12:42:15,158 INFO L87 Difference]: Start difference. First operand 10911 states and 11759 transitions. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:15,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 12:42:15,641 INFO L93 Difference]: Finished difference Result 22555 states and 24296 transitions. [2022-07-13 12:42:15,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 12:42:15,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 483 [2022-07-13 12:42:15,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 12:42:15,652 INFO L225 Difference]: With dead ends: 22555 [2022-07-13 12:42:15,652 INFO L226 Difference]: Without dead ends: 12014 [2022-07-13 12:42:15,659 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-13 12:42:15,659 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 68 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 12:42:15,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 307 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 12:42:15,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12014 states. [2022-07-13 12:42:15,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12014 to 11830. [2022-07-13 12:42:15,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11830 states, 11829 states have (on average 1.0695747738608505) internal successors, (12652), 11829 states have internal predecessors, (12652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:15,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11830 states to 11830 states and 12652 transitions. [2022-07-13 12:42:15,785 INFO L78 Accepts]: Start accepts. Automaton has 11830 states and 12652 transitions. Word has length 483 [2022-07-13 12:42:15,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 12:42:15,785 INFO L495 AbstractCegarLoop]: Abstraction has 11830 states and 12652 transitions. [2022-07-13 12:42:15,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:15,786 INFO L276 IsEmpty]: Start isEmpty. Operand 11830 states and 12652 transitions. [2022-07-13 12:42:15,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2022-07-13 12:42:15,795 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 12:42:15,796 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 12:42:15,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 12:42:15,796 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 12:42:15,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 12:42:15,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1451405169, now seen corresponding path program 1 times [2022-07-13 12:42:15,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 12:42:15,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999847370] [2022-07-13 12:42:15,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 12:42:15,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 12:42:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 12:42:15,919 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 578 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2022-07-13 12:42:15,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 12:42:15,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999847370] [2022-07-13 12:42:15,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999847370] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 12:42:15,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 12:42:15,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 12:42:15,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231765941] [2022-07-13 12:42:15,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 12:42:15,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 12:42:15,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 12:42:15,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 12:42:15,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 12:42:15,922 INFO L87 Difference]: Start difference. First operand 11830 states and 12652 transitions. Second operand has 4 states, 4 states have (on average 90.5) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:16,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 12:42:16,724 INFO L93 Difference]: Finished difference Result 24032 states and 25730 transitions. [2022-07-13 12:42:16,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 12:42:16,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 483 [2022-07-13 12:42:16,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 12:42:16,737 INFO L225 Difference]: With dead ends: 24032 [2022-07-13 12:42:16,737 INFO L226 Difference]: Without dead ends: 12572 [2022-07-13 12:42:16,744 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-13 12:42:16,745 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 193 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 1113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 12:42:16,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 102 Invalid, 1113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 12:42:16,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12572 states. [2022-07-13 12:42:16,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12572 to 12016. [2022-07-13 12:42:16,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12016 states, 12015 states have (on average 1.0689138576779027) internal successors, (12843), 12015 states have internal predecessors, (12843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:16,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12016 states to 12016 states and 12843 transitions. [2022-07-13 12:42:16,911 INFO L78 Accepts]: Start accepts. Automaton has 12016 states and 12843 transitions. Word has length 483 [2022-07-13 12:42:16,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 12:42:16,911 INFO L495 AbstractCegarLoop]: Abstraction has 12016 states and 12843 transitions. [2022-07-13 12:42:16,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:16,912 INFO L276 IsEmpty]: Start isEmpty. Operand 12016 states and 12843 transitions. [2022-07-13 12:42:16,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2022-07-13 12:42:16,920 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 12:42:16,921 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 12:42:16,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-13 12:42:16,921 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 12:42:16,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 12:42:16,922 INFO L85 PathProgramCache]: Analyzing trace with hash 704365135, now seen corresponding path program 1 times [2022-07-13 12:42:16,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 12:42:16,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019668841] [2022-07-13 12:42:16,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 12:42:16,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 12:42:16,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 12:42:17,063 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 594 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2022-07-13 12:42:17,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 12:42:17,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019668841] [2022-07-13 12:42:17,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019668841] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 12:42:17,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 12:42:17,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 12:42:17,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001782098] [2022-07-13 12:42:17,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 12:42:17,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 12:42:17,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 12:42:17,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 12:42:17,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 12:42:17,065 INFO L87 Difference]: Start difference. First operand 12016 states and 12843 transitions. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:17,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 12:42:17,559 INFO L93 Difference]: Finished difference Result 24033 states and 25696 transitions. [2022-07-13 12:42:17,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 12:42:17,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 488 [2022-07-13 12:42:17,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 12:42:17,571 INFO L225 Difference]: With dead ends: 24033 [2022-07-13 12:42:17,571 INFO L226 Difference]: Without dead ends: 12203 [2022-07-13 12:42:17,579 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-13 12:42:17,580 INFO L413 NwaCegarLoop]: 304 mSDtfsCounter, 66 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 12:42:17,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 323 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 12:42:17,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12203 states. [2022-07-13 12:42:17,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12203 to 12015. [2022-07-13 12:42:17,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12015 states, 12014 states have (on average 1.057516231063759) internal successors, (12705), 12014 states have internal predecessors, (12705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:17,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12015 states to 12015 states and 12705 transitions. [2022-07-13 12:42:17,692 INFO L78 Accepts]: Start accepts. Automaton has 12015 states and 12705 transitions. Word has length 488 [2022-07-13 12:42:17,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 12:42:17,692 INFO L495 AbstractCegarLoop]: Abstraction has 12015 states and 12705 transitions. [2022-07-13 12:42:17,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:17,693 INFO L276 IsEmpty]: Start isEmpty. Operand 12015 states and 12705 transitions. [2022-07-13 12:42:17,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2022-07-13 12:42:17,700 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 12:42:17,700 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 12:42:17,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-13 12:42:17,700 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 12:42:17,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 12:42:17,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1341858608, now seen corresponding path program 1 times [2022-07-13 12:42:17,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 12:42:17,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696152560] [2022-07-13 12:42:17,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 12:42:17,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 12:42:17,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 12:42:17,829 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 605 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-07-13 12:42:17,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 12:42:17,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696152560] [2022-07-13 12:42:17,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696152560] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 12:42:17,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 12:42:17,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 12:42:17,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663522276] [2022-07-13 12:42:17,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 12:42:17,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 12:42:17,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 12:42:17,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 12:42:17,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 12:42:17,832 INFO L87 Difference]: Start difference. First operand 12015 states and 12705 transitions. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:18,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 12:42:18,345 INFO L93 Difference]: Finished difference Result 25515 states and 27017 transitions. [2022-07-13 12:42:18,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 12:42:18,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 497 [2022-07-13 12:42:18,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 12:42:18,360 INFO L225 Difference]: With dead ends: 25515 [2022-07-13 12:42:18,360 INFO L226 Difference]: Without dead ends: 13870 [2022-07-13 12:42:18,368 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-13 12:42:18,368 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 64 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 12:42:18,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 135 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 12:42:18,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13870 states. [2022-07-13 12:42:18,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13870 to 12567. [2022-07-13 12:42:18,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12567 states, 12566 states have (on average 1.0563425115390737) internal successors, (13274), 12566 states have internal predecessors, (13274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:18,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12567 states to 12567 states and 13274 transitions. [2022-07-13 12:42:18,507 INFO L78 Accepts]: Start accepts. Automaton has 12567 states and 13274 transitions. Word has length 497 [2022-07-13 12:42:18,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 12:42:18,507 INFO L495 AbstractCegarLoop]: Abstraction has 12567 states and 13274 transitions. [2022-07-13 12:42:18,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:18,507 INFO L276 IsEmpty]: Start isEmpty. Operand 12567 states and 13274 transitions. [2022-07-13 12:42:18,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 565 [2022-07-13 12:42:18,516 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 12:42:18,516 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 12:42:18,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-13 12:42:18,517 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 12:42:18,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 12:42:18,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1445337457, now seen corresponding path program 1 times [2022-07-13 12:42:18,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 12:42:18,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257842305] [2022-07-13 12:42:18,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 12:42:18,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 12:42:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 12:42:18,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1070 backedges. 637 proven. 0 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2022-07-13 12:42:18,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 12:42:18,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257842305] [2022-07-13 12:42:18,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257842305] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 12:42:18,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 12:42:18,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 12:42:18,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130558561] [2022-07-13 12:42:18,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 12:42:18,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 12:42:18,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 12:42:18,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 12:42:18,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 12:42:18,649 INFO L87 Difference]: Start difference. First operand 12567 states and 13274 transitions. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:19,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 12:42:19,110 INFO L93 Difference]: Finished difference Result 24579 states and 25963 transitions. [2022-07-13 12:42:19,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 12:42:19,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 564 [2022-07-13 12:42:19,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 12:42:19,123 INFO L225 Difference]: With dead ends: 24579 [2022-07-13 12:42:19,123 INFO L226 Difference]: Without dead ends: 12382 [2022-07-13 12:42:19,130 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-13 12:42:19,131 INFO L413 NwaCegarLoop]: 303 mSDtfsCounter, 192 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 12:42:19,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 325 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 12:42:19,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12382 states. [2022-07-13 12:42:19,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12382 to 12382. [2022-07-13 12:42:19,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12382 states, 12381 states have (on average 1.055084403521525) internal successors, (13063), 12381 states have internal predecessors, (13063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:19,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12382 states to 12382 states and 13063 transitions. [2022-07-13 12:42:19,253 INFO L78 Accepts]: Start accepts. Automaton has 12382 states and 13063 transitions. Word has length 564 [2022-07-13 12:42:19,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 12:42:19,253 INFO L495 AbstractCegarLoop]: Abstraction has 12382 states and 13063 transitions. [2022-07-13 12:42:19,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:19,253 INFO L276 IsEmpty]: Start isEmpty. Operand 12382 states and 13063 transitions. [2022-07-13 12:42:19,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2022-07-13 12:42:19,262 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 12:42:19,262 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 12:42:19,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-13 12:42:19,263 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 12:42:19,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 12:42:19,263 INFO L85 PathProgramCache]: Analyzing trace with hash 688501029, now seen corresponding path program 1 times [2022-07-13 12:42:19,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 12:42:19,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384382430] [2022-07-13 12:42:19,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 12:42:19,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 12:42:19,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 12:42:19,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 683 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2022-07-13 12:42:19,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 12:42:19,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384382430] [2022-07-13 12:42:19,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384382430] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 12:42:19,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 12:42:19,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 12:42:19,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683186108] [2022-07-13 12:42:19,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 12:42:19,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 12:42:19,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 12:42:19,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 12:42:19,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 12:42:19,432 INFO L87 Difference]: Start difference. First operand 12382 states and 13063 transitions. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:19,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 12:42:19,934 INFO L93 Difference]: Finished difference Result 26049 states and 27494 transitions. [2022-07-13 12:42:19,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 12:42:19,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 590 [2022-07-13 12:42:19,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 12:42:19,956 INFO L225 Difference]: With dead ends: 26049 [2022-07-13 12:42:19,956 INFO L226 Difference]: Without dead ends: 14037 [2022-07-13 12:42:19,963 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-13 12:42:19,964 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 143 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 12:42:19,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 61 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 12:42:19,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14037 states. [2022-07-13 12:42:20,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14037 to 12746. [2022-07-13 12:42:20,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12746 states, 12745 states have (on average 1.0522557865829738) internal successors, (13411), 12745 states have internal predecessors, (13411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:20,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12746 states to 12746 states and 13411 transitions. [2022-07-13 12:42:20,099 INFO L78 Accepts]: Start accepts. Automaton has 12746 states and 13411 transitions. Word has length 590 [2022-07-13 12:42:20,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 12:42:20,099 INFO L495 AbstractCegarLoop]: Abstraction has 12746 states and 13411 transitions. [2022-07-13 12:42:20,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:20,099 INFO L276 IsEmpty]: Start isEmpty. Operand 12746 states and 13411 transitions. [2022-07-13 12:42:20,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2022-07-13 12:42:20,108 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 12:42:20,108 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 12:42:20,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-13 12:42:20,109 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 12:42:20,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 12:42:20,109 INFO L85 PathProgramCache]: Analyzing trace with hash 54450342, now seen corresponding path program 1 times [2022-07-13 12:42:20,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 12:42:20,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86708190] [2022-07-13 12:42:20,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 12:42:20,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 12:42:20,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 12:42:20,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1119 backedges. 889 proven. 0 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2022-07-13 12:42:20,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 12:42:20,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86708190] [2022-07-13 12:42:20,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86708190] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 12:42:20,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 12:42:20,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 12:42:20,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858254107] [2022-07-13 12:42:20,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 12:42:20,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 12:42:20,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 12:42:20,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 12:42:20,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 12:42:20,252 INFO L87 Difference]: Start difference. First operand 12746 states and 13411 transitions. Second operand has 4 states, 4 states have (on average 98.5) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:21,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 12:42:21,056 INFO L93 Difference]: Finished difference Result 32132 states and 33819 transitions. [2022-07-13 12:42:21,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 12:42:21,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 98.5) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 595 [2022-07-13 12:42:21,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 12:42:21,077 INFO L225 Difference]: With dead ends: 32132 [2022-07-13 12:42:21,077 INFO L226 Difference]: Without dead ends: 19388 [2022-07-13 12:42:21,081 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-13 12:42:21,082 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 203 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 12:42:21,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 64 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 952 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 12:42:21,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19388 states. [2022-07-13 12:42:21,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19388 to 16250. [2022-07-13 12:42:21,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16250 states, 16249 states have (on average 1.0510800664656286) internal successors, (17079), 16249 states have internal predecessors, (17079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:21,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16250 states to 16250 states and 17079 transitions. [2022-07-13 12:42:21,258 INFO L78 Accepts]: Start accepts. Automaton has 16250 states and 17079 transitions. Word has length 595 [2022-07-13 12:42:21,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 12:42:21,258 INFO L495 AbstractCegarLoop]: Abstraction has 16250 states and 17079 transitions. [2022-07-13 12:42:21,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.5) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:21,258 INFO L276 IsEmpty]: Start isEmpty. Operand 16250 states and 17079 transitions. [2022-07-13 12:42:21,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2022-07-13 12:42:21,268 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 12:42:21,268 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 12:42:21,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-13 12:42:21,268 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 12:42:21,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 12:42:21,269 INFO L85 PathProgramCache]: Analyzing trace with hash 905967947, now seen corresponding path program 1 times [2022-07-13 12:42:21,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 12:42:21,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769763270] [2022-07-13 12:42:21,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 12:42:21,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 12:42:21,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 12:42:21,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1201 backedges. 1064 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-07-13 12:42:21,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 12:42:21,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769763270] [2022-07-13 12:42:21,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769763270] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 12:42:21,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 12:42:21,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 12:42:21,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085254452] [2022-07-13 12:42:21,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 12:42:21,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 12:42:21,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 12:42:21,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 12:42:21,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 12:42:21,421 INFO L87 Difference]: Start difference. First operand 16250 states and 17079 transitions. Second operand has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:22,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 12:42:22,206 INFO L93 Difference]: Finished difference Result 33977 states and 35796 transitions. [2022-07-13 12:42:22,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 12:42:22,207 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 601 [2022-07-13 12:42:22,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 12:42:22,225 INFO L225 Difference]: With dead ends: 33977 [2022-07-13 12:42:22,225 INFO L226 Difference]: Without dead ends: 17915 [2022-07-13 12:42:22,236 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-13 12:42:22,236 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 186 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 12:42:22,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 73 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 941 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 12:42:22,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17915 states. [2022-07-13 12:42:22,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17915 to 17910. [2022-07-13 12:42:22,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17910 states, 17909 states have (on average 1.0521525489977106) internal successors, (18843), 17909 states have internal predecessors, (18843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:22,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17910 states to 17910 states and 18843 transitions. [2022-07-13 12:42:22,496 INFO L78 Accepts]: Start accepts. Automaton has 17910 states and 18843 transitions. Word has length 601 [2022-07-13 12:42:22,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 12:42:22,496 INFO L495 AbstractCegarLoop]: Abstraction has 17910 states and 18843 transitions. [2022-07-13 12:42:22,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:22,496 INFO L276 IsEmpty]: Start isEmpty. Operand 17910 states and 18843 transitions. [2022-07-13 12:42:22,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2022-07-13 12:42:22,506 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 12:42:22,507 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 12:42:22,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-13 12:42:22,507 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 12:42:22,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 12:42:22,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1278260760, now seen corresponding path program 1 times [2022-07-13 12:42:22,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 12:42:22,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875938665] [2022-07-13 12:42:22,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 12:42:22,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 12:42:22,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 12:42:22,685 INFO L134 CoverageAnalysis]: Checked inductivity of 862 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 759 trivial. 0 not checked. [2022-07-13 12:42:22,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 12:42:22,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875938665] [2022-07-13 12:42:22,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875938665] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 12:42:22,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 12:42:22,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 12:42:22,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293625543] [2022-07-13 12:42:22,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 12:42:22,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 12:42:22,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 12:42:22,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 12:42:22,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 12:42:22,688 INFO L87 Difference]: Start difference. First operand 17910 states and 18843 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:23,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 12:42:23,158 INFO L93 Difference]: Finished difference Result 18097 states and 19041 transitions. [2022-07-13 12:42:23,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 12:42:23,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 608 [2022-07-13 12:42:23,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 12:42:23,159 INFO L225 Difference]: With dead ends: 18097 [2022-07-13 12:42:23,159 INFO L226 Difference]: Without dead ends: 0 [2022-07-13 12:42:23,165 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-13 12:42:23,165 INFO L413 NwaCegarLoop]: 300 mSDtfsCounter, 162 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 12:42:23,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 322 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 12:42:23,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-13 12:42:23,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-13 12:42:23,166 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-13 12:42:23,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-13 12:42:23,166 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 608 [2022-07-13 12:42:23,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 12:42:23,167 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 12:42:23,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 12:42:23,167 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-13 12:42:23,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-13 12:42:23,169 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 12:42:23,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-13 12:42:23,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-13 12:42:31,309 WARN L233 SmtUtils]: Spent 8.13s on a formula simplification. DAG size of input: 801 DAG size of output: 789 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-13 12:42:39,312 WARN L233 SmtUtils]: Spent 7.99s on a formula simplification. DAG size of input: 801 DAG size of output: 789 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-13 12:42:47,447 INFO L899 garLoopResultBuilder]: For program point L498(lines 498 509) no Hoare annotation was computed. [2022-07-13 12:42:47,447 INFO L899 garLoopResultBuilder]: For program point L432(lines 432 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,447 INFO L899 garLoopResultBuilder]: For program point L498-2(lines 498 509) no Hoare annotation was computed. [2022-07-13 12:42:47,447 INFO L899 garLoopResultBuilder]: For program point L168-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,447 INFO L899 garLoopResultBuilder]: For program point L102-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,447 INFO L899 garLoopResultBuilder]: For program point L36-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,448 INFO L899 garLoopResultBuilder]: For program point L1027(lines 1027 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,448 INFO L899 garLoopResultBuilder]: For program point L631(lines 631 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,448 INFO L899 garLoopResultBuilder]: For program point L565(lines 565 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,448 INFO L899 garLoopResultBuilder]: For program point L169(line 169) no Hoare annotation was computed. [2022-07-13 12:42:47,448 INFO L899 garLoopResultBuilder]: For program point L103(line 103) no Hoare annotation was computed. [2022-07-13 12:42:47,448 INFO L899 garLoopResultBuilder]: For program point L37(line 37) no Hoare annotation was computed. [2022-07-13 12:42:47,448 INFO L899 garLoopResultBuilder]: For program point L896(lines 896 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,448 INFO L899 garLoopResultBuilder]: For program point L698(lines 698 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,448 INFO L899 garLoopResultBuilder]: For program point L368(lines 368 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,448 INFO L899 garLoopResultBuilder]: For program point L963(lines 963 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,448 INFO L899 garLoopResultBuilder]: For program point L237(lines 237 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,448 INFO L899 garLoopResultBuilder]: For program point L171-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,449 INFO L899 garLoopResultBuilder]: For program point L105-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,449 INFO L899 garLoopResultBuilder]: For program point L39-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,449 INFO L899 garLoopResultBuilder]: For program point L832(lines 832 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,449 INFO L899 garLoopResultBuilder]: For program point L304(lines 304 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,449 INFO L899 garLoopResultBuilder]: For program point L172(line 172) no Hoare annotation was computed. [2022-07-13 12:42:47,449 INFO L899 garLoopResultBuilder]: For program point L106(line 106) no Hoare annotation was computed. [2022-07-13 12:42:47,449 INFO L899 garLoopResultBuilder]: For program point L40(line 40) no Hoare annotation was computed. [2022-07-13 12:42:47,449 INFO L899 garLoopResultBuilder]: For program point L767(lines 767 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,449 INFO L899 garLoopResultBuilder]: For program point L768(lines 768 778) no Hoare annotation was computed. [2022-07-13 12:42:47,449 INFO L899 garLoopResultBuilder]: For program point L768-2(lines 768 778) no Hoare annotation was computed. [2022-07-13 12:42:47,450 INFO L899 garLoopResultBuilder]: For program point L174-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,450 INFO L899 garLoopResultBuilder]: For program point L108-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,450 INFO L899 garLoopResultBuilder]: For program point L42-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,450 INFO L899 garLoopResultBuilder]: For program point L835(lines 835 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,450 INFO L899 garLoopResultBuilder]: For program point L571(lines 571 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,450 INFO L899 garLoopResultBuilder]: For program point L439(lines 439 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,450 INFO L899 garLoopResultBuilder]: For program point L175(line 175) no Hoare annotation was computed. [2022-07-13 12:42:47,450 INFO L899 garLoopResultBuilder]: For program point L109(line 109) no Hoare annotation was computed. [2022-07-13 12:42:47,450 INFO L899 garLoopResultBuilder]: For program point L43(line 43) no Hoare annotation was computed. [2022-07-13 12:42:47,450 INFO L899 garLoopResultBuilder]: For program point L968(lines 968 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,450 INFO L899 garLoopResultBuilder]: For program point L704(lines 704 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,450 INFO L899 garLoopResultBuilder]: For program point L638(lines 638 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,451 INFO L895 garLoopResultBuilder]: At program point L1035(lines 32 1036) the Hoare annotation is: (let ((.cse21 (+ ~a23~0 43))) (let ((.cse16 (= ~a25~0 12)) (.cse10 (<= .cse21 0))) (let ((.cse15 (= ~a25~0 10)) (.cse11 (<= 261 ~a29~0)) (.cse8 (<= (+ 119992 ~a23~0) 0)) (.cse5 (= ~a25~0 11)) (.cse13 (<= ~a29~0 599998)) (.cse12 (<= ~a25~0 10)) (.cse18 (or (not .cse10) (not (= ~a25~0 9)) (not (<= ~a29~0 140)))) (.cse1 (<= ~a23~0 278)) (.cse17 (or (not (< 306 ~a23~0)) (not .cse16) (not (< 277 ~a29~0)))) (.cse19 (<= 99915 ~a29~0)) (.cse2 (< 0 .cse21)) (.cse6 (<= ~a29~0 245)) (.cse0 (= ~a25~0 13)) (.cse4 (= ~a4~0 0)) (.cse20 (<= ~a29~0 274)) (.cse7 (<= ~a23~0 138)) (.cse14 (<= 130 ~a29~0)) (.cse9 (<= (+ ~a29~0 22) 0)) (.cse3 (= ~a4~0 1))) (or (and .cse0 .cse1 (<= 99912 ~a29~0) .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse4 .cse9 .cse7) (and .cse10 .cse11 .cse4 .cse12 .cse13) (and .cse4 .cse9 .cse12 .cse7) (and .cse2 .cse12 .cse3 .cse14) (and .cse12 .cse3 .cse15) (and .cse0 (<= 307 ~a23~0) .cse13 .cse3) (and .cse5 .cse2 .cse3 (<= ~a23~0 312)) (and .cse16 .cse3 .cse17 .cse14) (and .cse1 .cse9 .cse2 .cse6 .cse3) (and .cse6 .cse7 .cse18 .cse3 .cse14) (and .cse4 .cse9 (<= 0 (+ ~a29~0 28553)) .cse15) (and .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse11 .cse4 .cse5 .cse13 .cse8) (and .cse4 .cse12 .cse13 .cse19) (and .cse5 .cse3 .cse14) (and .cse4 .cse2 .cse20 .cse7) (and .cse16 .cse4 .cse13 .cse17 .cse14) (and .cse12 .cse7 .cse18 .cse3) (and .cse16 .cse4 .cse9) (and .cse1 .cse16 .cse3) (and .cse3 .cse17 .cse19 (or (not .cse0) (<= ~a23~0 306))) (and .cse0 .cse2 .cse6 .cse3) (and .cse0 .cse4 .cse20 .cse7 .cse14) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 1)) .cse16 .cse9 (= ~a3~0 1) .cse3 (<= 312 ~a23~0) (= ~a8~0 15)))))) [2022-07-13 12:42:47,451 INFO L899 garLoopResultBuilder]: For program point L903(lines 903 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,451 INFO L899 garLoopResultBuilder]: For program point L705(lines 705 715) no Hoare annotation was computed. [2022-07-13 12:42:47,451 INFO L899 garLoopResultBuilder]: For program point L705-2(lines 705 715) no Hoare annotation was computed. [2022-07-13 12:42:47,451 INFO L899 garLoopResultBuilder]: For program point L375(lines 375 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,451 INFO L899 garLoopResultBuilder]: For program point L309(lines 309 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,451 INFO L899 garLoopResultBuilder]: For program point L243(lines 243 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,451 INFO L899 garLoopResultBuilder]: For program point L177-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,451 INFO L899 garLoopResultBuilder]: For program point L111-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,451 INFO L899 garLoopResultBuilder]: For program point L45-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,451 INFO L899 garLoopResultBuilder]: For program point L178(line 178) no Hoare annotation was computed. [2022-07-13 12:42:47,451 INFO L899 garLoopResultBuilder]: For program point L112(line 112) no Hoare annotation was computed. [2022-07-13 12:42:47,451 INFO L899 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2022-07-13 12:42:47,451 INFO L902 garLoopResultBuilder]: At program point L1038(lines 1038 1054) the Hoare annotation is: true [2022-07-13 12:42:47,451 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,451 INFO L899 garLoopResultBuilder]: For program point L510(lines 510 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,451 INFO L899 garLoopResultBuilder]: For program point L180-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,451 INFO L899 garLoopResultBuilder]: For program point L114-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,451 INFO L899 garLoopResultBuilder]: For program point L48-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,451 INFO L899 garLoopResultBuilder]: For program point L973(lines 973 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,451 INFO L899 garLoopResultBuilder]: For program point L841(lines 841 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,451 INFO L899 garLoopResultBuilder]: For program point L181(line 181) no Hoare annotation was computed. [2022-07-13 12:42:47,452 INFO L899 garLoopResultBuilder]: For program point L115(line 115) no Hoare annotation was computed. [2022-07-13 12:42:47,452 INFO L899 garLoopResultBuilder]: For program point L49(line 49) no Hoare annotation was computed. [2022-07-13 12:42:47,452 INFO L899 garLoopResultBuilder]: For program point L908(lines 908 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,452 INFO L899 garLoopResultBuilder]: For program point L446(lines 446 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,452 INFO L899 garLoopResultBuilder]: For program point L380(lines 380 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,452 INFO L899 garLoopResultBuilder]: For program point L645(lines 645 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,452 INFO L899 garLoopResultBuilder]: For program point L315(lines 315 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,452 INFO L899 garLoopResultBuilder]: For program point L183-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,452 INFO L899 garLoopResultBuilder]: For program point L117-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,452 INFO L899 garLoopResultBuilder]: For program point L51-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,452 INFO L899 garLoopResultBuilder]: For program point L250(lines 250 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,452 INFO L899 garLoopResultBuilder]: For program point L184(line 184) no Hoare annotation was computed. [2022-07-13 12:42:47,452 INFO L899 garLoopResultBuilder]: For program point L118(line 118) no Hoare annotation was computed. [2022-07-13 12:42:47,452 INFO L899 garLoopResultBuilder]: For program point L52(line 52) no Hoare annotation was computed. [2022-07-13 12:42:47,452 INFO L899 garLoopResultBuilder]: For program point L779(lines 779 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,452 INFO L895 garLoopResultBuilder]: At program point L1044-2(lines 1044 1053) the Hoare annotation is: (let ((.cse21 (+ ~a23~0 43))) (let ((.cse16 (= ~a25~0 12)) (.cse10 (<= .cse21 0))) (let ((.cse15 (= ~a25~0 10)) (.cse11 (<= 261 ~a29~0)) (.cse8 (<= (+ 119992 ~a23~0) 0)) (.cse5 (= ~a25~0 11)) (.cse13 (<= ~a29~0 599998)) (.cse12 (<= ~a25~0 10)) (.cse18 (or (not .cse10) (not (= ~a25~0 9)) (not (<= ~a29~0 140)))) (.cse1 (<= ~a23~0 278)) (.cse17 (or (not (< 306 ~a23~0)) (not .cse16) (not (< 277 ~a29~0)))) (.cse19 (<= 99915 ~a29~0)) (.cse2 (< 0 .cse21)) (.cse6 (<= ~a29~0 245)) (.cse0 (= ~a25~0 13)) (.cse4 (= ~a4~0 0)) (.cse20 (<= ~a29~0 274)) (.cse7 (<= ~a23~0 138)) (.cse14 (<= 130 ~a29~0)) (.cse9 (<= (+ ~a29~0 22) 0)) (.cse3 (= ~a4~0 1))) (or (and .cse0 .cse1 (<= 99912 ~a29~0) .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse4 .cse9 .cse7) (and .cse10 .cse11 .cse4 .cse12 .cse13) (and .cse4 .cse9 .cse12 .cse7) (and .cse2 .cse12 .cse3 .cse14) (and .cse12 .cse3 .cse15) (and .cse0 (<= 307 ~a23~0) .cse13 .cse3) (and .cse5 .cse2 .cse3 (<= ~a23~0 312)) (and .cse16 .cse3 .cse17 .cse14) (and .cse1 .cse9 .cse2 .cse6 .cse3) (and .cse6 .cse7 .cse18 .cse3 .cse14) (and .cse4 .cse9 (<= 0 (+ ~a29~0 28553)) .cse15) (and .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse11 .cse4 .cse5 .cse13 .cse8) (and .cse4 .cse12 .cse13 .cse19) (and .cse5 .cse3 .cse14) (and .cse4 .cse2 .cse20 .cse7) (and .cse16 .cse4 .cse13 .cse17 .cse14) (and .cse12 .cse7 .cse18 .cse3) (and .cse16 .cse4 .cse9) (and .cse1 .cse16 .cse3) (and .cse3 .cse17 .cse19 (or (not .cse0) (<= ~a23~0 306))) (and .cse0 .cse2 .cse6 .cse3) (and .cse0 .cse4 .cse20 .cse7 .cse14) (and (not (= |ULTIMATE.start_calculate_output_~input#1| 1)) .cse16 .cse9 (= ~a3~0 1) .cse3 (<= 312 ~a23~0) (= ~a8~0 15)))))) [2022-07-13 12:42:47,453 INFO L899 garLoopResultBuilder]: For program point L846(lines 846 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,453 INFO L899 garLoopResultBuilder]: For program point L582(lines 582 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,453 INFO L899 garLoopResultBuilder]: For program point L186-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,453 INFO L899 garLoopResultBuilder]: For program point L120-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,453 INFO L899 garLoopResultBuilder]: For program point L54-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,453 INFO L899 garLoopResultBuilder]: For program point L979(lines 979 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,453 INFO L899 garLoopResultBuilder]: For program point L913(lines 913 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,453 INFO L899 garLoopResultBuilder]: For program point L517(lines 517 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,453 INFO L899 garLoopResultBuilder]: For program point L187(line 187) no Hoare annotation was computed. [2022-07-13 12:42:47,453 INFO L899 garLoopResultBuilder]: For program point L121(line 121) no Hoare annotation was computed. [2022-07-13 12:42:47,453 INFO L899 garLoopResultBuilder]: For program point L55(line 55) no Hoare annotation was computed. [2022-07-13 12:42:47,453 INFO L899 garLoopResultBuilder]: For program point L980(lines 980 990) no Hoare annotation was computed. [2022-07-13 12:42:47,453 INFO L899 garLoopResultBuilder]: For program point L914(lines 914 924) no Hoare annotation was computed. [2022-07-13 12:42:47,453 INFO L899 garLoopResultBuilder]: For program point L980-2(lines 980 990) no Hoare annotation was computed. [2022-07-13 12:42:47,453 INFO L899 garLoopResultBuilder]: For program point L914-2(lines 914 924) no Hoare annotation was computed. [2022-07-13 12:42:47,453 INFO L899 garLoopResultBuilder]: For program point L716(lines 716 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,453 INFO L899 garLoopResultBuilder]: For program point L320(lines 320 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,453 INFO L899 garLoopResultBuilder]: For program point L585(lines 585 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,453 INFO L899 garLoopResultBuilder]: For program point L453(lines 453 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,453 INFO L899 garLoopResultBuilder]: For program point L387(lines 387 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,453 INFO L899 garLoopResultBuilder]: For program point L189-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,453 INFO L899 garLoopResultBuilder]: For program point L123-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,453 INFO L899 garLoopResultBuilder]: For program point L57-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,453 INFO L899 garLoopResultBuilder]: For program point L784(lines 784 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,453 INFO L899 garLoopResultBuilder]: For program point L652(lines 652 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,453 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-13 12:42:47,454 INFO L899 garLoopResultBuilder]: For program point L190(line 190) no Hoare annotation was computed. [2022-07-13 12:42:47,454 INFO L899 garLoopResultBuilder]: For program point L124(line 124) no Hoare annotation was computed. [2022-07-13 12:42:47,454 INFO L899 garLoopResultBuilder]: For program point L58(line 58) no Hoare annotation was computed. [2022-07-13 12:42:47,454 INFO L899 garLoopResultBuilder]: For program point L1049(line 1049) no Hoare annotation was computed. [2022-07-13 12:42:47,454 INFO L899 garLoopResultBuilder]: For program point L851(lines 851 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,454 INFO L899 garLoopResultBuilder]: For program point L257(lines 257 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,454 INFO L899 garLoopResultBuilder]: For program point L192-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,454 INFO L899 garLoopResultBuilder]: For program point L126-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,454 INFO L899 garLoopResultBuilder]: For program point L60-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,454 INFO L899 garLoopResultBuilder]: For program point L193(line 193) no Hoare annotation was computed. [2022-07-13 12:42:47,454 INFO L899 garLoopResultBuilder]: For program point L127(line 127) no Hoare annotation was computed. [2022-07-13 12:42:47,455 INFO L899 garLoopResultBuilder]: For program point L61(line 61) no Hoare annotation was computed. [2022-07-13 12:42:47,455 INFO L899 garLoopResultBuilder]: For program point L722(lines 722 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,455 INFO L899 garLoopResultBuilder]: For program point L524(lines 524 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,455 INFO L899 garLoopResultBuilder]: For program point L657(lines 657 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,455 INFO L899 garLoopResultBuilder]: For program point L591(lines 591 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,455 INFO L899 garLoopResultBuilder]: For program point L525(lines 525 535) no Hoare annotation was computed. [2022-07-13 12:42:47,455 INFO L899 garLoopResultBuilder]: For program point L525-2(lines 525 535) no Hoare annotation was computed. [2022-07-13 12:42:47,455 INFO L899 garLoopResultBuilder]: For program point L327(lines 327 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,455 INFO L899 garLoopResultBuilder]: For program point L195-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,455 INFO L899 garLoopResultBuilder]: For program point L129-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,456 INFO L899 garLoopResultBuilder]: For program point L63-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,456 INFO L899 garLoopResultBuilder]: For program point L856(lines 856 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,456 INFO L899 garLoopResultBuilder]: For program point L790(lines 790 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,456 INFO L899 garLoopResultBuilder]: For program point L658(lines 658 667) no Hoare annotation was computed. [2022-07-13 12:42:47,456 INFO L899 garLoopResultBuilder]: For program point L658-2(lines 658 667) no Hoare annotation was computed. [2022-07-13 12:42:47,456 INFO L899 garLoopResultBuilder]: For program point L460(lines 460 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,456 INFO L899 garLoopResultBuilder]: For program point L394(lines 394 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,456 INFO L899 garLoopResultBuilder]: For program point L196(line 196) no Hoare annotation was computed. [2022-07-13 12:42:47,456 INFO L899 garLoopResultBuilder]: For program point L130(line 130) no Hoare annotation was computed. [2022-07-13 12:42:47,456 INFO L899 garLoopResultBuilder]: For program point L64(line 64) no Hoare annotation was computed. [2022-07-13 12:42:47,456 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-13 12:42:47,457 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 100) no Hoare annotation was computed. [2022-07-13 12:42:47,457 INFO L899 garLoopResultBuilder]: For program point L264(lines 264 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,457 INFO L899 garLoopResultBuilder]: For program point L198-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,457 INFO L899 garLoopResultBuilder]: For program point L132-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,457 INFO L899 garLoopResultBuilder]: For program point L66-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,457 INFO L899 garLoopResultBuilder]: For program point L991(lines 991 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,457 INFO L899 garLoopResultBuilder]: For program point L925(lines 925 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,457 INFO L899 garLoopResultBuilder]: For program point L727(lines 727 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,457 INFO L899 garLoopResultBuilder]: For program point L199(line 199) no Hoare annotation was computed. [2022-07-13 12:42:47,457 INFO L899 garLoopResultBuilder]: For program point L133(line 133) no Hoare annotation was computed. [2022-07-13 12:42:47,458 INFO L899 garLoopResultBuilder]: For program point L67(line 67) no Hoare annotation was computed. [2022-07-13 12:42:47,458 INFO L899 garLoopResultBuilder]: For program point L926(lines 926 936) no Hoare annotation was computed. [2022-07-13 12:42:47,458 INFO L899 garLoopResultBuilder]: For program point L926-2(lines 926 936) no Hoare annotation was computed. [2022-07-13 12:42:47,458 INFO L899 garLoopResultBuilder]: For program point L728(lines 728 740) no Hoare annotation was computed. [2022-07-13 12:42:47,458 INFO L899 garLoopResultBuilder]: For program point L728-2(lines 728 740) no Hoare annotation was computed. [2022-07-13 12:42:47,458 INFO L899 garLoopResultBuilder]: For program point L596(lines 596 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,458 INFO L899 garLoopResultBuilder]: For program point L332(lines 332 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,458 INFO L899 garLoopResultBuilder]: For program point L597(lines 597 607) no Hoare annotation was computed. [2022-07-13 12:42:47,458 INFO L899 garLoopResultBuilder]: For program point L597-2(lines 597 607) no Hoare annotation was computed. [2022-07-13 12:42:47,458 INFO L899 garLoopResultBuilder]: For program point L201-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,458 INFO L899 garLoopResultBuilder]: For program point L135-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,459 INFO L899 garLoopResultBuilder]: For program point L69-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,459 INFO L899 garLoopResultBuilder]: For program point L862(lines 862 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,459 INFO L899 garLoopResultBuilder]: For program point L466(lines 466 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,459 INFO L899 garLoopResultBuilder]: For program point L202(line 202) no Hoare annotation was computed. [2022-07-13 12:42:47,459 INFO L899 garLoopResultBuilder]: For program point L136(line 136) no Hoare annotation was computed. [2022-07-13 12:42:47,459 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2022-07-13 12:42:47,459 INFO L899 garLoopResultBuilder]: For program point L797(lines 797 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,459 INFO L899 garLoopResultBuilder]: For program point L401(lines 401 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,459 INFO L899 garLoopResultBuilder]: For program point L270(lines 270 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,460 INFO L899 garLoopResultBuilder]: For program point L204-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,460 INFO L899 garLoopResultBuilder]: For program point L138-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,460 INFO L899 garLoopResultBuilder]: For program point L72-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,460 INFO L899 garLoopResultBuilder]: For program point L205(line 205) no Hoare annotation was computed. [2022-07-13 12:42:47,460 INFO L899 garLoopResultBuilder]: For program point L139(line 139) no Hoare annotation was computed. [2022-07-13 12:42:47,460 INFO L899 garLoopResultBuilder]: For program point L73(line 73) no Hoare annotation was computed. [2022-07-13 12:42:47,460 INFO L899 garLoopResultBuilder]: For program point L998(lines 998 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,460 INFO L899 garLoopResultBuilder]: For program point L668(lines 668 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,460 INFO L899 garLoopResultBuilder]: For program point L536(lines 536 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,460 INFO L899 garLoopResultBuilder]: For program point L339(lines 339 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,460 INFO L899 garLoopResultBuilder]: For program point L207-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,461 INFO L899 garLoopResultBuilder]: For program point L141-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,461 INFO L899 garLoopResultBuilder]: For program point L75-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,461 INFO L899 garLoopResultBuilder]: For program point L802(lines 802 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,461 INFO L899 garLoopResultBuilder]: For program point L208(line 208) no Hoare annotation was computed. [2022-07-13 12:42:47,461 INFO L899 garLoopResultBuilder]: For program point L142(line 142) no Hoare annotation was computed. [2022-07-13 12:42:47,461 INFO L899 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2022-07-13 12:42:47,461 INFO L899 garLoopResultBuilder]: For program point L869(lines 869 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,461 INFO L899 garLoopResultBuilder]: For program point L473(lines 473 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,461 INFO L899 garLoopResultBuilder]: For program point L275(lines 275 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,461 INFO L899 garLoopResultBuilder]: For program point L408(lines 408 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,462 INFO L899 garLoopResultBuilder]: For program point L210-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,462 INFO L899 garLoopResultBuilder]: For program point L144-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,462 INFO L899 garLoopResultBuilder]: For program point L78-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,462 INFO L899 garLoopResultBuilder]: For program point L1003(lines 1003 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,462 INFO L899 garLoopResultBuilder]: For program point L937(lines 937 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,462 INFO L899 garLoopResultBuilder]: For program point L673(lines 673 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,462 INFO L899 garLoopResultBuilder]: For program point L541(lines 541 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,462 INFO L899 garLoopResultBuilder]: For program point L409(lines 409 420) no Hoare annotation was computed. [2022-07-13 12:42:47,462 INFO L899 garLoopResultBuilder]: For program point L409-2(lines 409 420) no Hoare annotation was computed. [2022-07-13 12:42:47,462 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-07-13 12:42:47,462 INFO L899 garLoopResultBuilder]: For program point L145(line 145) no Hoare annotation was computed. [2022-07-13 12:42:47,463 INFO L899 garLoopResultBuilder]: For program point L79(line 79) no Hoare annotation was computed. [2022-07-13 12:42:47,463 INFO L899 garLoopResultBuilder]: For program point L608(lines 608 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,463 INFO L899 garLoopResultBuilder]: For program point L344(lines 344 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,463 INFO L899 garLoopResultBuilder]: For program point L278(lines 278 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,463 INFO L899 garLoopResultBuilder]: For program point L741(lines 741 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,463 INFO L899 garLoopResultBuilder]: For program point L213-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,463 INFO L899 garLoopResultBuilder]: For program point L147-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,463 INFO L899 garLoopResultBuilder]: For program point L81-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,463 INFO L899 garLoopResultBuilder]: For program point L214(line 214) no Hoare annotation was computed. [2022-07-13 12:42:47,463 INFO L899 garLoopResultBuilder]: For program point L148(line 148) no Hoare annotation was computed. [2022-07-13 12:42:47,463 INFO L899 garLoopResultBuilder]: For program point L82(line 82) no Hoare annotation was computed. [2022-07-13 12:42:47,464 INFO L899 garLoopResultBuilder]: For program point L875(lines 875 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,464 INFO L899 garLoopResultBuilder]: For program point L809(lines 809 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,464 INFO L899 garLoopResultBuilder]: For program point L942(lines 942 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,464 INFO L899 garLoopResultBuilder]: For program point L876(lines 876 885) no Hoare annotation was computed. [2022-07-13 12:42:47,464 INFO L899 garLoopResultBuilder]: For program point L876-2(lines 876 885) no Hoare annotation was computed. [2022-07-13 12:42:47,464 INFO L899 garLoopResultBuilder]: For program point L480(lines 480 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,464 INFO L899 garLoopResultBuilder]: For program point L150-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,464 INFO L899 garLoopResultBuilder]: For program point L84-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,464 INFO L899 garLoopResultBuilder]: For program point L613(lines 613 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,464 INFO L899 garLoopResultBuilder]: For program point L547(lines 547 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,464 INFO L899 garLoopResultBuilder]: For program point L151(line 151) no Hoare annotation was computed. [2022-07-13 12:42:47,465 INFO L899 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2022-07-13 12:42:47,465 INFO L899 garLoopResultBuilder]: For program point L1010(lines 1010 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,465 INFO L899 garLoopResultBuilder]: For program point L680(lines 680 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,465 INFO L899 garLoopResultBuilder]: For program point L614(lines 614 624) no Hoare annotation was computed. [2022-07-13 12:42:47,465 INFO L899 garLoopResultBuilder]: For program point L614-2(lines 614 624) no Hoare annotation was computed. [2022-07-13 12:42:47,465 INFO L899 garLoopResultBuilder]: For program point L350(lines 350 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,465 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-13 12:42:47,465 INFO L899 garLoopResultBuilder]: For program point L285(lines 285 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,465 INFO L899 garLoopResultBuilder]: For program point L153-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,465 INFO L899 garLoopResultBuilder]: For program point L87-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,466 INFO L899 garLoopResultBuilder]: For program point L814(lines 814 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,466 INFO L899 garLoopResultBuilder]: For program point L748(lines 748 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,466 INFO L899 garLoopResultBuilder]: For program point L154(line 154) no Hoare annotation was computed. [2022-07-13 12:42:47,466 INFO L899 garLoopResultBuilder]: For program point L88(line 88) no Hoare annotation was computed. [2022-07-13 12:42:47,466 INFO L899 garLoopResultBuilder]: For program point L815(lines 815 825) no Hoare annotation was computed. [2022-07-13 12:42:47,466 INFO L899 garLoopResultBuilder]: For program point L815-2(lines 815 825) no Hoare annotation was computed. [2022-07-13 12:42:47,466 INFO L899 garLoopResultBuilder]: For program point L552(lines 552 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,466 INFO L899 garLoopResultBuilder]: For program point L156-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,466 INFO L899 garLoopResultBuilder]: For program point L90-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,466 INFO L899 garLoopResultBuilder]: For program point L1015(lines 1015 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,466 INFO L899 garLoopResultBuilder]: For program point L949(lines 949 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,467 INFO L899 garLoopResultBuilder]: For program point L685(lines 685 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,467 INFO L899 garLoopResultBuilder]: For program point L487(lines 487 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,467 INFO L899 garLoopResultBuilder]: For program point L421(lines 421 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,467 INFO L899 garLoopResultBuilder]: For program point L157(line 157) no Hoare annotation was computed. [2022-07-13 12:42:47,467 INFO L899 garLoopResultBuilder]: For program point L91(line 91) no Hoare annotation was computed. [2022-07-13 12:42:47,467 INFO L899 garLoopResultBuilder]: For program point L950(lines 950 962) no Hoare annotation was computed. [2022-07-13 12:42:47,467 INFO L899 garLoopResultBuilder]: For program point L950-2(lines 950 962) no Hoare annotation was computed. [2022-07-13 12:42:47,467 INFO L899 garLoopResultBuilder]: For program point L488(lines 488 496) no Hoare annotation was computed. [2022-07-13 12:42:47,467 INFO L899 garLoopResultBuilder]: For program point L488-2(lines 488 496) no Hoare annotation was computed. [2022-07-13 12:42:47,467 INFO L899 garLoopResultBuilder]: For program point L356(lines 356 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,468 INFO L899 garLoopResultBuilder]: For program point L290(lines 290 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,468 INFO L899 garLoopResultBuilder]: For program point L224(lines 224 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,468 INFO L899 garLoopResultBuilder]: For program point L753(lines 753 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,468 INFO L899 garLoopResultBuilder]: For program point L159-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,468 INFO L899 garLoopResultBuilder]: For program point L93-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,468 INFO L899 garLoopResultBuilder]: For program point L886(lines 886 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,468 INFO L899 garLoopResultBuilder]: For program point L160(line 160) no Hoare annotation was computed. [2022-07-13 12:42:47,468 INFO L899 garLoopResultBuilder]: For program point L94(line 94) no Hoare annotation was computed. [2022-07-13 12:42:47,468 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-13 12:42:47,468 INFO L899 garLoopResultBuilder]: For program point L162-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,469 INFO L899 garLoopResultBuilder]: For program point L96-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,469 INFO L899 garLoopResultBuilder]: For program point L691(lines 691 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,469 INFO L899 garLoopResultBuilder]: For program point L625(lines 625 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,469 INFO L899 garLoopResultBuilder]: For program point L559(lines 559 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,469 INFO L899 garLoopResultBuilder]: For program point L427(lines 427 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,469 INFO L899 garLoopResultBuilder]: For program point L163(line 163) no Hoare annotation was computed. [2022-07-13 12:42:47,469 INFO L899 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2022-07-13 12:42:47,469 INFO L899 garLoopResultBuilder]: For program point L1022(lines 1022 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,469 INFO L899 garLoopResultBuilder]: For program point L891(lines 891 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,469 INFO L899 garLoopResultBuilder]: For program point L363(lines 363 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,469 INFO L899 garLoopResultBuilder]: For program point L297(lines 297 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,470 INFO L899 garLoopResultBuilder]: For program point L231(lines 231 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,470 INFO L899 garLoopResultBuilder]: For program point L165-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,470 INFO L899 garLoopResultBuilder]: For program point L99-1(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,470 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 35) no Hoare annotation was computed. [2022-07-13 12:42:47,470 INFO L899 garLoopResultBuilder]: For program point L33-2(lines 32 1036) no Hoare annotation was computed. [2022-07-13 12:42:47,470 INFO L899 garLoopResultBuilder]: For program point L826(lines 826 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,470 INFO L899 garLoopResultBuilder]: For program point L760(lines 760 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,470 INFO L899 garLoopResultBuilder]: For program point L166(line 166) no Hoare annotation was computed. [2022-07-13 12:42:47,470 INFO L899 garLoopResultBuilder]: For program point L100(line 100) no Hoare annotation was computed. [2022-07-13 12:42:47,470 INFO L899 garLoopResultBuilder]: For program point L34(line 34) no Hoare annotation was computed. [2022-07-13 12:42:47,470 INFO L899 garLoopResultBuilder]: For program point L497(lines 497 1034) no Hoare annotation was computed. [2022-07-13 12:42:47,473 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 12:42:47,474 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 12:42:47,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 12:42:47 BoogieIcfgContainer [2022-07-13 12:42:47,493 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 12:42:47,494 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 12:42:47,494 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 12:42:47,494 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 12:42:47,494 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 12:41:52" (3/4) ... [2022-07-13 12:42:47,496 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-13 12:42:47,512 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-07-13 12:42:47,513 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-13 12:42:47,513 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-13 12:42:47,514 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-13 12:42:47,579 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 12:42:47,579 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 12:42:47,580 INFO L158 Benchmark]: Toolchain (without parser) took 56756.80ms. Allocated memory was 96.5MB in the beginning and 1.0GB in the end (delta: 920.6MB). Free memory was 62.7MB in the beginning and 808.8MB in the end (delta: -746.1MB). Peak memory consumption was 174.2MB. Max. memory is 16.1GB. [2022-07-13 12:42:47,580 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory was 53.5MB in the beginning and 53.4MB in the end (delta: 42.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 12:42:47,580 INFO L158 Benchmark]: CACSL2BoogieTranslator took 430.69ms. Allocated memory is still 96.5MB. Free memory was 62.5MB in the beginning and 40.0MB in the end (delta: 22.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-07-13 12:42:47,580 INFO L158 Benchmark]: Boogie Procedure Inliner took 137.19ms. Allocated memory was 96.5MB in the beginning and 123.7MB in the end (delta: 27.3MB). Free memory was 40.0MB in the beginning and 83.9MB in the end (delta: -43.9MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. [2022-07-13 12:42:47,580 INFO L158 Benchmark]: Boogie Preprocessor took 105.68ms. Allocated memory is still 123.7MB. Free memory was 83.9MB in the beginning and 74.1MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 12:42:47,581 INFO L158 Benchmark]: RCFGBuilder took 1230.91ms. Allocated memory is still 123.7MB. Free memory was 74.1MB in the beginning and 80.8MB in the end (delta: -6.6MB). Peak memory consumption was 45.2MB. Max. memory is 16.1GB. [2022-07-13 12:42:47,581 INFO L158 Benchmark]: TraceAbstraction took 54760.41ms. Allocated memory was 123.7MB in the beginning and 1.0GB in the end (delta: 893.4MB). Free memory was 80.0MB in the beginning and 824.2MB in the end (delta: -744.3MB). Peak memory consumption was 742.6MB. Max. memory is 16.1GB. [2022-07-13 12:42:47,581 INFO L158 Benchmark]: Witness Printer took 85.75ms. Allocated memory is still 1.0GB. Free memory was 824.2MB in the beginning and 808.8MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-13 12:42:47,582 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 96.5MB. Free memory was 53.5MB in the beginning and 53.4MB in the end (delta: 42.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 430.69ms. Allocated memory is still 96.5MB. Free memory was 62.5MB in the beginning and 40.0MB in the end (delta: 22.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 137.19ms. Allocated memory was 96.5MB in the beginning and 123.7MB in the end (delta: 27.3MB). Free memory was 40.0MB in the beginning and 83.9MB in the end (delta: -43.9MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 105.68ms. Allocated memory is still 123.7MB. Free memory was 83.9MB in the beginning and 74.1MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1230.91ms. Allocated memory is still 123.7MB. Free memory was 74.1MB in the beginning and 80.8MB in the end (delta: -6.6MB). Peak memory consumption was 45.2MB. Max. memory is 16.1GB. * TraceAbstraction took 54760.41ms. Allocated memory was 123.7MB in the beginning and 1.0GB in the end (delta: 893.4MB). Free memory was 80.0MB in the beginning and 824.2MB in the end (delta: -744.3MB). Peak memory consumption was 742.6MB. Max. memory is 16.1GB. * Witness Printer took 85.75ms. Allocated memory is still 1.0GB. Free memory was 824.2MB in the beginning and 808.8MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 100]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 54.7s, OverallIterations: 24, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 20.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 24.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5258 SdHoareTripleChecker+Valid, 17.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5258 mSDsluCounter, 4945 SdHoareTripleChecker+Invalid, 13.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 794 mSDsCounter, 3346 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20840 IncrementalHoareTripleChecker+Invalid, 24186 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3346 mSolverCounterUnsat, 4151 mSDtfsCounter, 20840 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 924 GetRequests, 850 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17910occurred in iteration=23, InterpolantAutomatonStates: 115, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.7s AutomataMinimizationTime, 24 MinimizatonAttempts, 24079 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 267 NumberOfFragments, 915 HoareAnnotationTreeSize, 3 FomulaSimplifications, 16980 FormulaSimplificationTreeSizeReduction, 16.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 237186 FormulaSimplificationTreeSizeReductionInter, 8.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 9348 NumberOfCodeBlocks, 9348 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 9730 ConstructedInterpolants, 0 QuantifiedInterpolants, 34800 SizeOfPredicates, 1 NumberOfNonLiveVariables, 556 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 26 InterpolantComputations, 23 PerfectInterpolantSequences, 12176/12426 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((a25 == 13 && a23 <= 278) && 99912 <= a29) && 0 < a23 + 43) && a4 == 1) || ((((a4 == 0 && a25 == 11) && a29 <= 245) && a23 <= 138) && 119992 + a23 <= 0)) || (((a25 == 13 && a4 == 0) && a29 + 22 <= 0) && a23 <= 138)) || ((((a23 + 43 <= 0 && 261 <= a29) && a4 == 0) && a25 <= 10) && a29 <= 599998)) || (((a4 == 0 && a29 + 22 <= 0) && a25 <= 10) && a23 <= 138)) || (((0 < a23 + 43 && a25 <= 10) && a4 == 1) && 130 <= a29)) || ((a25 <= 10 && a4 == 1) && a25 == 10)) || (((a25 == 13 && 307 <= a23) && a29 <= 599998) && a4 == 1)) || (((a25 == 11 && 0 < a23 + 43) && a4 == 1) && a23 <= 312)) || (((a25 == 12 && a4 == 1) && ((!(306 < a23) || !(a25 == 12)) || !(277 < a29))) && 130 <= a29)) || ((((a23 <= 278 && a29 + 22 <= 0) && 0 < a23 + 43) && a29 <= 245) && a4 == 1)) || ((((a29 <= 245 && a23 <= 138) && ((!(a23 + 43 <= 0) || !(a25 == 9)) || !(a29 <= 140))) && a4 == 1) && 130 <= a29)) || (((a4 == 0 && a29 + 22 <= 0) && 0 <= a29 + 28553) && a25 == 10)) || ((((a4 == 0 && a25 == 11) && a29 + 22 <= 0) && a29 <= 245) && a23 <= 138)) || ((((261 <= a29 && a4 == 0) && a25 == 11) && a29 <= 599998) && 119992 + a23 <= 0)) || (((a4 == 0 && a25 <= 10) && a29 <= 599998) && 99915 <= a29)) || ((a25 == 11 && a4 == 1) && 130 <= a29)) || (((a4 == 0 && 0 < a23 + 43) && a29 <= 274) && a23 <= 138)) || ((((a25 == 12 && a4 == 0) && a29 <= 599998) && ((!(306 < a23) || !(a25 == 12)) || !(277 < a29))) && 130 <= a29)) || (((a25 <= 10 && a23 <= 138) && ((!(a23 + 43 <= 0) || !(a25 == 9)) || !(a29 <= 140))) && a4 == 1)) || ((a25 == 12 && a4 == 0) && a29 + 22 <= 0)) || ((a23 <= 278 && a25 == 12) && a4 == 1)) || (((a4 == 1 && ((!(306 < a23) || !(a25 == 12)) || !(277 < a29))) && 99915 <= a29) && (!(a25 == 13) || a23 <= 306))) || (((a25 == 13 && 0 < a23 + 43) && a29 <= 245) && a4 == 1)) || ((((a25 == 13 && a4 == 0) && a29 <= 274) && a23 <= 138) && 130 <= a29)) || ((((((!(input == 1) && a25 == 12) && a29 + 22 <= 0) && a3 == 1) && a4 == 1) && 312 <= a23) && a8 == 15) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((a25 == 13 && a23 <= 278) && 99912 <= a29) && 0 < a23 + 43) && a4 == 1) || ((((a4 == 0 && a25 == 11) && a29 <= 245) && a23 <= 138) && 119992 + a23 <= 0)) || (((a25 == 13 && a4 == 0) && a29 + 22 <= 0) && a23 <= 138)) || ((((a23 + 43 <= 0 && 261 <= a29) && a4 == 0) && a25 <= 10) && a29 <= 599998)) || (((a4 == 0 && a29 + 22 <= 0) && a25 <= 10) && a23 <= 138)) || (((0 < a23 + 43 && a25 <= 10) && a4 == 1) && 130 <= a29)) || ((a25 <= 10 && a4 == 1) && a25 == 10)) || (((a25 == 13 && 307 <= a23) && a29 <= 599998) && a4 == 1)) || (((a25 == 11 && 0 < a23 + 43) && a4 == 1) && a23 <= 312)) || (((a25 == 12 && a4 == 1) && ((!(306 < a23) || !(a25 == 12)) || !(277 < a29))) && 130 <= a29)) || ((((a23 <= 278 && a29 + 22 <= 0) && 0 < a23 + 43) && a29 <= 245) && a4 == 1)) || ((((a29 <= 245 && a23 <= 138) && ((!(a23 + 43 <= 0) || !(a25 == 9)) || !(a29 <= 140))) && a4 == 1) && 130 <= a29)) || (((a4 == 0 && a29 + 22 <= 0) && 0 <= a29 + 28553) && a25 == 10)) || ((((a4 == 0 && a25 == 11) && a29 + 22 <= 0) && a29 <= 245) && a23 <= 138)) || ((((261 <= a29 && a4 == 0) && a25 == 11) && a29 <= 599998) && 119992 + a23 <= 0)) || (((a4 == 0 && a25 <= 10) && a29 <= 599998) && 99915 <= a29)) || ((a25 == 11 && a4 == 1) && 130 <= a29)) || (((a4 == 0 && 0 < a23 + 43) && a29 <= 274) && a23 <= 138)) || ((((a25 == 12 && a4 == 0) && a29 <= 599998) && ((!(306 < a23) || !(a25 == 12)) || !(277 < a29))) && 130 <= a29)) || (((a25 <= 10 && a23 <= 138) && ((!(a23 + 43 <= 0) || !(a25 == 9)) || !(a29 <= 140))) && a4 == 1)) || ((a25 == 12 && a4 == 0) && a29 + 22 <= 0)) || ((a23 <= 278 && a25 == 12) && a4 == 1)) || (((a4 == 1 && ((!(306 < a23) || !(a25 == 12)) || !(277 < a29))) && 99915 <= a29) && (!(a25 == 13) || a23 <= 306))) || (((a25 == 13 && 0 < a23 + 43) && a29 <= 245) && a4 == 1)) || ((((a25 == 13 && a4 == 0) && a29 <= 274) && a23 <= 138) && 130 <= a29)) || ((((((!(input == 1) && a25 == 12) && a29 + 22 <= 0) && a3 == 1) && a4 == 1) && 312 <= a23) && a8 == 15) - InvariantResult [Line: 1038]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-07-13 12:42:47,624 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