./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 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/Problem15_label11.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 b0d31ac0a4760541f0d40c4e2a162c7e746a87cea96b874d39053630478d669b --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 12:27:09,850 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 12:27:09,852 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 12:27:09,877 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 12:27:09,877 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 12:27:09,878 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 12:27:09,879 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 12:27:09,881 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 12:27:09,883 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 12:27:09,887 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 12:27:09,888 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 12:27:09,891 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 12:27:09,891 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 12:27:09,894 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 12:27:09,895 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 12:27:09,897 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 12:27:09,898 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 12:27:09,899 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 12:27:09,903 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 12:27:09,908 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 12:27:09,909 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 12:27:09,910 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 12:27:09,911 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 12:27:09,912 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 12:27:09,912 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 12:27:09,915 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 12:27:09,915 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 12:27:09,915 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 12:27:09,916 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 12:27:09,916 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 12:27:09,917 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 12:27:09,917 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 12:27:09,918 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 12:27:09,919 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 12:27:09,919 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 12:27:09,920 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 12:27:09,920 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 12:27:09,921 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 12:27:09,921 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 12:27:09,921 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 12:27:09,922 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 12:27:09,924 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 12:27:09,924 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 12:27:09,959 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 12:27:09,960 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 12:27:09,961 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 12:27:09,961 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 12:27:09,961 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 12:27:09,962 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 12:27:09,962 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 12:27:09,962 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 12:27:09,962 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 12:27:09,963 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 12:27:09,964 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 12:27:09,964 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 12:27:09,964 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 12:27:09,964 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 12:27:09,964 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 12:27:09,965 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 12:27:09,965 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 12:27:09,965 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 12:27:09,965 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 12:27:09,965 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 12:27:09,966 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 12:27:09,966 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 12:27:09,966 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 12:27:09,966 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 12:27:09,967 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 12:27:09,967 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 12:27:09,967 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 12:27:09,967 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 12:27:09,968 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 12:27:09,968 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 12:27:09,968 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 12:27:09,968 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 12:27:09,968 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 12:27:09,969 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 -> b0d31ac0a4760541f0d40c4e2a162c7e746a87cea96b874d39053630478d669b [2022-07-19 12:27:10,182 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 12:27:10,211 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 12:27:10,213 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 12:27:10,214 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 12:27:10,215 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 12:27:10,216 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label11.c [2022-07-19 12:27:10,270 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5706e1d93/256f7d70c87b4dfaa5ee1aa121bef106/FLAG844cf75fd [2022-07-19 12:27:10,827 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 12:27:10,828 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label11.c [2022-07-19 12:27:10,846 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5706e1d93/256f7d70c87b4dfaa5ee1aa121bef106/FLAG844cf75fd [2022-07-19 12:27:11,076 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5706e1d93/256f7d70c87b4dfaa5ee1aa121bef106 [2022-07-19 12:27:11,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 12:27:11,080 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 12:27:11,081 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 12:27:11,081 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 12:27:11,084 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 12:27:11,085 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 12:27:11" (1/1) ... [2022-07-19 12:27:11,086 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8ea5a5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 12:27:11, skipping insertion in model container [2022-07-19 12:27:11,086 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 12:27:11" (1/1) ... [2022-07-19 12:27:11,092 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 12:27:11,155 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 12:27:11,430 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/Problem15_label11.c[6732,6745] [2022-07-19 12:27:11,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 12:27:11,765 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 12:27:11,790 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/Problem15_label11.c[6732,6745] [2022-07-19 12:27:11,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 12:27:11,944 INFO L208 MainTranslator]: Completed translation [2022-07-19 12:27:11,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 12:27:11 WrapperNode [2022-07-19 12:27:11,946 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 12:27:11,947 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 12:27:11,947 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 12:27:11,947 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 12:27:11,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 12:27:11" (1/1) ... [2022-07-19 12:27:11,997 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 12:27:11" (1/1) ... [2022-07-19 12:27:12,144 INFO L137 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1758 [2022-07-19 12:27:12,145 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 12:27:12,147 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 12:27:12,147 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 12:27:12,147 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 12:27:12,154 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 12:27:11" (1/1) ... [2022-07-19 12:27:12,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 12:27:11" (1/1) ... [2022-07-19 12:27:12,207 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 12:27:11" (1/1) ... [2022-07-19 12:27:12,209 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 12:27:11" (1/1) ... [2022-07-19 12:27:12,300 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 12:27:11" (1/1) ... [2022-07-19 12:27:12,323 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 12:27:11" (1/1) ... [2022-07-19 12:27:12,352 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 12:27:11" (1/1) ... [2022-07-19 12:27:12,391 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 12:27:12,392 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 12:27:12,393 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 12:27:12,393 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 12:27:12,394 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 12:27:11" (1/1) ... [2022-07-19 12:27:12,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 12:27:12,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 12:27:12,429 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-19 12:27:12,444 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-19 12:27:12,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 12:27:12,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 12:27:12,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 12:27:12,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 12:27:12,531 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 12:27:12,532 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 12:27:14,875 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 12:27:14,892 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 12:27:14,892 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-19 12:27:14,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 12:27:14 BoogieIcfgContainer [2022-07-19 12:27:14,896 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 12:27:14,898 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 12:27:14,898 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 12:27:14,901 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 12:27:14,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 12:27:11" (1/3) ... [2022-07-19 12:27:14,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e715418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 12:27:14, skipping insertion in model container [2022-07-19 12:27:14,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 12:27:11" (2/3) ... [2022-07-19 12:27:14,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e715418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 12:27:14, skipping insertion in model container [2022-07-19 12:27:14,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 12:27:14" (3/3) ... [2022-07-19 12:27:14,904 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem15_label11.c [2022-07-19 12:27:14,918 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 12:27:14,919 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 12:27:14,983 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 12:27:14,990 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@2455c7ca, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@b74a526 [2022-07-19 12:27:14,990 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 12:27:14,996 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 422 states have (on average 1.7772511848341233) internal successors, (750), 423 states have internal predecessors, (750), 0 states have call successors, (0), 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-19 12:27:15,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-19 12:27:15,005 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 12:27:15,006 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 12:27:15,006 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 12:27:15,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 12:27:15,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1246856209, now seen corresponding path program 1 times [2022-07-19 12:27:15,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 12:27:15,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804957712] [2022-07-19 12:27:15,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 12:27:15,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 12:27:15,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 12:27:15,262 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-19 12:27:15,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 12:27:15,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804957712] [2022-07-19 12:27:15,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804957712] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 12:27:15,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 12:27:15,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 12:27:15,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104205629] [2022-07-19 12:27:15,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 12:27:15,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 12:27:15,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 12:27:15,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 12:27:15,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 12:27:15,328 INFO L87 Difference]: Start difference. First operand has 424 states, 422 states have (on average 1.7772511848341233) internal successors, (750), 423 states have internal predecessors, (750), 0 states have call successors, (0), 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 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 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-19 12:27:17,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 12:27:17,500 INFO L93 Difference]: Finished difference Result 1197 states and 2163 transitions. [2022-07-19 12:27:17,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 12:27:17,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2022-07-19 12:27:17,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 12:27:17,516 INFO L225 Difference]: With dead ends: 1197 [2022-07-19 12:27:17,516 INFO L226 Difference]: Without dead ends: 694 [2022-07-19 12:27:17,520 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-19 12:27:17,523 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 363 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 304 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 304 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-19 12:27:17,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 114 Invalid, 1394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [304 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-19 12:27:17,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2022-07-19 12:27:17,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 684. [2022-07-19 12:27:17,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 683 states have (on average 1.718887262079063) internal successors, (1174), 683 states have internal predecessors, (1174), 0 states have call successors, (0), 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-19 12:27:17,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1174 transitions. [2022-07-19 12:27:17,612 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1174 transitions. Word has length 55 [2022-07-19 12:27:17,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 12:27:17,613 INFO L495 AbstractCegarLoop]: Abstraction has 684 states and 1174 transitions. [2022-07-19 12:27:17,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 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-19 12:27:17,613 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1174 transitions. [2022-07-19 12:27:17,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-19 12:27:17,622 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 12:27:17,622 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, 2, 2, 2, 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-19 12:27:17,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 12:27:17,623 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 12:27:17,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 12:27:17,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1666804951, now seen corresponding path program 1 times [2022-07-19 12:27:17,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 12:27:17,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118917033] [2022-07-19 12:27:17,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 12:27:17,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 12:27:17,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 12:27:17,774 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 12:27:17,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 12:27:17,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118917033] [2022-07-19 12:27:17,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118917033] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 12:27:17,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 12:27:17,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 12:27:17,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313558655] [2022-07-19 12:27:17,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 12:27:17,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 12:27:17,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 12:27:17,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 12:27:17,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 12:27:17,783 INFO L87 Difference]: Start difference. First operand 684 states and 1174 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 12:27:19,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 12:27:19,399 INFO L93 Difference]: Finished difference Result 1681 states and 2896 transitions. [2022-07-19 12:27:19,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 12:27:19,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2022-07-19 12:27:19,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 12:27:19,404 INFO L225 Difference]: With dead ends: 1681 [2022-07-19 12:27:19,405 INFO L226 Difference]: Without dead ends: 999 [2022-07-19 12:27:19,407 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-19 12:27:19,408 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 254 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-19 12:27:19,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 226 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1022 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-19 12:27:19,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2022-07-19 12:27:19,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 989. [2022-07-19 12:27:19,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 988 states have (on average 1.6194331983805668) internal successors, (1600), 988 states have internal predecessors, (1600), 0 states have call successors, (0), 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-19 12:27:19,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1600 transitions. [2022-07-19 12:27:19,433 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1600 transitions. Word has length 120 [2022-07-19 12:27:19,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 12:27:19,434 INFO L495 AbstractCegarLoop]: Abstraction has 989 states and 1600 transitions. [2022-07-19 12:27:19,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 12:27:19,434 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1600 transitions. [2022-07-19 12:27:19,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-19 12:27:19,436 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 12:27:19,437 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, 2, 2, 2, 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] [2022-07-19 12:27:19,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 12:27:19,437 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 12:27:19,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 12:27:19,438 INFO L85 PathProgramCache]: Analyzing trace with hash -2119716484, now seen corresponding path program 1 times [2022-07-19 12:27:19,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 12:27:19,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728588800] [2022-07-19 12:27:19,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 12:27:19,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 12:27:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 12:27:19,576 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 12:27:19,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 12:27:19,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728588800] [2022-07-19 12:27:19,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728588800] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 12:27:19,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 12:27:19,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 12:27:19,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89239733] [2022-07-19 12:27:19,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 12:27:19,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 12:27:19,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 12:27:19,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 12:27:19,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 12:27:19,580 INFO L87 Difference]: Start difference. First operand 989 states and 1600 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 12:27:20,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 12:27:20,984 INFO L93 Difference]: Finished difference Result 2575 states and 4255 transitions. [2022-07-19 12:27:20,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 12:27:20,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2022-07-19 12:27:20,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 12:27:20,993 INFO L225 Difference]: With dead ends: 2575 [2022-07-19 12:27:20,993 INFO L226 Difference]: Without dead ends: 1588 [2022-07-19 12:27:20,996 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-19 12:27:21,002 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 284 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-19 12:27:21,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 337 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-19 12:27:21,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1588 states. [2022-07-19 12:27:21,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1588 to 1584. [2022-07-19 12:27:21,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1584 states, 1583 states have (on average 1.3986102337334176) internal successors, (2214), 1583 states have internal predecessors, (2214), 0 states have call successors, (0), 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-19 12:27:21,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2214 transitions. [2022-07-19 12:27:21,037 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2214 transitions. Word has length 121 [2022-07-19 12:27:21,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 12:27:21,037 INFO L495 AbstractCegarLoop]: Abstraction has 1584 states and 2214 transitions. [2022-07-19 12:27:21,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 12:27:21,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2214 transitions. [2022-07-19 12:27:21,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-07-19 12:27:21,040 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 12:27:21,040 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, 2, 2, 2, 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] [2022-07-19 12:27:21,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 12:27:21,041 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 12:27:21,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 12:27:21,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1178280902, now seen corresponding path program 1 times [2022-07-19 12:27:21,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 12:27:21,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957290328] [2022-07-19 12:27:21,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 12:27:21,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 12:27:21,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 12:27:21,175 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 12:27:21,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 12:27:21,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957290328] [2022-07-19 12:27:21,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957290328] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 12:27:21,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 12:27:21,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 12:27:21,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709979306] [2022-07-19 12:27:21,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 12:27:21,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 12:27:21,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 12:27:21,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 12:27:21,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 12:27:21,178 INFO L87 Difference]: Start difference. First operand 1584 states and 2214 transitions. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 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-19 12:27:23,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 12:27:23,210 INFO L93 Difference]: Finished difference Result 4090 states and 5888 transitions. [2022-07-19 12:27:23,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 12:27:23,211 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2022-07-19 12:27:23,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 12:27:23,221 INFO L225 Difference]: With dead ends: 4090 [2022-07-19 12:27:23,221 INFO L226 Difference]: Without dead ends: 2807 [2022-07-19 12:27:23,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 12:27:23,233 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 349 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 1709 mSolverCounterSat, 454 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 2163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 454 IncrementalHoareTripleChecker+Valid, 1709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-19 12:27:23,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 416 Invalid, 2163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [454 Valid, 1709 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-19 12:27:23,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2807 states. [2022-07-19 12:27:23,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2807 to 2184. [2022-07-19 12:27:23,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2184 states, 2183 states have (on average 1.3302794319743472) internal successors, (2904), 2183 states have internal predecessors, (2904), 0 states have call successors, (0), 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-19 12:27:23,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2184 states to 2184 states and 2904 transitions. [2022-07-19 12:27:23,280 INFO L78 Accepts]: Start accepts. Automaton has 2184 states and 2904 transitions. Word has length 125 [2022-07-19 12:27:23,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 12:27:23,282 INFO L495 AbstractCegarLoop]: Abstraction has 2184 states and 2904 transitions. [2022-07-19 12:27:23,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 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-19 12:27:23,282 INFO L276 IsEmpty]: Start isEmpty. Operand 2184 states and 2904 transitions. [2022-07-19 12:27:23,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2022-07-19 12:27:23,287 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 12:27:23,287 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, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 12:27:23,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 12:27:23,288 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 12:27:23,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 12:27:23,288 INFO L85 PathProgramCache]: Analyzing trace with hash -2088752626, now seen corresponding path program 1 times [2022-07-19 12:27:23,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 12:27:23,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57659372] [2022-07-19 12:27:23,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 12:27:23,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 12:27:23,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 12:27:23,557 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-07-19 12:27:23,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 12:27:23,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57659372] [2022-07-19 12:27:23,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57659372] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 12:27:23,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 12:27:23,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 12:27:23,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108293987] [2022-07-19 12:27:23,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 12:27:23,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 12:27:23,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 12:27:23,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 12:27:23,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 12:27:23,561 INFO L87 Difference]: Start difference. First operand 2184 states and 2904 transitions. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 0 states have call successors, (0), 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-19 12:27:25,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 12:27:25,150 INFO L93 Difference]: Finished difference Result 5868 states and 7890 transitions. [2022-07-19 12:27:25,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 12:27:25,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 0 states have call successors, (0), 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 325 [2022-07-19 12:27:25,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 12:27:25,167 INFO L225 Difference]: With dead ends: 5868 [2022-07-19 12:27:25,167 INFO L226 Difference]: Without dead ends: 3686 [2022-07-19 12:27:25,171 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-19 12:27:25,171 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 43 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-19 12:27:25,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 317 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-19 12:27:25,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3686 states. [2022-07-19 12:27:25,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3686 to 3684. [2022-07-19 12:27:25,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3684 states, 3683 states have (on average 1.25821341297855) internal successors, (4634), 3683 states have internal predecessors, (4634), 0 states have call successors, (0), 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-19 12:27:25,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3684 states to 3684 states and 4634 transitions. [2022-07-19 12:27:25,238 INFO L78 Accepts]: Start accepts. Automaton has 3684 states and 4634 transitions. Word has length 325 [2022-07-19 12:27:25,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 12:27:25,240 INFO L495 AbstractCegarLoop]: Abstraction has 3684 states and 4634 transitions. [2022-07-19 12:27:25,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 0 states have call successors, (0), 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-19 12:27:25,244 INFO L276 IsEmpty]: Start isEmpty. Operand 3684 states and 4634 transitions. [2022-07-19 12:27:25,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2022-07-19 12:27:25,249 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 12:27:25,249 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, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 12:27:25,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 12:27:25,251 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 12:27:25,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 12:27:25,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1998947477, now seen corresponding path program 1 times [2022-07-19 12:27:25,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 12:27:25,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127774243] [2022-07-19 12:27:25,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 12:27:25,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 12:27:25,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 12:27:25,464 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-19 12:27:25,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 12:27:25,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127774243] [2022-07-19 12:27:25,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127774243] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 12:27:25,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 12:27:25,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 12:27:25,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016975754] [2022-07-19 12:27:25,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 12:27:25,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 12:27:25,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 12:27:25,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 12:27:25,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 12:27:25,467 INFO L87 Difference]: Start difference. First operand 3684 states and 4634 transitions. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 2 states have internal predecessors, (321), 0 states have call successors, (0), 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-19 12:27:26,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 12:27:26,696 INFO L93 Difference]: Finished difference Result 7665 states and 9577 transitions. [2022-07-19 12:27:26,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 12:27:26,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 2 states have internal predecessors, (321), 0 states have call successors, (0), 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 373 [2022-07-19 12:27:26,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 12:27:26,715 INFO L225 Difference]: With dead ends: 7665 [2022-07-19 12:27:26,716 INFO L226 Difference]: Without dead ends: 3983 [2022-07-19 12:27:26,721 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-19 12:27:26,722 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-19 12:27:26,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 359 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-19 12:27:26,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3983 states. [2022-07-19 12:27:26,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3983 to 3983. [2022-07-19 12:27:26,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3983 states, 3982 states have (on average 1.2403314917127073) internal successors, (4939), 3982 states have internal predecessors, (4939), 0 states have call successors, (0), 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-19 12:27:26,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3983 states to 3983 states and 4939 transitions. [2022-07-19 12:27:26,792 INFO L78 Accepts]: Start accepts. Automaton has 3983 states and 4939 transitions. Word has length 373 [2022-07-19 12:27:26,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 12:27:26,792 INFO L495 AbstractCegarLoop]: Abstraction has 3983 states and 4939 transitions. [2022-07-19 12:27:26,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 2 states have internal predecessors, (321), 0 states have call successors, (0), 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-19 12:27:26,793 INFO L276 IsEmpty]: Start isEmpty. Operand 3983 states and 4939 transitions. [2022-07-19 12:27:26,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2022-07-19 12:27:26,799 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 12:27:26,800 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, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 12:27:26,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 12:27:26,800 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 12:27:26,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 12:27:26,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1174077085, now seen corresponding path program 1 times [2022-07-19 12:27:26,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 12:27:26,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435796170] [2022-07-19 12:27:26,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 12:27:26,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 12:27:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 12:27:27,029 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-07-19 12:27:27,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 12:27:27,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435796170] [2022-07-19 12:27:27,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435796170] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 12:27:27,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 12:27:27,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 12:27:27,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918391908] [2022-07-19 12:27:27,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 12:27:27,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 12:27:27,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 12:27:27,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 12:27:27,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 12:27:27,032 INFO L87 Difference]: Start difference. First operand 3983 states and 4939 transitions. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 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-19 12:27:28,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 12:27:28,772 INFO L93 Difference]: Finished difference Result 8861 states and 11333 transitions. [2022-07-19 12:27:28,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 12:27:28,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 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 416 [2022-07-19 12:27:28,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 12:27:28,789 INFO L225 Difference]: With dead ends: 8861 [2022-07-19 12:27:28,789 INFO L226 Difference]: Without dead ends: 5179 [2022-07-19 12:27:28,795 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-19 12:27:28,796 INFO L413 NwaCegarLoop]: 277 mSDtfsCounter, 259 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-19 12:27:28,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 322 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-19 12:27:28,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5179 states. [2022-07-19 12:27:28,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5179 to 3381. [2022-07-19 12:27:28,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3381 states, 3380 states have (on average 1.26301775147929) internal successors, (4269), 3380 states have internal predecessors, (4269), 0 states have call successors, (0), 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-19 12:27:28,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 4269 transitions. [2022-07-19 12:27:28,867 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 4269 transitions. Word has length 416 [2022-07-19 12:27:28,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 12:27:28,868 INFO L495 AbstractCegarLoop]: Abstraction has 3381 states and 4269 transitions. [2022-07-19 12:27:28,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 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-19 12:27:28,868 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 4269 transitions. [2022-07-19 12:27:28,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2022-07-19 12:27:28,877 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 12:27:28,878 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, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 12:27:28,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 12:27:28,878 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 12:27:28,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 12:27:28,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1674238342, now seen corresponding path program 1 times [2022-07-19 12:27:28,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 12:27:28,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039984675] [2022-07-19 12:27:28,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 12:27:28,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 12:27:28,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 12:27:29,152 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 12:27:29,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 12:27:29,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039984675] [2022-07-19 12:27:29,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039984675] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 12:27:29,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 12:27:29,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 12:27:29,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683019428] [2022-07-19 12:27:29,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 12:27:29,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 12:27:29,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 12:27:29,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 12:27:29,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 12:27:29,155 INFO L87 Difference]: Start difference. First operand 3381 states and 4269 transitions. Second operand has 5 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 0 states have call successors, (0), 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-19 12:27:30,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 12:27:30,909 INFO L93 Difference]: Finished difference Result 8297 states and 10744 transitions. [2022-07-19 12:27:30,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 12:27:30,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 0 states have call successors, (0), 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 420 [2022-07-19 12:27:30,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 12:27:30,927 INFO L225 Difference]: With dead ends: 8297 [2022-07-19 12:27:30,928 INFO L226 Difference]: Without dead ends: 5217 [2022-07-19 12:27:30,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-19 12:27:30,934 INFO L413 NwaCegarLoop]: 308 mSDtfsCounter, 387 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 1546 mSolverCounterSat, 525 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 2071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 525 IncrementalHoareTripleChecker+Valid, 1546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-19 12:27:30,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 379 Invalid, 2071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [525 Valid, 1546 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-19 12:27:30,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5217 states. [2022-07-19 12:27:31,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5217 to 4878. [2022-07-19 12:27:31,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4878 states, 4877 states have (on average 1.2259585810949354) internal successors, (5979), 4877 states have internal predecessors, (5979), 0 states have call successors, (0), 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-19 12:27:31,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4878 states to 4878 states and 5979 transitions. [2022-07-19 12:27:31,063 INFO L78 Accepts]: Start accepts. Automaton has 4878 states and 5979 transitions. Word has length 420 [2022-07-19 12:27:31,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 12:27:31,064 INFO L495 AbstractCegarLoop]: Abstraction has 4878 states and 5979 transitions. [2022-07-19 12:27:31,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 0 states have call successors, (0), 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-19 12:27:31,064 INFO L276 IsEmpty]: Start isEmpty. Operand 4878 states and 5979 transitions. [2022-07-19 12:27:31,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2022-07-19 12:27:31,068 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 12:27:31,068 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, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 12:27:31,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 12:27:31,070 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 12:27:31,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 12:27:31,070 INFO L85 PathProgramCache]: Analyzing trace with hash 381390040, now seen corresponding path program 1 times [2022-07-19 12:27:31,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 12:27:31,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65857253] [2022-07-19 12:27:31,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 12:27:31,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 12:27:31,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 12:27:31,294 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-07-19 12:27:31,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 12:27:31,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65857253] [2022-07-19 12:27:31,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65857253] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 12:27:31,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 12:27:31,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 12:27:31,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343084051] [2022-07-19 12:27:31,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 12:27:31,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 12:27:31,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 12:27:31,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 12:27:31,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 12:27:31,298 INFO L87 Difference]: Start difference. First operand 4878 states and 5979 transitions. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 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-19 12:27:32,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 12:27:32,682 INFO L93 Difference]: Finished difference Result 10952 states and 13771 transitions. [2022-07-19 12:27:32,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 12:27:32,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 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 432 [2022-07-19 12:27:32,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 12:27:32,701 INFO L225 Difference]: With dead ends: 10952 [2022-07-19 12:27:32,702 INFO L226 Difference]: Without dead ends: 6375 [2022-07-19 12:27:32,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 12:27:32,708 INFO L413 NwaCegarLoop]: 580 mSDtfsCounter, 273 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-19 12:27:32,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 619 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-19 12:27:32,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6375 states. [2022-07-19 12:27:32,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6375 to 6374. [2022-07-19 12:27:32,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6374 states, 6373 states have (on average 1.198022909147968) internal successors, (7635), 6373 states have internal predecessors, (7635), 0 states have call successors, (0), 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-19 12:27:32,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6374 states to 6374 states and 7635 transitions. [2022-07-19 12:27:32,807 INFO L78 Accepts]: Start accepts. Automaton has 6374 states and 7635 transitions. Word has length 432 [2022-07-19 12:27:32,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 12:27:32,808 INFO L495 AbstractCegarLoop]: Abstraction has 6374 states and 7635 transitions. [2022-07-19 12:27:32,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 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-19 12:27:32,808 INFO L276 IsEmpty]: Start isEmpty. Operand 6374 states and 7635 transitions. [2022-07-19 12:27:32,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2022-07-19 12:27:32,813 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 12:27:32,814 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 12:27:32,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 12:27:32,814 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 12:27:32,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 12:27:32,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1616945835, now seen corresponding path program 1 times [2022-07-19 12:27:32,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 12:27:32,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503668202] [2022-07-19 12:27:32,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 12:27:32,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 12:27:32,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 12:27:33,036 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2022-07-19 12:27:33,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 12:27:33,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503668202] [2022-07-19 12:27:33,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503668202] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 12:27:33,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 12:27:33,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 12:27:33,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364024828] [2022-07-19 12:27:33,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 12:27:33,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 12:27:33,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 12:27:33,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 12:27:33,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 12:27:33,055 INFO L87 Difference]: Start difference. First operand 6374 states and 7635 transitions. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 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-19 12:27:34,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 12:27:34,805 INFO L93 Difference]: Finished difference Result 16633 states and 20159 transitions. [2022-07-19 12:27:34,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 12:27:34,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 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 529 [2022-07-19 12:27:34,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 12:27:34,829 INFO L225 Difference]: With dead ends: 16633 [2022-07-19 12:27:34,829 INFO L226 Difference]: Without dead ends: 10560 [2022-07-19 12:27:34,838 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-19 12:27:34,839 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 285 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 956 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 1154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-19 12:27:34,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 263 Invalid, 1154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 956 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-19 12:27:34,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10560 states. [2022-07-19 12:27:34,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10560 to 8467. [2022-07-19 12:27:34,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8467 states, 8466 states have (on average 1.1961965509095205) internal successors, (10127), 8466 states have internal predecessors, (10127), 0 states have call successors, (0), 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-19 12:27:34,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8467 states to 8467 states and 10127 transitions. [2022-07-19 12:27:34,972 INFO L78 Accepts]: Start accepts. Automaton has 8467 states and 10127 transitions. Word has length 529 [2022-07-19 12:27:34,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 12:27:34,973 INFO L495 AbstractCegarLoop]: Abstraction has 8467 states and 10127 transitions. [2022-07-19 12:27:34,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 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-19 12:27:34,973 INFO L276 IsEmpty]: Start isEmpty. Operand 8467 states and 10127 transitions. [2022-07-19 12:27:34,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2022-07-19 12:27:34,979 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 12:27:34,980 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, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 12:27:34,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-19 12:27:34,981 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 12:27:34,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 12:27:34,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1652572232, now seen corresponding path program 1 times [2022-07-19 12:27:34,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 12:27:34,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581299983] [2022-07-19 12:27:34,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 12:27:34,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 12:27:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 12:27:35,241 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2022-07-19 12:27:35,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 12:27:35,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581299983] [2022-07-19 12:27:35,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581299983] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 12:27:35,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 12:27:35,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 12:27:35,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599775248] [2022-07-19 12:27:35,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 12:27:35,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 12:27:35,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 12:27:35,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 12:27:35,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 12:27:35,245 INFO L87 Difference]: Start difference. First operand 8467 states and 10127 transitions. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 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-19 12:27:37,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 12:27:37,065 INFO L93 Difference]: Finished difference Result 19937 states and 23976 transitions. [2022-07-19 12:27:37,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 12:27:37,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 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 546 [2022-07-19 12:27:37,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 12:27:37,091 INFO L225 Difference]: With dead ends: 19937 [2022-07-19 12:27:37,091 INFO L226 Difference]: Without dead ends: 11771 [2022-07-19 12:27:37,102 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-19 12:27:37,103 INFO L413 NwaCegarLoop]: 587 mSDtfsCounter, 243 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 1197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-19 12:27:37,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 621 Invalid, 1197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-19 12:27:37,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11771 states. [2022-07-19 12:27:37,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11771 to 11759. [2022-07-19 12:27:37,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11759 states, 11758 states have (on average 1.173924136757952) internal successors, (13803), 11758 states have internal predecessors, (13803), 0 states have call successors, (0), 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-19 12:27:37,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11759 states to 11759 states and 13803 transitions. [2022-07-19 12:27:37,301 INFO L78 Accepts]: Start accepts. Automaton has 11759 states and 13803 transitions. Word has length 546 [2022-07-19 12:27:37,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 12:27:37,302 INFO L495 AbstractCegarLoop]: Abstraction has 11759 states and 13803 transitions. [2022-07-19 12:27:37,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 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-19 12:27:37,302 INFO L276 IsEmpty]: Start isEmpty. Operand 11759 states and 13803 transitions. [2022-07-19 12:27:37,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2022-07-19 12:27:37,309 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 12:27:37,310 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 12:27:37,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-19 12:27:37,310 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 12:27:37,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 12:27:37,311 INFO L85 PathProgramCache]: Analyzing trace with hash -889884113, now seen corresponding path program 1 times [2022-07-19 12:27:37,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 12:27:37,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192089879] [2022-07-19 12:27:37,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 12:27:37,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 12:27:37,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 12:27:37,518 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2022-07-19 12:27:37,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 12:27:37,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192089879] [2022-07-19 12:27:37,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192089879] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 12:27:37,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 12:27:37,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 12:27:37,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421983422] [2022-07-19 12:27:37,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 12:27:37,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 12:27:37,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 12:27:37,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 12:27:37,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 12:27:37,522 INFO L87 Difference]: Start difference. First operand 11759 states and 13803 transitions. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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-19 12:27:39,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 12:27:39,062 INFO L93 Difference]: Finished difference Result 23514 states and 27644 transitions. [2022-07-19 12:27:39,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 12:27:39,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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 556 [2022-07-19 12:27:39,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 12:27:39,081 INFO L225 Difference]: With dead ends: 23514 [2022-07-19 12:27:39,081 INFO L226 Difference]: Without dead ends: 12056 [2022-07-19 12:27:39,089 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-19 12:27:39,089 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 465 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 1041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-19 12:27:39,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 71 Invalid, 1041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-19 12:27:39,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12056 states. [2022-07-19 12:27:39,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12056 to 11757. [2022-07-19 12:27:39,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11757 states, 11756 states have (on average 1.1737835998638992) internal successors, (13799), 11756 states have internal predecessors, (13799), 0 states have call successors, (0), 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-19 12:27:39,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11757 states to 11757 states and 13799 transitions. [2022-07-19 12:27:39,233 INFO L78 Accepts]: Start accepts. Automaton has 11757 states and 13799 transitions. Word has length 556 [2022-07-19 12:27:39,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 12:27:39,234 INFO L495 AbstractCegarLoop]: Abstraction has 11757 states and 13799 transitions. [2022-07-19 12:27:39,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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-19 12:27:39,235 INFO L276 IsEmpty]: Start isEmpty. Operand 11757 states and 13799 transitions. [2022-07-19 12:27:39,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2022-07-19 12:27:39,245 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 12:27:39,247 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, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 12:27:39,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-19 12:27:39,248 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 12:27:39,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 12:27:39,248 INFO L85 PathProgramCache]: Analyzing trace with hash 967458274, now seen corresponding path program 1 times [2022-07-19 12:27:39,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 12:27:39,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040944559] [2022-07-19 12:27:39,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 12:27:39,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 12:27:39,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 12:27:39,487 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 433 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-07-19 12:27:39,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 12:27:39,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040944559] [2022-07-19 12:27:39,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040944559] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 12:27:39,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 12:27:39,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 12:27:39,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789516697] [2022-07-19 12:27:39,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 12:27:39,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 12:27:39,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 12:27:39,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 12:27:39,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 12:27:39,490 INFO L87 Difference]: Start difference. First operand 11757 states and 13799 transitions. Second operand has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 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-19 12:27:40,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 12:27:40,558 INFO L93 Difference]: Finished difference Result 24708 states and 28972 transitions. [2022-07-19 12:27:40,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 12:27:40,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 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 576 [2022-07-19 12:27:40,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 12:27:40,579 INFO L225 Difference]: With dead ends: 24708 [2022-07-19 12:27:40,579 INFO L226 Difference]: Without dead ends: 13252 [2022-07-19 12:27:40,591 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-19 12:27:40,592 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 270 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-19 12:27:40,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 324 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-19 12:27:40,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13252 states. [2022-07-19 12:27:40,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13252 to 9960. [2022-07-19 12:27:40,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9960 states, 9959 states have (on average 1.1905813836730594) internal successors, (11857), 9959 states have internal predecessors, (11857), 0 states have call successors, (0), 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-19 12:27:40,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9960 states to 9960 states and 11857 transitions. [2022-07-19 12:27:40,724 INFO L78 Accepts]: Start accepts. Automaton has 9960 states and 11857 transitions. Word has length 576 [2022-07-19 12:27:40,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 12:27:40,725 INFO L495 AbstractCegarLoop]: Abstraction has 9960 states and 11857 transitions. [2022-07-19 12:27:40,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 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-19 12:27:40,725 INFO L276 IsEmpty]: Start isEmpty. Operand 9960 states and 11857 transitions. [2022-07-19 12:27:40,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2022-07-19 12:27:40,734 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 12:27:40,734 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 12:27:40,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-19 12:27:40,735 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 12:27:40,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 12:27:40,737 INFO L85 PathProgramCache]: Analyzing trace with hash -270881818, now seen corresponding path program 1 times [2022-07-19 12:27:40,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 12:27:40,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626136451] [2022-07-19 12:27:40,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 12:27:40,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 12:27:40,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 12:27:41,019 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 414 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-07-19 12:27:41,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 12:27:41,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626136451] [2022-07-19 12:27:41,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626136451] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 12:27:41,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 12:27:41,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 12:27:41,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278348766] [2022-07-19 12:27:41,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 12:27:41,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 12:27:41,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 12:27:41,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 12:27:41,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 12:27:41,023 INFO L87 Difference]: Start difference. First operand 9960 states and 11857 transitions. Second operand has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 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-19 12:27:42,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 12:27:42,613 INFO L93 Difference]: Finished difference Result 25898 states and 30912 transitions. [2022-07-19 12:27:42,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 12:27:42,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 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 582 [2022-07-19 12:27:42,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 12:27:42,634 INFO L225 Difference]: With dead ends: 25898 [2022-07-19 12:27:42,635 INFO L226 Difference]: Without dead ends: 16239 [2022-07-19 12:27:42,645 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-19 12:27:42,646 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 223 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 1177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-19 12:27:42,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 189 Invalid, 1177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-19 12:27:42,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16239 states. [2022-07-19 12:27:42,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16239 to 12053. [2022-07-19 12:27:42,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12053 states, 12052 states have (on average 1.211749087288417) internal successors, (14604), 12052 states have internal predecessors, (14604), 0 states have call successors, (0), 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-19 12:27:42,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12053 states to 12053 states and 14604 transitions. [2022-07-19 12:27:42,863 INFO L78 Accepts]: Start accepts. Automaton has 12053 states and 14604 transitions. Word has length 582 [2022-07-19 12:27:42,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 12:27:42,863 INFO L495 AbstractCegarLoop]: Abstraction has 12053 states and 14604 transitions. [2022-07-19 12:27:42,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 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-19 12:27:42,864 INFO L276 IsEmpty]: Start isEmpty. Operand 12053 states and 14604 transitions. [2022-07-19 12:27:42,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 620 [2022-07-19 12:27:42,874 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 12:27:42,875 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, 5, 5, 5, 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, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 12:27:42,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-19 12:27:42,875 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 12:27:42,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 12:27:42,876 INFO L85 PathProgramCache]: Analyzing trace with hash -830480631, now seen corresponding path program 1 times [2022-07-19 12:27:42,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 12:27:42,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208782967] [2022-07-19 12:27:42,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 12:27:42,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 12:27:42,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 12:27:43,104 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 599 proven. 39 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2022-07-19 12:27:43,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 12:27:43,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208782967] [2022-07-19 12:27:43,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208782967] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 12:27:43,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196243371] [2022-07-19 12:27:43,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 12:27:43,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 12:27:43,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 12:27:43,108 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-19 12:27:43,109 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-19 12:27:43,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 12:27:43,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 12:27:43,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 12:27:43,449 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-07-19 12:27:43,449 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 12:27:43,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196243371] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 12:27:43,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 12:27:43,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-07-19 12:27:43,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776069307] [2022-07-19 12:27:43,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 12:27:43,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 12:27:43,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 12:27:43,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 12:27:43,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 12:27:43,452 INFO L87 Difference]: Start difference. First operand 12053 states and 14604 transitions. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 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-19 12:27:45,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 12:27:45,335 INFO L93 Difference]: Finished difference Result 27095 states and 33543 transitions. [2022-07-19 12:27:45,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 12:27:45,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 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 619 [2022-07-19 12:27:45,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 12:27:45,355 INFO L225 Difference]: With dead ends: 27095 [2022-07-19 12:27:45,355 INFO L226 Difference]: Without dead ends: 15343 [2022-07-19 12:27:45,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 622 GetRequests, 618 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 12:27:45,367 INFO L413 NwaCegarLoop]: 595 mSDtfsCounter, 266 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-19 12:27:45,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 634 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-19 12:27:45,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15343 states. [2022-07-19 12:27:45,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15343 to 14446. [2022-07-19 12:27:45,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14446 states, 14445 states have (on average 1.1910695742471444) internal successors, (17205), 14445 states have internal predecessors, (17205), 0 states have call successors, (0), 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-19 12:27:45,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14446 states to 14446 states and 17205 transitions. [2022-07-19 12:27:45,561 INFO L78 Accepts]: Start accepts. Automaton has 14446 states and 17205 transitions. Word has length 619 [2022-07-19 12:27:45,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 12:27:45,561 INFO L495 AbstractCegarLoop]: Abstraction has 14446 states and 17205 transitions. [2022-07-19 12:27:45,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 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-19 12:27:45,562 INFO L276 IsEmpty]: Start isEmpty. Operand 14446 states and 17205 transitions. [2022-07-19 12:27:45,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 677 [2022-07-19 12:27:45,577 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 12:27:45,578 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, 6, 6, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-19 12:27:45,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-19 12:27:45,799 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,SelfDestructingSolverStorable14 [2022-07-19 12:27:45,800 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 12:27:45,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 12:27:45,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1205457609, now seen corresponding path program 1 times [2022-07-19 12:27:45,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 12:27:45,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47613699] [2022-07-19 12:27:45,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 12:27:45,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 12:27:45,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 12:27:46,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1189 backedges. 745 proven. 39 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2022-07-19 12:27:46,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 12:27:46,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47613699] [2022-07-19 12:27:46,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47613699] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 12:27:46,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645607216] [2022-07-19 12:27:46,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 12:27:46,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 12:27:46,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 12:27:46,128 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 12:27:46,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 12:27:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 12:27:46,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-19 12:27:46,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 12:27:46,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1189 backedges. 745 proven. 39 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2022-07-19 12:27:46,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 12:27:47,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1189 backedges. 745 proven. 39 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2022-07-19 12:27:47,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645607216] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 12:27:47,730 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 12:27:47,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-07-19 12:27:47,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008007528] [2022-07-19 12:27:47,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 12:27:47,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 12:27:47,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 12:27:47,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 12:27:47,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-07-19 12:27:47,734 INFO L87 Difference]: Start difference. First operand 14446 states and 17205 transitions. Second operand has 9 states, 9 states have (on average 82.66666666666667) internal successors, (744), 8 states have internal predecessors, (744), 0 states have call successors, (0), 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-19 12:27:53,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 12:27:53,154 INFO L93 Difference]: Finished difference Result 36223 states and 42637 transitions. [2022-07-19 12:27:53,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 12:27:53,155 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 82.66666666666667) internal successors, (744), 8 states have internal predecessors, (744), 0 states have call successors, (0), 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 676 [2022-07-19 12:27:53,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 12:27:53,174 INFO L225 Difference]: With dead ends: 36223 [2022-07-19 12:27:53,174 INFO L226 Difference]: Without dead ends: 16839 [2022-07-19 12:27:53,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1361 GetRequests, 1346 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2022-07-19 12:27:53,184 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 2855 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 5804 mSolverCounterSat, 670 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2855 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 6474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 670 IncrementalHoareTripleChecker+Valid, 5804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-07-19 12:27:53,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2855 Valid, 236 Invalid, 6474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [670 Valid, 5804 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-07-19 12:27:53,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16839 states. [2022-07-19 12:27:53,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16839 to 16836. [2022-07-19 12:27:53,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16836 states, 16835 states have (on average 1.0657558657558657) internal successors, (17942), 16835 states have internal predecessors, (17942), 0 states have call successors, (0), 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-19 12:27:53,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16836 states to 16836 states and 17942 transitions. [2022-07-19 12:27:53,391 INFO L78 Accepts]: Start accepts. Automaton has 16836 states and 17942 transitions. Word has length 676 [2022-07-19 12:27:53,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 12:27:53,391 INFO L495 AbstractCegarLoop]: Abstraction has 16836 states and 17942 transitions. [2022-07-19 12:27:53,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 82.66666666666667) internal successors, (744), 8 states have internal predecessors, (744), 0 states have call successors, (0), 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-19 12:27:53,392 INFO L276 IsEmpty]: Start isEmpty. Operand 16836 states and 17942 transitions. [2022-07-19 12:27:53,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 685 [2022-07-19 12:27:53,405 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 12:27:53,406 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, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 12:27:53,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 12:27:53,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-19 12:27:53,630 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 12:27:53,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 12:27:53,631 INFO L85 PathProgramCache]: Analyzing trace with hash 547646301, now seen corresponding path program 1 times [2022-07-19 12:27:53,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 12:27:53,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421682532] [2022-07-19 12:27:53,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 12:27:53,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 12:27:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 12:27:53,926 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2022-07-19 12:27:53,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 12:27:53,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421682532] [2022-07-19 12:27:53,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421682532] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 12:27:53,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 12:27:53,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 12:27:53,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458429426] [2022-07-19 12:27:53,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 12:27:53,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 12:27:53,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 12:27:53,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 12:27:53,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 12:27:53,930 INFO L87 Difference]: Start difference. First operand 16836 states and 17942 transitions. Second operand has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 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-19 12:27:54,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 12:27:54,841 INFO L93 Difference]: Finished difference Result 35761 states and 38184 transitions. [2022-07-19 12:27:54,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 12:27:54,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 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 684 [2022-07-19 12:27:54,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 12:27:54,863 INFO L225 Difference]: With dead ends: 35761 [2022-07-19 12:27:54,863 INFO L226 Difference]: Without dead ends: 19226 [2022-07-19 12:27:54,875 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-19 12:27:54,876 INFO L413 NwaCegarLoop]: 468 mSDtfsCounter, 225 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-19 12:27:54,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 505 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-19 12:27:54,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19226 states. [2022-07-19 12:27:55,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19226 to 18927. [2022-07-19 12:27:55,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18927 states, 18926 states have (on average 1.054845186515904) internal successors, (19964), 18926 states have internal predecessors, (19964), 0 states have call successors, (0), 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-19 12:27:55,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18927 states to 18927 states and 19964 transitions. [2022-07-19 12:27:55,099 INFO L78 Accepts]: Start accepts. Automaton has 18927 states and 19964 transitions. Word has length 684 [2022-07-19 12:27:55,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 12:27:55,100 INFO L495 AbstractCegarLoop]: Abstraction has 18927 states and 19964 transitions. [2022-07-19 12:27:55,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 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-19 12:27:55,100 INFO L276 IsEmpty]: Start isEmpty. Operand 18927 states and 19964 transitions. [2022-07-19 12:27:55,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 695 [2022-07-19 12:27:55,111 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 12:27:55,111 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-19 12:27:55,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-19 12:27:55,112 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 12:27:55,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 12:27:55,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1636456743, now seen corresponding path program 1 times [2022-07-19 12:27:55,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 12:27:55,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911002177] [2022-07-19 12:27:55,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 12:27:55,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 12:27:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 12:27:55,441 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 292 proven. 269 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-19 12:27:55,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 12:27:55,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911002177] [2022-07-19 12:27:55,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911002177] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 12:27:55,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696459533] [2022-07-19 12:27:55,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 12:27:55,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 12:27:55,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 12:27:55,444 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 12:27:55,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 12:27:55,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 12:27:55,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 822 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 12:27:55,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 12:27:55,926 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 561 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-19 12:27:55,927 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 12:27:55,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696459533] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 12:27:55,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 12:27:55,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-07-19 12:27:55,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746886508] [2022-07-19 12:27:55,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 12:27:55,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 12:27:55,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 12:27:55,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 12:27:55,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 12:27:55,929 INFO L87 Difference]: Start difference. First operand 18927 states and 19964 transitions. Second operand has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 0 states have call successors, (0), 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-19 12:27:56,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 12:27:56,832 INFO L93 Difference]: Finished difference Result 37555 states and 39628 transitions. [2022-07-19 12:27:56,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 12:27:56,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 0 states have call successors, (0), 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 694 [2022-07-19 12:27:56,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 12:27:56,856 INFO L225 Difference]: With dead ends: 37555 [2022-07-19 12:27:56,856 INFO L226 Difference]: Without dead ends: 18929 [2022-07-19 12:27:56,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 697 GetRequests, 693 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 12:27:56,863 INFO L413 NwaCegarLoop]: 384 mSDtfsCounter, 104 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-19 12:27:56,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 395 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-19 12:27:56,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18929 states. [2022-07-19 12:27:57,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18929 to 18626. [2022-07-19 12:27:57,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18626 states, 18625 states have (on average 1.0488053691275168) internal successors, (19534), 18625 states have internal predecessors, (19534), 0 states have call successors, (0), 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-19 12:27:57,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18626 states to 18626 states and 19534 transitions. [2022-07-19 12:27:57,044 INFO L78 Accepts]: Start accepts. Automaton has 18626 states and 19534 transitions. Word has length 694 [2022-07-19 12:27:57,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 12:27:57,044 INFO L495 AbstractCegarLoop]: Abstraction has 18626 states and 19534 transitions. [2022-07-19 12:27:57,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 0 states have call successors, (0), 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-19 12:27:57,044 INFO L276 IsEmpty]: Start isEmpty. Operand 18626 states and 19534 transitions. [2022-07-19 12:27:57,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2022-07-19 12:27:57,054 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 12:27:57,054 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, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 12:27:57,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-19 12:27:57,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-19 12:27:57,267 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 12:27:57,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 12:27:57,267 INFO L85 PathProgramCache]: Analyzing trace with hash 696512821, now seen corresponding path program 1 times [2022-07-19 12:27:57,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 12:27:57,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875811398] [2022-07-19 12:27:57,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 12:27:57,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 12:27:57,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 12:27:57,579 INFO L134 CoverageAnalysis]: Checked inductivity of 908 backedges. 802 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-07-19 12:27:57,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 12:27:57,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875811398] [2022-07-19 12:27:57,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875811398] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 12:27:57,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 12:27:57,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 12:27:57,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810981039] [2022-07-19 12:27:57,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 12:27:57,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 12:27:57,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 12:27:57,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 12:27:57,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-19 12:27:57,583 INFO L87 Difference]: Start difference. First operand 18626 states and 19534 transitions. Second operand has 4 states, 4 states have (on average 156.75) internal successors, (627), 4 states have internal predecessors, (627), 0 states have call successors, (0), 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-19 12:27:58,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 12:27:58,966 INFO L93 Difference]: Finished difference Result 42657 states and 44659 transitions. [2022-07-19 12:27:58,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 12:27:58,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 156.75) internal successors, (627), 4 states have internal predecessors, (627), 0 states have call successors, (0), 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 732 [2022-07-19 12:27:58,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 12:27:58,992 INFO L225 Difference]: With dead ends: 42657 [2022-07-19 12:27:58,992 INFO L226 Difference]: Without dead ends: 24332 [2022-07-19 12:27:59,004 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-19 12:27:59,004 INFO L413 NwaCegarLoop]: 449 mSDtfsCounter, 368 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1410 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 1537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-19 12:27:59,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 498 Invalid, 1537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1410 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-19 12:27:59,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24332 states. [2022-07-19 12:27:59,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24332 to 22533. [2022-07-19 12:27:59,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22533 states, 22532 states have (on average 1.0431386472572342) internal successors, (23504), 22532 states have internal predecessors, (23504), 0 states have call successors, (0), 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-19 12:27:59,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22533 states to 22533 states and 23504 transitions. [2022-07-19 12:27:59,211 INFO L78 Accepts]: Start accepts. Automaton has 22533 states and 23504 transitions. Word has length 732 [2022-07-19 12:27:59,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 12:27:59,211 INFO L495 AbstractCegarLoop]: Abstraction has 22533 states and 23504 transitions. [2022-07-19 12:27:59,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 156.75) internal successors, (627), 4 states have internal predecessors, (627), 0 states have call successors, (0), 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-19 12:27:59,211 INFO L276 IsEmpty]: Start isEmpty. Operand 22533 states and 23504 transitions. [2022-07-19 12:27:59,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 747 [2022-07-19 12:27:59,219 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 12:27:59,220 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, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 12:27:59,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-19 12:27:59,220 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 12:27:59,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 12:27:59,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1684182335, now seen corresponding path program 1 times [2022-07-19 12:27:59,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 12:27:59,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084281] [2022-07-19 12:27:59,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 12:27:59,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 12:27:59,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 12:27:59,572 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 563 proven. 188 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2022-07-19 12:27:59,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 12:27:59,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084281] [2022-07-19 12:27:59,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084281] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 12:27:59,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005952054] [2022-07-19 12:27:59,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 12:27:59,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 12:27:59,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 12:27:59,575 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 12:27:59,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-19 12:27:59,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 12:27:59,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 12:27:59,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 12:28:01,682 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 726 trivial. 0 not checked. [2022-07-19 12:28:01,683 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 12:28:01,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005952054] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 12:28:01,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 12:28:01,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-07-19 12:28:01,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191700714] [2022-07-19 12:28:01,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 12:28:01,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 12:28:01,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 12:28:01,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 12:28:01,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 12:28:01,685 INFO L87 Difference]: Start difference. First operand 22533 states and 23504 transitions. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 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-19 12:28:01,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 12:28:01,763 INFO L93 Difference]: Finished difference Result 23437 states and 24418 transitions. [2022-07-19 12:28:01,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 12:28:01,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 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 746 [2022-07-19 12:28:01,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 12:28:01,790 INFO L225 Difference]: With dead ends: 23437 [2022-07-19 12:28:01,790 INFO L226 Difference]: Without dead ends: 23435 [2022-07-19 12:28:01,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 749 GetRequests, 745 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 12:28:01,797 INFO L413 NwaCegarLoop]: 485 mSDtfsCounter, 255 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 785 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 12:28:01,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 523 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 785 Unchecked, 0.0s Time] [2022-07-19 12:28:01,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23435 states. [2022-07-19 12:28:01,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23435 to 22234. [2022-07-19 12:28:01,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22234 states, 22233 states have (on average 1.042819232672154) internal successors, (23185), 22233 states have internal predecessors, (23185), 0 states have call successors, (0), 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-19 12:28:02,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22234 states to 22234 states and 23185 transitions. [2022-07-19 12:28:02,022 INFO L78 Accepts]: Start accepts. Automaton has 22234 states and 23185 transitions. Word has length 746 [2022-07-19 12:28:02,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 12:28:02,022 INFO L495 AbstractCegarLoop]: Abstraction has 22234 states and 23185 transitions. [2022-07-19 12:28:02,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 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-19 12:28:02,022 INFO L276 IsEmpty]: Start isEmpty. Operand 22234 states and 23185 transitions. [2022-07-19 12:28:02,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 866 [2022-07-19 12:28:02,037 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 12:28:02,038 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, 6, 6, 6, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 12:28:02,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-19 12:28:02,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 12:28:02,239 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 12:28:02,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 12:28:02,239 INFO L85 PathProgramCache]: Analyzing trace with hash 341621360, now seen corresponding path program 1 times [2022-07-19 12:28:02,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 12:28:02,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872234130] [2022-07-19 12:28:02,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 12:28:02,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 12:28:02,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 12:28:02,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1385 backedges. 803 proven. 0 refuted. 0 times theorem prover too weak. 582 trivial. 0 not checked. [2022-07-19 12:28:02,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 12:28:02,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872234130] [2022-07-19 12:28:02,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872234130] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 12:28:02,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 12:28:02,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 12:28:02,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354056225] [2022-07-19 12:28:02,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 12:28:02,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 12:28:02,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 12:28:02,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 12:28:02,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 12:28:02,651 INFO L87 Difference]: Start difference. First operand 22234 states and 23185 transitions. Second operand has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 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-19 12:28:03,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 12:28:03,856 INFO L93 Difference]: Finished difference Result 44956 states and 46868 transitions. [2022-07-19 12:28:03,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 12:28:03,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 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 865 [2022-07-19 12:28:03,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 12:28:03,877 INFO L225 Difference]: With dead ends: 44956 [2022-07-19 12:28:03,877 INFO L226 Difference]: Without dead ends: 23023 [2022-07-19 12:28:03,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 12:28:03,890 INFO L413 NwaCegarLoop]: 485 mSDtfsCounter, 314 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 1141 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 1217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-19 12:28:03,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 627 Invalid, 1217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1141 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-19 12:28:03,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23023 states. [2022-07-19 12:28:04,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23023 to 22834. [2022-07-19 12:28:04,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22834 states, 22833 states have (on average 1.041869224368239) internal successors, (23789), 22833 states have internal predecessors, (23789), 0 states have call successors, (0), 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-19 12:28:04,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22834 states to 22834 states and 23789 transitions. [2022-07-19 12:28:04,202 INFO L78 Accepts]: Start accepts. Automaton has 22834 states and 23789 transitions. Word has length 865 [2022-07-19 12:28:04,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 12:28:04,203 INFO L495 AbstractCegarLoop]: Abstraction has 22834 states and 23789 transitions. [2022-07-19 12:28:04,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 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-19 12:28:04,203 INFO L276 IsEmpty]: Start isEmpty. Operand 22834 states and 23789 transitions. [2022-07-19 12:28:04,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 896 [2022-07-19 12:28:04,219 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 12:28:04,219 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-19 12:28:04,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-19 12:28:04,220 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 12:28:04,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 12:28:04,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1669164797, now seen corresponding path program 1 times [2022-07-19 12:28:04,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 12:28:04,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782357923] [2022-07-19 12:28:04,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 12:28:04,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 12:28:04,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 12:28:04,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1763 backedges. 1068 proven. 0 refuted. 0 times theorem prover too weak. 695 trivial. 0 not checked. [2022-07-19 12:28:04,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 12:28:04,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782357923] [2022-07-19 12:28:04,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782357923] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 12:28:04,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 12:28:04,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 12:28:04,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001663987] [2022-07-19 12:28:04,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 12:28:04,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 12:28:04,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 12:28:04,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 12:28:04,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 12:28:04,581 INFO L87 Difference]: Start difference. First operand 22834 states and 23789 transitions. Second operand has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 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-19 12:28:05,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 12:28:05,479 INFO L93 Difference]: Finished difference Result 45663 states and 47588 transitions. [2022-07-19 12:28:05,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 12:28:05,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 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 895 [2022-07-19 12:28:05,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 12:28:05,501 INFO L225 Difference]: With dead ends: 45663 [2022-07-19 12:28:05,501 INFO L226 Difference]: Without dead ends: 23130 [2022-07-19 12:28:05,515 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-19 12:28:05,516 INFO L413 NwaCegarLoop]: 428 mSDtfsCounter, 246 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-19 12:28:05,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 454 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-19 12:28:05,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23130 states. [2022-07-19 12:28:05,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23130 to 21634. [2022-07-19 12:28:05,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21634 states, 21633 states have (on average 1.0413719779965793) internal successors, (22528), 21633 states have internal predecessors, (22528), 0 states have call successors, (0), 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-19 12:28:05,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21634 states to 21634 states and 22528 transitions. [2022-07-19 12:28:05,790 INFO L78 Accepts]: Start accepts. Automaton has 21634 states and 22528 transitions. Word has length 895 [2022-07-19 12:28:05,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 12:28:05,790 INFO L495 AbstractCegarLoop]: Abstraction has 21634 states and 22528 transitions. [2022-07-19 12:28:05,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 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-19 12:28:05,791 INFO L276 IsEmpty]: Start isEmpty. Operand 21634 states and 22528 transitions. [2022-07-19 12:28:05,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 901 [2022-07-19 12:28:05,802 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 12:28:05,803 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, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 12:28:05,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-19 12:28:05,803 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 12:28:05,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 12:28:05,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1629824559, now seen corresponding path program 1 times [2022-07-19 12:28:05,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 12:28:05,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142021276] [2022-07-19 12:28:05,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 12:28:05,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 12:28:05,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 12:28:06,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1484 backedges. 871 proven. 531 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-07-19 12:28:06,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 12:28:06,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142021276] [2022-07-19 12:28:06,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142021276] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 12:28:06,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115084722] [2022-07-19 12:28:06,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 12:28:06,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 12:28:06,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 12:28:06,256 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 12:28:06,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-19 12:28:06,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 12:28:06,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 1065 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 12:28:06,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 12:28:06,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1484 backedges. 1092 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2022-07-19 12:28:06,735 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 12:28:06,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115084722] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 12:28:06,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 12:28:06,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2022-07-19 12:28:06,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796764425] [2022-07-19 12:28:06,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 12:28:06,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 12:28:06,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 12:28:06,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 12:28:06,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-19 12:28:06,738 INFO L87 Difference]: Start difference. First operand 21634 states and 22528 transitions. Second operand has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 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-19 12:28:07,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 12:28:07,759 INFO L93 Difference]: Finished difference Result 42666 states and 44447 transitions. [2022-07-19 12:28:07,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 12:28:07,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 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 900 [2022-07-19 12:28:07,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 12:28:07,779 INFO L225 Difference]: With dead ends: 42666 [2022-07-19 12:28:07,779 INFO L226 Difference]: Without dead ends: 21333 [2022-07-19 12:28:07,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 909 GetRequests, 902 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-19 12:28:07,792 INFO L413 NwaCegarLoop]: 436 mSDtfsCounter, 226 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-19 12:28:07,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 461 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-19 12:28:07,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21333 states. [2022-07-19 12:28:07,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21333 to 21333. [2022-07-19 12:28:07,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21333 states, 21332 states have (on average 1.0318769923120195) internal successors, (22012), 21332 states have internal predecessors, (22012), 0 states have call successors, (0), 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-19 12:28:07,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21333 states to 21333 states and 22012 transitions. [2022-07-19 12:28:07,983 INFO L78 Accepts]: Start accepts. Automaton has 21333 states and 22012 transitions. Word has length 900 [2022-07-19 12:28:07,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 12:28:07,983 INFO L495 AbstractCegarLoop]: Abstraction has 21333 states and 22012 transitions. [2022-07-19 12:28:07,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 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-19 12:28:07,984 INFO L276 IsEmpty]: Start isEmpty. Operand 21333 states and 22012 transitions. [2022-07-19 12:28:07,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 920 [2022-07-19 12:28:07,996 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 12:28:07,997 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, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 12:28:08,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-19 12:28:08,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-07-19 12:28:08,198 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 12:28:08,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 12:28:08,198 INFO L85 PathProgramCache]: Analyzing trace with hash -470354541, now seen corresponding path program 1 times [2022-07-19 12:28:08,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 12:28:08,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240231972] [2022-07-19 12:28:08,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 12:28:08,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 12:28:08,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 12:28:08,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 855 proven. 0 refuted. 0 times theorem prover too weak. 705 trivial. 0 not checked. [2022-07-19 12:28:08,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 12:28:08,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240231972] [2022-07-19 12:28:08,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240231972] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 12:28:08,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 12:28:08,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 12:28:08,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877187786] [2022-07-19 12:28:08,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 12:28:08,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 12:28:08,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 12:28:08,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 12:28:08,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-19 12:28:08,632 INFO L87 Difference]: Start difference. First operand 21333 states and 22012 transitions. Second operand has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 0 states have call successors, (0), 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-19 12:28:10,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 12:28:10,171 INFO L93 Difference]: Finished difference Result 44646 states and 46038 transitions. [2022-07-19 12:28:10,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 12:28:10,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 0 states have call successors, (0), 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 919 [2022-07-19 12:28:10,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 12:28:10,196 INFO L225 Difference]: With dead ends: 44646 [2022-07-19 12:28:10,196 INFO L226 Difference]: Without dead ends: 23614 [2022-07-19 12:28:10,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-19 12:28:10,210 INFO L413 NwaCegarLoop]: 463 mSDtfsCounter, 632 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 2050 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 2181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 2050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-19 12:28:10,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 617 Invalid, 2181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 2050 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-19 12:28:10,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23614 states. [2022-07-19 12:28:10,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23614 to 21333. [2022-07-19 12:28:10,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21333 states, 21332 states have (on average 1.0318301143821489) internal successors, (22011), 21332 states have internal predecessors, (22011), 0 states have call successors, (0), 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-19 12:28:10,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21333 states to 21333 states and 22011 transitions. [2022-07-19 12:28:10,511 INFO L78 Accepts]: Start accepts. Automaton has 21333 states and 22011 transitions. Word has length 919 [2022-07-19 12:28:10,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 12:28:10,511 INFO L495 AbstractCegarLoop]: Abstraction has 21333 states and 22011 transitions. [2022-07-19 12:28:10,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 0 states have call successors, (0), 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-19 12:28:10,512 INFO L276 IsEmpty]: Start isEmpty. Operand 21333 states and 22011 transitions. [2022-07-19 12:28:10,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 953 [2022-07-19 12:28:10,529 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 12:28:10,530 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 12:28:10,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-19 12:28:10,530 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 12:28:10,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 12:28:10,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1011364661, now seen corresponding path program 1 times [2022-07-19 12:28:10,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 12:28:10,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684638411] [2022-07-19 12:28:10,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 12:28:10,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 12:28:10,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 12:28:10,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1852 backedges. 1270 proven. 0 refuted. 0 times theorem prover too weak. 582 trivial. 0 not checked. [2022-07-19 12:28:10,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 12:28:10,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684638411] [2022-07-19 12:28:10,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684638411] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 12:28:10,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 12:28:10,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 12:28:10,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126248658] [2022-07-19 12:28:10,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 12:28:10,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 12:28:10,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 12:28:10,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 12:28:10,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-19 12:28:10,993 INFO L87 Difference]: Start difference. First operand 21333 states and 22011 transitions. Second operand has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 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-19 12:28:12,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 12:28:12,441 INFO L93 Difference]: Finished difference Result 43731 states and 45101 transitions. [2022-07-19 12:28:12,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 12:28:12,442 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 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 952 [2022-07-19 12:28:12,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 12:28:12,465 INFO L225 Difference]: With dead ends: 43731 [2022-07-19 12:28:12,465 INFO L226 Difference]: Without dead ends: 22699 [2022-07-19 12:28:12,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-19 12:28:12,479 INFO L413 NwaCegarLoop]: 487 mSDtfsCounter, 529 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 2023 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 2110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 2023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-19 12:28:12,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 636 Invalid, 2110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 2023 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-19 12:28:12,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22699 states. [2022-07-19 12:28:12,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22699 to 18630. [2022-07-19 12:28:12,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18630 states, 18629 states have (on average 1.0338182403779055) internal successors, (19259), 18629 states have internal predecessors, (19259), 0 states have call successors, (0), 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-19 12:28:12,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18630 states to 18630 states and 19259 transitions. [2022-07-19 12:28:12,741 INFO L78 Accepts]: Start accepts. Automaton has 18630 states and 19259 transitions. Word has length 952 [2022-07-19 12:28:12,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 12:28:12,742 INFO L495 AbstractCegarLoop]: Abstraction has 18630 states and 19259 transitions. [2022-07-19 12:28:12,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 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-19 12:28:12,742 INFO L276 IsEmpty]: Start isEmpty. Operand 18630 states and 19259 transitions. [2022-07-19 12:28:12,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1013 [2022-07-19 12:28:12,759 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 12:28:12,760 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-19 12:28:12,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-19 12:28:12,760 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 12:28:12,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 12:28:12,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1022383996, now seen corresponding path program 1 times [2022-07-19 12:28:12,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 12:28:12,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234910655] [2022-07-19 12:28:12,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 12:28:12,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 12:28:12,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 12:28:13,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2364 backedges. 1459 proven. 0 refuted. 0 times theorem prover too weak. 905 trivial. 0 not checked. [2022-07-19 12:28:13,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 12:28:13,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234910655] [2022-07-19 12:28:13,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234910655] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 12:28:13,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 12:28:13,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 12:28:13,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437054850] [2022-07-19 12:28:13,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 12:28:13,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 12:28:13,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 12:28:13,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 12:28:13,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 12:28:13,080 INFO L87 Difference]: Start difference. First operand 18630 states and 19259 transitions. Second operand has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 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-19 12:28:13,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 12:28:13,930 INFO L93 Difference]: Finished difference Result 36959 states and 38215 transitions. [2022-07-19 12:28:13,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 12:28:13,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 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 1012 [2022-07-19 12:28:13,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 12:28:13,949 INFO L225 Difference]: With dead ends: 36959 [2022-07-19 12:28:13,949 INFO L226 Difference]: Without dead ends: 18630 [2022-07-19 12:28:13,960 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-19 12:28:13,960 INFO L413 NwaCegarLoop]: 460 mSDtfsCounter, 239 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-19 12:28:13,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 491 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-19 12:28:13,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18630 states. [2022-07-19 12:28:14,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18630 to 18030. [2022-07-19 12:28:14,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18030 states, 18029 states have (on average 1.028454157191192) internal successors, (18542), 18029 states have internal predecessors, (18542), 0 states have call successors, (0), 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-19 12:28:14,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18030 states to 18030 states and 18542 transitions. [2022-07-19 12:28:14,227 INFO L78 Accepts]: Start accepts. Automaton has 18030 states and 18542 transitions. Word has length 1012 [2022-07-19 12:28:14,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 12:28:14,228 INFO L495 AbstractCegarLoop]: Abstraction has 18030 states and 18542 transitions. [2022-07-19 12:28:14,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 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-19 12:28:14,228 INFO L276 IsEmpty]: Start isEmpty. Operand 18030 states and 18542 transitions. [2022-07-19 12:28:14,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1014 [2022-07-19 12:28:14,241 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 12:28:14,241 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-19 12:28:14,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-19 12:28:14,242 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 12:28:14,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 12:28:14,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1553755039, now seen corresponding path program 1 times [2022-07-19 12:28:14,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 12:28:14,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306985085] [2022-07-19 12:28:14,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 12:28:14,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 12:28:14,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 12:28:14,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2359 backedges. 1295 proven. 0 refuted. 0 times theorem prover too weak. 1064 trivial. 0 not checked. [2022-07-19 12:28:14,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 12:28:14,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306985085] [2022-07-19 12:28:14,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306985085] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 12:28:14,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 12:28:14,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 12:28:14,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256023731] [2022-07-19 12:28:14,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 12:28:14,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 12:28:14,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 12:28:14,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 12:28:14,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 12:28:14,544 INFO L87 Difference]: Start difference. First operand 18030 states and 18542 transitions. Second operand has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 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-19 12:28:15,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 12:28:15,370 INFO L93 Difference]: Finished difference Result 30641 states and 31385 transitions. [2022-07-19 12:28:15,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 12:28:15,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 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 1013 [2022-07-19 12:28:15,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 12:28:15,386 INFO L225 Difference]: With dead ends: 30641 [2022-07-19 12:28:15,386 INFO L226 Difference]: Without dead ends: 12912 [2022-07-19 12:28:15,394 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-19 12:28:15,395 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 323 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-19 12:28:15,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 70 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-19 12:28:15,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12912 states. [2022-07-19 12:28:15,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12912 to 11409. [2022-07-19 12:28:15,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11409 states, 11408 states have (on average 1.0170056100981768) internal successors, (11602), 11408 states have internal predecessors, (11602), 0 states have call successors, (0), 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-19 12:28:15,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11409 states to 11409 states and 11602 transitions. [2022-07-19 12:28:15,486 INFO L78 Accepts]: Start accepts. Automaton has 11409 states and 11602 transitions. Word has length 1013 [2022-07-19 12:28:15,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 12:28:15,487 INFO L495 AbstractCegarLoop]: Abstraction has 11409 states and 11602 transitions. [2022-07-19 12:28:15,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 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-19 12:28:15,487 INFO L276 IsEmpty]: Start isEmpty. Operand 11409 states and 11602 transitions. [2022-07-19 12:28:15,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1167 [2022-07-19 12:28:15,500 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 12:28:15,501 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-19 12:28:15,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-19 12:28:15,501 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 12:28:15,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 12:28:15,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1574290295, now seen corresponding path program 1 times [2022-07-19 12:28:15,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 12:28:15,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140153660] [2022-07-19 12:28:15,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 12:28:15,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 12:28:15,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 12:28:16,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2271 backedges. 1488 proven. 187 refuted. 0 times theorem prover too weak. 596 trivial. 0 not checked. [2022-07-19 12:28:16,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 12:28:16,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140153660] [2022-07-19 12:28:16,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140153660] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 12:28:16,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011504894] [2022-07-19 12:28:16,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 12:28:16,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 12:28:16,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 12:28:16,012 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 12:28:16,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-19 12:28:16,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 12:28:16,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 1370 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-19 12:28:16,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 12:28:16,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2271 backedges. 999 proven. 53 refuted. 0 times theorem prover too weak. 1219 trivial. 0 not checked. [2022-07-19 12:28:16,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 12:28:16,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2271 backedges. 999 proven. 53 refuted. 0 times theorem prover too weak. 1219 trivial. 0 not checked. [2022-07-19 12:28:16,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011504894] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 12:28:16,921 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 12:28:16,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 12 [2022-07-19 12:28:16,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132367809] [2022-07-19 12:28:16,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 12:28:16,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 12:28:16,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 12:28:16,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 12:28:16,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-07-19 12:28:16,924 INFO L87 Difference]: Start difference. First operand 11409 states and 11602 transitions. Second operand has 12 states, 12 states have (on average 111.08333333333333) internal successors, (1333), 12 states have internal predecessors, (1333), 0 states have call successors, (0), 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-19 12:28:29,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 12:28:29,775 INFO L93 Difference]: Finished difference Result 34979 states and 35549 transitions. [2022-07-19 12:28:29,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-07-19 12:28:29,775 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 111.08333333333333) internal successors, (1333), 12 states have internal predecessors, (1333), 0 states have call successors, (0), 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 1166 [2022-07-19 12:28:29,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 12:28:29,796 INFO L225 Difference]: With dead ends: 34979 [2022-07-19 12:28:29,796 INFO L226 Difference]: Without dead ends: 23871 [2022-07-19 12:28:29,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2441 GetRequests, 2369 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2057 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1010, Invalid=4392, Unknown=0, NotChecked=0, Total=5402 [2022-07-19 12:28:29,803 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 14426 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 20840 mSolverCounterSat, 957 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14426 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 21797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 957 IncrementalHoareTripleChecker+Valid, 20840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2022-07-19 12:28:29,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14426 Valid, 363 Invalid, 21797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [957 Valid, 20840 Invalid, 0 Unknown, 0 Unchecked, 10.9s Time] [2022-07-19 12:28:29,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23871 states. [2022-07-19 12:28:29,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23871 to 11104. [2022-07-19 12:28:29,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11104 states, 11103 states have (on average 1.0133297307034135) internal successors, (11251), 11103 states have internal predecessors, (11251), 0 states have call successors, (0), 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-19 12:28:29,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11104 states to 11104 states and 11251 transitions. [2022-07-19 12:28:29,949 INFO L78 Accepts]: Start accepts. Automaton has 11104 states and 11251 transitions. Word has length 1166 [2022-07-19 12:28:29,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 12:28:29,950 INFO L495 AbstractCegarLoop]: Abstraction has 11104 states and 11251 transitions. [2022-07-19 12:28:29,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 111.08333333333333) internal successors, (1333), 12 states have internal predecessors, (1333), 0 states have call successors, (0), 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-19 12:28:29,951 INFO L276 IsEmpty]: Start isEmpty. Operand 11104 states and 11251 transitions. [2022-07-19 12:28:29,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1224 [2022-07-19 12:28:29,966 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 12:28:29,966 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, 6, 6, 6, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 12:28:29,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-19 12:28:30,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-19 12:28:30,168 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 12:28:30,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 12:28:30,169 INFO L85 PathProgramCache]: Analyzing trace with hash 550818549, now seen corresponding path program 1 times [2022-07-19 12:28:30,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 12:28:30,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180277762] [2022-07-19 12:28:30,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 12:28:30,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 12:28:30,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 12:28:30,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2408 backedges. 1027 proven. 0 refuted. 0 times theorem prover too weak. 1381 trivial. 0 not checked. [2022-07-19 12:28:30,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 12:28:30,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180277762] [2022-07-19 12:28:30,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180277762] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 12:28:30,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 12:28:30,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 12:28:30,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789353799] [2022-07-19 12:28:30,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 12:28:30,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 12:28:30,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 12:28:30,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 12:28:30,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-19 12:28:30,586 INFO L87 Difference]: Start difference. First operand 11104 states and 11251 transitions. Second operand has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 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-19 12:28:31,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 12:28:31,718 INFO L93 Difference]: Finished difference Result 14104 states and 14288 transitions. [2022-07-19 12:28:31,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 12:28:31,719 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 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 1223 [2022-07-19 12:28:31,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 12:28:31,719 INFO L225 Difference]: With dead ends: 14104 [2022-07-19 12:28:31,720 INFO L226 Difference]: Without dead ends: 0 [2022-07-19 12:28:31,724 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-19 12:28:31,725 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 396 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 1382 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-19 12:28:31,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 50 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1382 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-19 12:28:31,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-19 12:28:31,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-19 12:28:31,725 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-19 12:28:31,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-19 12:28:31,726 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1223 [2022-07-19 12:28:31,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 12:28:31,726 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-19 12:28:31,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 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-19 12:28:31,726 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-19 12:28:31,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-19 12:28:31,728 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 12:28:31,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-19 12:28:31,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-19 12:29:03,009 WARN L233 SmtUtils]: Spent 28.67s on a formula simplification. DAG size of input: 787 DAG size of output: 763 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-19 12:29:31,789 WARN L233 SmtUtils]: Spent 28.78s on a formula simplification. DAG size of input: 784 DAG size of output: 763 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-19 12:29:39,051 WARN L233 SmtUtils]: Spent 5.11s on a formula simplification. DAG size of input: 763 DAG size of output: 183 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-07-19 12:29:44,034 INFO L899 garLoopResultBuilder]: For program point L630(lines 630 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,034 INFO L899 garLoopResultBuilder]: For program point L1423(lines 1423 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,034 INFO L899 garLoopResultBuilder]: For program point L895(lines 895 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,034 INFO L899 garLoopResultBuilder]: For program point L1688(lines 1688 1766) no Hoare annotation was computed. [2022-07-19 12:29:44,034 INFO L899 garLoopResultBuilder]: For program point L1160(lines 1160 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,035 INFO L899 garLoopResultBuilder]: For program point L103-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,035 INFO L899 garLoopResultBuilder]: For program point L896(lines 896 904) no Hoare annotation was computed. [2022-07-19 12:29:44,035 INFO L899 garLoopResultBuilder]: For program point L896-2(lines 896 904) no Hoare annotation was computed. [2022-07-19 12:29:44,035 INFO L899 garLoopResultBuilder]: For program point L764(lines 764 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,035 INFO L899 garLoopResultBuilder]: For program point L1557(lines 1557 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,035 INFO L899 garLoopResultBuilder]: For program point L1293(lines 1293 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,035 INFO L899 garLoopResultBuilder]: For program point L104(line 104) no Hoare annotation was computed. [2022-07-19 12:29:44,035 INFO L899 garLoopResultBuilder]: For program point L1029(lines 1029 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,035 INFO L899 garLoopResultBuilder]: For program point L501(lines 501 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,035 INFO L899 garLoopResultBuilder]: For program point L106-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,035 INFO L899 garLoopResultBuilder]: For program point L371(lines 371 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,035 INFO L899 garLoopResultBuilder]: For program point L239(lines 239 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,035 INFO L899 garLoopResultBuilder]: For program point L107(line 107) no Hoare annotation was computed. [2022-07-19 12:29:44,035 INFO L899 garLoopResultBuilder]: For program point L1429(lines 1429 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,035 INFO L899 garLoopResultBuilder]: For program point L637(lines 637 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,035 INFO L899 garLoopResultBuilder]: For program point L1430(lines 1430 1440) no Hoare annotation was computed. [2022-07-19 12:29:44,035 INFO L899 garLoopResultBuilder]: For program point L1430-2(lines 1430 1440) no Hoare annotation was computed. [2022-07-19 12:29:44,035 INFO L899 garLoopResultBuilder]: For program point L1166(lines 1166 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,036 INFO L899 garLoopResultBuilder]: For program point L109-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,036 INFO L899 garLoopResultBuilder]: For program point L1695(lines 1695 1766) no Hoare annotation was computed. [2022-07-19 12:29:44,036 INFO L899 garLoopResultBuilder]: For program point L1299(lines 1299 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,036 INFO L899 garLoopResultBuilder]: For program point L110(line 110) no Hoare annotation was computed. [2022-07-19 12:29:44,036 INFO L899 garLoopResultBuilder]: For program point L771(lines 771 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,036 INFO L899 garLoopResultBuilder]: For program point L1696(lines 1696 1703) no Hoare annotation was computed. [2022-07-19 12:29:44,036 INFO L899 garLoopResultBuilder]: For program point L1696-2(lines 1696 1703) no Hoare annotation was computed. [2022-07-19 12:29:44,036 INFO L899 garLoopResultBuilder]: For program point L1564(lines 1564 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,036 INFO L899 garLoopResultBuilder]: For program point L507(lines 507 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,036 INFO L899 garLoopResultBuilder]: For program point L1300(lines 1300 1309) no Hoare annotation was computed. [2022-07-19 12:29:44,036 INFO L899 garLoopResultBuilder]: For program point L1300-2(lines 1300 1309) no Hoare annotation was computed. [2022-07-19 12:29:44,036 INFO L899 garLoopResultBuilder]: For program point L1036(lines 1036 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,036 INFO L899 garLoopResultBuilder]: For program point L244(lines 244 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,036 INFO L899 garLoopResultBuilder]: For program point L112-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,036 INFO L899 garLoopResultBuilder]: For program point L905(lines 905 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,036 INFO L899 garLoopResultBuilder]: For program point L377(lines 377 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,036 INFO L899 garLoopResultBuilder]: For program point L113(line 113) no Hoare annotation was computed. [2022-07-19 12:29:44,036 INFO L899 garLoopResultBuilder]: For program point L1172(lines 1172 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,036 INFO L899 garLoopResultBuilder]: For program point L115-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,037 INFO L899 garLoopResultBuilder]: For program point L1040(lines 1040 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,037 INFO L899 garLoopResultBuilder]: For program point L644(lines 644 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,037 INFO L899 garLoopResultBuilder]: For program point L1569(lines 1569 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,037 INFO L899 garLoopResultBuilder]: For program point L512(lines 512 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,037 INFO L899 garLoopResultBuilder]: For program point L116(line 116) no Hoare annotation was computed. [2022-07-19 12:29:44,037 INFO L899 garLoopResultBuilder]: For program point L778(lines 778 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,037 INFO L899 garLoopResultBuilder]: For program point L118-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,037 INFO L899 garLoopResultBuilder]: For program point L911(lines 911 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,037 INFO L899 garLoopResultBuilder]: For program point L1704(lines 1704 1766) no Hoare annotation was computed. [2022-07-19 12:29:44,037 INFO L899 garLoopResultBuilder]: For program point L383(lines 383 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,037 INFO L899 garLoopResultBuilder]: For program point L251(lines 251 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,037 INFO L899 garLoopResultBuilder]: For program point L119(line 119) no Hoare annotation was computed. [2022-07-19 12:29:44,037 INFO L899 garLoopResultBuilder]: For program point L1441(lines 1441 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,037 INFO L899 garLoopResultBuilder]: For program point L1045(lines 1045 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,037 INFO L899 garLoopResultBuilder]: For program point L517(lines 517 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,037 INFO L899 garLoopResultBuilder]: For program point L1310(lines 1310 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,037 INFO L899 garLoopResultBuilder]: For program point L1178(lines 1178 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,037 INFO L899 garLoopResultBuilder]: For program point L121-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,037 INFO L899 garLoopResultBuilder]: For program point L122(line 122) no Hoare annotation was computed. [2022-07-19 12:29:44,038 INFO L899 garLoopResultBuilder]: For program point L651(lines 651 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,038 INFO L899 garLoopResultBuilder]: For program point L1576(lines 1576 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,038 INFO L899 garLoopResultBuilder]: For program point L1048(lines 1048 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,038 INFO L899 garLoopResultBuilder]: For program point L784(lines 784 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,038 INFO L899 garLoopResultBuilder]: For program point L652(lines 652 661) no Hoare annotation was computed. [2022-07-19 12:29:44,038 INFO L899 garLoopResultBuilder]: For program point L652-2(lines 652 661) no Hoare annotation was computed. [2022-07-19 12:29:44,038 INFO L899 garLoopResultBuilder]: For program point L124-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,038 INFO L899 garLoopResultBuilder]: For program point L917(lines 917 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,038 INFO L899 garLoopResultBuilder]: For program point L257(lines 257 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,038 INFO L899 garLoopResultBuilder]: For program point L1182(lines 1182 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,038 INFO L899 garLoopResultBuilder]: For program point L125(line 125) no Hoare annotation was computed. [2022-07-19 12:29:44,038 INFO L899 garLoopResultBuilder]: For program point L1711(lines 1711 1766) no Hoare annotation was computed. [2022-07-19 12:29:44,038 INFO L899 garLoopResultBuilder]: For program point L390(lines 390 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,038 INFO L899 garLoopResultBuilder]: For program point L1580(lines 1580 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,038 INFO L899 garLoopResultBuilder]: For program point L1448(lines 1448 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,038 INFO L899 garLoopResultBuilder]: For program point L1316(lines 1316 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,038 INFO L899 garLoopResultBuilder]: For program point L127-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,038 INFO L899 garLoopResultBuilder]: For program point L1581(lines 1581 1591) no Hoare annotation was computed. [2022-07-19 12:29:44,038 INFO L899 garLoopResultBuilder]: For program point L524(lines 524 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,039 INFO L899 garLoopResultBuilder]: For program point L1581-2(lines 1581 1591) no Hoare annotation was computed. [2022-07-19 12:29:44,039 INFO L899 garLoopResultBuilder]: For program point L1449(lines 1449 1458) no Hoare annotation was computed. [2022-07-19 12:29:44,039 INFO L899 garLoopResultBuilder]: For program point L1449-2(lines 1449 1458) no Hoare annotation was computed. [2022-07-19 12:29:44,039 INFO L899 garLoopResultBuilder]: For program point L128(line 128) no Hoare annotation was computed. [2022-07-19 12:29:44,039 INFO L899 garLoopResultBuilder]: For program point L789(lines 789 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,039 INFO L899 garLoopResultBuilder]: For program point L1054(lines 1054 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,039 INFO L899 garLoopResultBuilder]: For program point L922(lines 922 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,039 INFO L899 garLoopResultBuilder]: For program point L394(lines 394 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,039 INFO L899 garLoopResultBuilder]: For program point L130-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,039 INFO L899 garLoopResultBuilder]: For program point L1716(lines 1716 1766) no Hoare annotation was computed. [2022-07-19 12:29:44,039 INFO L899 garLoopResultBuilder]: For program point L263(lines 263 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,039 INFO L899 garLoopResultBuilder]: For program point L1188(lines 1188 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,039 INFO L899 garLoopResultBuilder]: For program point L131(line 131) no Hoare annotation was computed. [2022-07-19 12:29:44,039 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-19 12:29:44,039 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 182) no Hoare annotation was computed. [2022-07-19 12:29:44,039 INFO L899 garLoopResultBuilder]: For program point L133-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,039 INFO L899 garLoopResultBuilder]: For program point L1719(lines 1719 1766) no Hoare annotation was computed. [2022-07-19 12:29:44,040 INFO L899 garLoopResultBuilder]: For program point L662(lines 662 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,040 INFO L899 garLoopResultBuilder]: For program point L530(lines 530 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,040 INFO L899 garLoopResultBuilder]: For program point L1323(lines 1323 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,040 INFO L899 garLoopResultBuilder]: For program point L134(line 134) no Hoare annotation was computed. [2022-07-19 12:29:44,040 INFO L899 garLoopResultBuilder]: For program point L1059(lines 1059 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,040 INFO L899 garLoopResultBuilder]: For program point L1720(lines 1720 1731) no Hoare annotation was computed. [2022-07-19 12:29:44,040 INFO L899 garLoopResultBuilder]: For program point L1720-2(lines 1720 1731) no Hoare annotation was computed. [2022-07-19 12:29:44,040 INFO L899 garLoopResultBuilder]: For program point L531(lines 531 538) no Hoare annotation was computed. [2022-07-19 12:29:44,040 INFO L899 garLoopResultBuilder]: For program point L531-2(lines 531 538) no Hoare annotation was computed. [2022-07-19 12:29:44,040 INFO L899 garLoopResultBuilder]: For program point L1060(lines 1060 1071) no Hoare annotation was computed. [2022-07-19 12:29:44,040 INFO L899 garLoopResultBuilder]: For program point L1060-2(lines 1060 1071) no Hoare annotation was computed. [2022-07-19 12:29:44,040 INFO L899 garLoopResultBuilder]: For program point L796(lines 796 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,040 INFO L899 garLoopResultBuilder]: For program point L400(lines 400 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,040 INFO L899 garLoopResultBuilder]: For program point L136-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,040 INFO L899 garLoopResultBuilder]: For program point L929(lines 929 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,040 INFO L899 garLoopResultBuilder]: For program point L401(lines 401 412) no Hoare annotation was computed. [2022-07-19 12:29:44,040 INFO L899 garLoopResultBuilder]: For program point L401-2(lines 401 412) no Hoare annotation was computed. [2022-07-19 12:29:44,040 INFO L899 garLoopResultBuilder]: For program point L1194(lines 1194 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,040 INFO L899 garLoopResultBuilder]: For program point L137(line 137) no Hoare annotation was computed. [2022-07-19 12:29:44,041 INFO L899 garLoopResultBuilder]: For program point L1459(lines 1459 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,041 INFO L899 garLoopResultBuilder]: For program point L1327(lines 1327 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,041 INFO L899 garLoopResultBuilder]: For program point L270(lines 270 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,041 INFO L899 garLoopResultBuilder]: For program point L667(lines 667 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,041 INFO L899 garLoopResultBuilder]: For program point L1592(lines 1592 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,041 INFO L899 garLoopResultBuilder]: For program point L139-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,041 INFO L899 garLoopResultBuilder]: For program point L140(line 140) no Hoare annotation was computed. [2022-07-19 12:29:44,041 INFO L899 garLoopResultBuilder]: For program point L1331(lines 1331 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,041 INFO L899 garLoopResultBuilder]: For program point L142-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,042 INFO L899 garLoopResultBuilder]: For program point L935(lines 935 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,042 INFO L899 garLoopResultBuilder]: For program point L803(lines 803 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,042 INFO L899 garLoopResultBuilder]: For program point L539(lines 539 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,042 INFO L899 garLoopResultBuilder]: For program point L1332(lines 1332 1342) no Hoare annotation was computed. [2022-07-19 12:29:44,042 INFO L899 garLoopResultBuilder]: For program point L1332-2(lines 1332 1342) no Hoare annotation was computed. [2022-07-19 12:29:44,042 INFO L899 garLoopResultBuilder]: For program point L1200(lines 1200 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,042 INFO L899 garLoopResultBuilder]: For program point L143(line 143) no Hoare annotation was computed. [2022-07-19 12:29:44,042 INFO L899 garLoopResultBuilder]: For program point L804(lines 804 813) no Hoare annotation was computed. [2022-07-19 12:29:44,042 INFO L899 garLoopResultBuilder]: For program point L804-2(lines 804 813) no Hoare annotation was computed. [2022-07-19 12:29:44,042 INFO L899 garLoopResultBuilder]: For program point L672(lines 672 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,042 INFO L899 garLoopResultBuilder]: For program point L540(lines 540 551) no Hoare annotation was computed. [2022-07-19 12:29:44,042 INFO L899 garLoopResultBuilder]: For program point L540-2(lines 540 551) no Hoare annotation was computed. [2022-07-19 12:29:44,042 INFO L899 garLoopResultBuilder]: For program point L276(lines 276 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,042 INFO L899 garLoopResultBuilder]: For program point L1466(lines 1466 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,043 INFO L899 garLoopResultBuilder]: For program point L145-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,043 INFO L899 garLoopResultBuilder]: For program point L1599(lines 1599 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,043 INFO L899 garLoopResultBuilder]: For program point L146(line 146) no Hoare annotation was computed. [2022-07-19 12:29:44,043 INFO L899 garLoopResultBuilder]: For program point L1732(lines 1732 1766) no Hoare annotation was computed. [2022-07-19 12:29:44,043 INFO L899 garLoopResultBuilder]: For program point L1072(lines 1072 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,043 INFO L899 garLoopResultBuilder]: For program point L940(lines 940 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,043 INFO L899 garLoopResultBuilder]: For program point L148-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,043 INFO L899 garLoopResultBuilder]: For program point L1073(lines 1073 1083) no Hoare annotation was computed. [2022-07-19 12:29:44,043 INFO L899 garLoopResultBuilder]: For program point L1073-2(lines 1073 1083) no Hoare annotation was computed. [2022-07-19 12:29:44,043 INFO L899 garLoopResultBuilder]: For program point L413(lines 413 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,043 INFO L899 garLoopResultBuilder]: For program point L149(line 149) no Hoare annotation was computed. [2022-07-19 12:29:44,043 INFO L899 garLoopResultBuilder]: For program point L678(lines 678 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,043 INFO L899 garLoopResultBuilder]: For program point L1471(lines 1471 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,043 INFO L899 garLoopResultBuilder]: For program point L1207(lines 1207 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,043 INFO L899 garLoopResultBuilder]: For program point L283(lines 283 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,043 INFO L899 garLoopResultBuilder]: For program point L151-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,043 INFO L899 garLoopResultBuilder]: For program point L1605(lines 1605 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,044 INFO L899 garLoopResultBuilder]: For program point L152(line 152) no Hoare annotation was computed. [2022-07-19 12:29:44,044 INFO L899 garLoopResultBuilder]: For program point L945(lines 945 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,044 INFO L899 garLoopResultBuilder]: For program point L814(lines 814 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,044 INFO L899 garLoopResultBuilder]: For program point L1739(lines 1739 1766) no Hoare annotation was computed. [2022-07-19 12:29:44,044 INFO L899 garLoopResultBuilder]: For program point L418(lines 418 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,044 INFO L899 garLoopResultBuilder]: For program point L1343(lines 1343 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,044 INFO L899 garLoopResultBuilder]: For program point L154-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,044 INFO L899 garLoopResultBuilder]: For program point L1476(lines 1476 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,045 INFO L899 garLoopResultBuilder]: For program point L155(line 155) no Hoare annotation was computed. [2022-07-19 12:29:44,045 INFO L899 garLoopResultBuilder]: For program point L552(lines 552 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,045 INFO L899 garLoopResultBuilder]: For program point L288(lines 288 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,045 INFO L899 garLoopResultBuilder]: For program point L1213(lines 1213 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,045 INFO L899 garLoopResultBuilder]: For program point L685(lines 685 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,045 INFO L899 garLoopResultBuilder]: For program point L157-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,045 INFO L899 garLoopResultBuilder]: For program point L158(line 158) no Hoare annotation was computed. [2022-07-19 12:29:44,045 INFO L899 garLoopResultBuilder]: For program point L1612(lines 1612 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,046 INFO L899 garLoopResultBuilder]: For program point L1348(lines 1348 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,046 INFO L899 garLoopResultBuilder]: For program point L1084(lines 1084 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,046 INFO L899 garLoopResultBuilder]: For program point L952(lines 952 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,046 INFO L899 garLoopResultBuilder]: For program point L1745(lines 1745 1766) no Hoare annotation was computed. [2022-07-19 12:29:44,046 INFO L899 garLoopResultBuilder]: For program point L556(lines 556 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,046 INFO L899 garLoopResultBuilder]: For program point L160-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,046 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-19 12:29:44,046 INFO L899 garLoopResultBuilder]: For program point L821(lines 821 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,047 INFO L899 garLoopResultBuilder]: For program point L557(lines 557 566) no Hoare annotation was computed. [2022-07-19 12:29:44,047 INFO L899 garLoopResultBuilder]: For program point L557-2(lines 557 566) no Hoare annotation was computed. [2022-07-19 12:29:44,047 INFO L899 garLoopResultBuilder]: For program point L425(lines 425 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,047 INFO L899 garLoopResultBuilder]: For program point L1218(lines 1218 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,047 INFO L899 garLoopResultBuilder]: For program point L161(line 161) no Hoare annotation was computed. [2022-07-19 12:29:44,047 INFO L899 garLoopResultBuilder]: For program point L1483(lines 1483 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,047 INFO L899 garLoopResultBuilder]: For program point L691(lines 691 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,047 INFO L899 garLoopResultBuilder]: For program point L1616(lines 1616 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,048 INFO L899 garLoopResultBuilder]: For program point L295(lines 295 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,048 INFO L899 garLoopResultBuilder]: For program point L163-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,048 INFO L899 garLoopResultBuilder]: For program point L164(line 164) no Hoare annotation was computed. [2022-07-19 12:29:44,048 INFO L899 garLoopResultBuilder]: For program point L1354(lines 1354 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,048 INFO L899 garLoopResultBuilder]: For program point L1222(lines 1222 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,048 INFO L899 garLoopResultBuilder]: For program point L958(lines 958 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,048 INFO L899 garLoopResultBuilder]: For program point L166-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,048 INFO L899 garLoopResultBuilder]: For program point L1091(lines 1091 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,049 INFO L899 garLoopResultBuilder]: For program point L34(lines 34 36) no Hoare annotation was computed. [2022-07-19 12:29:44,049 INFO L899 garLoopResultBuilder]: For program point L34-2(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,049 INFO L899 garLoopResultBuilder]: For program point L827(lines 827 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,049 INFO L899 garLoopResultBuilder]: For program point L1752(lines 1752 1766) no Hoare annotation was computed. [2022-07-19 12:29:44,049 INFO L899 garLoopResultBuilder]: For program point L1488(lines 1488 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,049 INFO L899 garLoopResultBuilder]: For program point L167(line 167) no Hoare annotation was computed. [2022-07-19 12:29:44,049 INFO L899 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2022-07-19 12:29:44,049 INFO L899 garLoopResultBuilder]: For program point L432(lines 432 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,050 INFO L899 garLoopResultBuilder]: For program point L697(lines 697 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,050 INFO L899 garLoopResultBuilder]: For program point L1622(lines 1622 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,050 INFO L899 garLoopResultBuilder]: For program point L169-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,050 INFO L899 garLoopResultBuilder]: For program point L37-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,050 INFO L899 garLoopResultBuilder]: For program point L1623(lines 1623 1632) no Hoare annotation was computed. [2022-07-19 12:29:44,050 INFO L899 garLoopResultBuilder]: For program point L1623-2(lines 1623 1632) no Hoare annotation was computed. [2022-07-19 12:29:44,050 INFO L899 garLoopResultBuilder]: For program point L302(lines 302 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,050 INFO L899 garLoopResultBuilder]: For program point L170(line 170) no Hoare annotation was computed. [2022-07-19 12:29:44,051 INFO L899 garLoopResultBuilder]: For program point L38(line 38) no Hoare annotation was computed. [2022-07-19 12:29:44,051 INFO L899 garLoopResultBuilder]: For program point L567(lines 567 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,051 INFO L899 garLoopResultBuilder]: For program point L1492(lines 1492 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,051 INFO L899 garLoopResultBuilder]: For program point L1360(lines 1360 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,051 INFO L899 garLoopResultBuilder]: For program point L1228(lines 1228 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,051 INFO L899 garLoopResultBuilder]: For program point L1096(lines 1096 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,051 INFO L899 garLoopResultBuilder]: For program point L568(lines 568 578) no Hoare annotation was computed. [2022-07-19 12:29:44,051 INFO L899 garLoopResultBuilder]: For program point L568-2(lines 568 578) no Hoare annotation was computed. [2022-07-19 12:29:44,052 INFO L899 garLoopResultBuilder]: For program point L1361(lines 1361 1368) no Hoare annotation was computed. [2022-07-19 12:29:44,052 INFO L899 garLoopResultBuilder]: For program point L1361-2(lines 1361 1368) no Hoare annotation was computed. [2022-07-19 12:29:44,052 INFO L899 garLoopResultBuilder]: For program point L172-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,052 INFO L899 garLoopResultBuilder]: For program point L40-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,052 INFO L899 garLoopResultBuilder]: For program point L965(lines 965 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,052 INFO L899 garLoopResultBuilder]: For program point L173(line 173) no Hoare annotation was computed. [2022-07-19 12:29:44,052 INFO L899 garLoopResultBuilder]: For program point L41(line 41) no Hoare annotation was computed. [2022-07-19 12:29:44,052 INFO L899 garLoopResultBuilder]: For program point L834(lines 834 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,053 INFO L899 garLoopResultBuilder]: For program point L1759(lines 1759 1766) no Hoare annotation was computed. [2022-07-19 12:29:44,053 INFO L899 garLoopResultBuilder]: For program point L438(lines 438 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,053 INFO L899 garLoopResultBuilder]: For program point L703(lines 703 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,053 INFO L899 garLoopResultBuilder]: For program point L175-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,053 INFO L899 garLoopResultBuilder]: For program point L43-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,053 INFO L899 garLoopResultBuilder]: For program point L704(lines 704 716) no Hoare annotation was computed. [2022-07-19 12:29:44,053 INFO L899 garLoopResultBuilder]: For program point L704-2(lines 704 716) no Hoare annotation was computed. [2022-07-19 12:29:44,053 INFO L899 garLoopResultBuilder]: For program point L176(line 176) no Hoare annotation was computed. [2022-07-19 12:29:44,054 INFO L899 garLoopResultBuilder]: For program point L1101(lines 1101 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,054 INFO L899 garLoopResultBuilder]: For program point L44(line 44) no Hoare annotation was computed. [2022-07-19 12:29:44,054 INFO L899 garLoopResultBuilder]: For program point L969(lines 969 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,054 INFO L899 garLoopResultBuilder]: For program point L1498(lines 1498 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,054 INFO L899 garLoopResultBuilder]: For program point L309(lines 309 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,054 INFO L899 garLoopResultBuilder]: For program point L1234(lines 1234 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,054 INFO L899 garLoopResultBuilder]: For program point L178-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,054 INFO L899 garLoopResultBuilder]: For program point L46-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,055 INFO L899 garLoopResultBuilder]: For program point L839(lines 839 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,055 INFO L899 garLoopResultBuilder]: For program point L443(lines 443 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,055 INFO L899 garLoopResultBuilder]: For program point L179(line 179) no Hoare annotation was computed. [2022-07-19 12:29:44,055 INFO L899 garLoopResultBuilder]: For program point L47(line 47) no Hoare annotation was computed. [2022-07-19 12:29:44,055 INFO L899 garLoopResultBuilder]: For program point L840(lines 840 849) no Hoare annotation was computed. [2022-07-19 12:29:44,055 INFO L899 garLoopResultBuilder]: For program point L840-2(lines 840 849) no Hoare annotation was computed. [2022-07-19 12:29:44,055 INFO L899 garLoopResultBuilder]: For program point L1633(lines 1633 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,055 INFO L899 garLoopResultBuilder]: For program point L1369(lines 1369 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,056 INFO L899 garLoopResultBuilder]: For program point L181-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,056 INFO L899 garLoopResultBuilder]: For program point L49-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,056 INFO L895 garLoopResultBuilder]: At program point L1767(lines 1668 1768) the Hoare annotation is: (let ((.cse33 (+ ~a4~0 86)) (.cse12 (+ ~a29~0 127))) (let ((.cse10 (<= (+ 89 ~a4~0) 0)) (.cse1 (<= 0 .cse12)) (.cse34 (<= 0 (+ ~a0~0 60))) (.cse23 (<= .cse33 0))) (let ((.cse15 (+ ~a29~0 144)) (.cse18 (or (and .cse1 .cse10) (and .cse1 .cse34 .cse23))) (.cse4 (<= 5 ~a2~0)) (.cse8 (<= ~a2~0 2)) (.cse31 (+ ~a29~0 16)) (.cse14 (= 3 ~a2~0))) (let ((.cse2 (not .cse23)) (.cse17 (<= 44 ~a29~0)) (.cse7 (<= (+ ~a0~0 147) 0)) (.cse26 (or (and .cse1 .cse23 .cse14) (and .cse10 .cse14))) (.cse6 (<= 2 ~a2~0)) (.cse19 (= ~a2~0 4)) (.cse25 (<= .cse31 0)) (.cse13 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (.cse3 (<= (+ 98 ~a0~0) 0)) (.cse27 (or (and .cse34 .cse23 .cse8) (and .cse10 .cse8))) (.cse24 (<= (+ ~a0~0 61) 0)) (.cse32 (or (and .cse18 .cse4) (and .cse10 .cse4))) (.cse16 (< 0 .cse15)) (.cse11 (= ~a2~0 1)) (.cse20 (<= ~a29~0 43)) (.cse5 (< 0 .cse33)) (.cse0 (<= (+ 42 ~a4~0) 0)) (.cse21 (<= (+ ~a0~0 99) 0)) (.cse22 (<= 0 (+ 146 ~a0~0))) (.cse9 (<= 0 (+ 599999 ~a29~0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse10 .cse11 (<= 0 (+ 44 ~a0~0)) (<= .cse12 0)) (and .cse5 .cse0 .cse7 .cse13 .cse14) (and .cse0 .cse2 .cse7 .cse4 (not (<= .cse15 0))) (and (<= (+ 216075 ~a0~0) 0) .cse0 .cse11 .cse16) (and .cse0 .cse17 .cse7 .cse4) (and .cse0 .cse1 .cse7 .cse14) (and .cse18 .cse19 .cse20) (and .cse0 .cse21 .cse2 .cse22 .cse14) (and .cse5 .cse0 .cse7 .cse19 .cse9) (and .cse11 .cse23 .cse24) (and .cse5 .cse0 .cse3 (<= (+ ~a29~0 120873) 0) .cse14) (and (<= 0 (+ 97 ~a0~0)) .cse0 .cse11 .cse16 .cse25 .cse24) (and .cse0 .cse17 .cse7 .cse11) (and .cse26 .cse24) (and .cse0 .cse3 .cse22 .cse11 .cse20 .cse9) (and .cse26 .cse9) (and .cse10 .cse22 .cse24) (and .cse6 .cse27 .cse9) (and .cse19 .cse25 (or (and .cse10 .cse22) (and .cse10 (exists ((v_~a29~0_899 Int)) (let ((.cse29 (* 9 v_~a29~0_899))) (and (let ((.cse28 (mod (+ (div .cse29 10) 1) 63))) (or (<= .cse28 (+ ~a29~0 80)) (and (<= .cse28 (+ ~a29~0 143)) (not (= .cse28 0))))) (not (= (mod .cse29 10) 0)) (< .cse29 0)))))) .cse9) (let ((.cse30 (< 0 .cse31))) (and .cse5 (or .cse13 .cse30) .cse0 (= 2 ~a2~0) .cse1 .cse3 (or .cse30 (not (= |ULTIMATE.start_calculate_output2_~input#1| 4))))) (and .cse27 .cse24) (and .cse18 .cse24) (and .cse32 .cse24) (and .cse32 .cse16) (and .cse5 .cse0 .cse1 .cse11 .cse20) (and .cse5 .cse0 .cse21 .cse22 .cse4 .cse9)))))) [2022-07-19 12:29:44,056 INFO L899 garLoopResultBuilder]: For program point L182(line 182) no Hoare annotation was computed. [2022-07-19 12:29:44,057 INFO L899 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2022-07-19 12:29:44,057 INFO L899 garLoopResultBuilder]: For program point L579(lines 579 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,057 INFO L899 garLoopResultBuilder]: For program point L1504(lines 1504 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,057 INFO L899 garLoopResultBuilder]: For program point L1108(lines 1108 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,057 INFO L899 garLoopResultBuilder]: For program point L976(lines 976 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,057 INFO L899 garLoopResultBuilder]: For program point L316(lines 316 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,057 INFO L899 garLoopResultBuilder]: For program point L1241(lines 1241 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,057 INFO L899 garLoopResultBuilder]: For program point L184-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,058 INFO L899 garLoopResultBuilder]: For program point L1109(lines 1109 1117) no Hoare annotation was computed. [2022-07-19 12:29:44,058 INFO L899 garLoopResultBuilder]: For program point L52-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,058 INFO L899 garLoopResultBuilder]: For program point L1109-2(lines 1109 1117) no Hoare annotation was computed. [2022-07-19 12:29:44,058 INFO L902 garLoopResultBuilder]: At program point L1770(lines 1770 1786) the Hoare annotation is: true [2022-07-19 12:29:44,058 INFO L899 garLoopResultBuilder]: For program point L449(lines 449 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,058 INFO L899 garLoopResultBuilder]: For program point L317(lines 317 329) no Hoare annotation was computed. [2022-07-19 12:29:44,058 INFO L899 garLoopResultBuilder]: For program point L317-2(lines 317 329) no Hoare annotation was computed. [2022-07-19 12:29:44,058 INFO L899 garLoopResultBuilder]: For program point L185(line 185) no Hoare annotation was computed. [2022-07-19 12:29:44,059 INFO L899 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2022-07-19 12:29:44,059 INFO L899 garLoopResultBuilder]: For program point L1639(lines 1639 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,059 INFO L899 garLoopResultBuilder]: For program point L1375(lines 1375 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,059 INFO L899 garLoopResultBuilder]: For program point L187-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,059 INFO L899 garLoopResultBuilder]: For program point L55-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,059 INFO L899 garLoopResultBuilder]: For program point L584(lines 584 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,059 INFO L899 garLoopResultBuilder]: For program point L188(line 188) no Hoare annotation was computed. [2022-07-19 12:29:44,060 INFO L899 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2022-07-19 12:29:44,060 INFO L899 garLoopResultBuilder]: For program point L717(lines 717 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,060 INFO L899 garLoopResultBuilder]: For program point L585(lines 585 596) no Hoare annotation was computed. [2022-07-19 12:29:44,060 INFO L899 garLoopResultBuilder]: For program point L585-2(lines 585 596) no Hoare annotation was computed. [2022-07-19 12:29:44,060 INFO L899 garLoopResultBuilder]: For program point L850(lines 850 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,060 INFO L899 garLoopResultBuilder]: For program point L1511(lines 1511 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,060 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-19 12:29:44,060 INFO L899 garLoopResultBuilder]: For program point L1247(lines 1247 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,061 INFO L899 garLoopResultBuilder]: For program point L190-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,061 INFO L899 garLoopResultBuilder]: For program point L58-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,061 INFO L899 garLoopResultBuilder]: For program point L983(lines 983 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,061 INFO L895 garLoopResultBuilder]: At program point L1776-2(lines 1776 1785) the Hoare annotation is: (let ((.cse35 (+ ~a4~0 86)) (.cse12 (+ ~a29~0 127))) (let ((.cse10 (<= (+ 89 ~a4~0) 0)) (.cse1 (<= 0 .cse12)) (.cse34 (<= 0 (+ ~a0~0 60))) (.cse26 (<= .cse35 0)) (.cse36 (+ ~a29~0 144))) (let ((.cse20 (<= .cse36 0)) (.cse13 (or (and .cse1 .cse10) (and .cse1 .cse34 .cse26))) (.cse4 (<= 5 ~a2~0)) (.cse8 (<= ~a2~0 2)) (.cse19 (= 3 ~a2~0))) (let ((.cse14 (<= 4 ~a2~0)) (.cse23 (<= (+ ~a0~0 99) 0)) (.cse18 (< 0 .cse36)) (.cse22 (<= 44 ~a29~0)) (.cse7 (<= (+ ~a0~0 147) 0)) (.cse5 (< 0 .cse35)) (.cse21 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (.cse3 (<= (+ 98 ~a0~0) 0)) (.cse0 (<= (+ 42 ~a4~0) 0)) (.cse2 (not .cse26)) (.cse15 (<= ~a29~0 43)) (.cse29 (or (and .cse1 .cse26 .cse19) (and .cse10 .cse19))) (.cse11 (= ~a2~0 1)) (.cse6 (<= 2 ~a2~0)) (.cse25 (= ~a2~0 4)) (.cse27 (<= (+ ~a29~0 16) 0)) (.cse24 (<= 0 (+ 146 ~a0~0))) (.cse9 (<= 0 (+ 599999 ~a29~0))) (.cse30 (or (and .cse34 .cse26 .cse8) (and .cse10 .cse8))) (.cse16 (<= (+ ~a0~0 61) 0)) (.cse33 (or (and .cse13 .cse4) (and .cse10 .cse4))) (.cse17 (not .cse20))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse10 .cse11 (<= 0 (+ 44 ~a0~0)) (<= .cse12 0)) (and .cse13 .cse14 .cse15) (and .cse1 .cse10 .cse16) (and .cse0 .cse2 .cse7 .cse4 .cse17) (and (<= (+ 216075 ~a0~0) 0) .cse0 .cse11 .cse18) (and .cse0 (or (and .cse5 .cse7 .cse19 .cse20) (and .cse2 .cse7 .cse21 .cse19))) (and .cse0 .cse22 .cse7 .cse4) (and .cse0 .cse1 .cse7 .cse19) (and .cse5 .cse0 .cse23 .cse24 (not .cse25) .cse14 .cse9) (and .cse0 .cse23 .cse2 .cse24 .cse19) (and .cse5 .cse0 .cse7 .cse25 .cse9) (and .cse11 .cse26 .cse16) (and .cse5 .cse0 .cse3 (<= (+ ~a29~0 120873) 0) .cse19) (and (<= 0 (+ 97 ~a0~0)) .cse0 .cse11 .cse18 .cse27 .cse16) (and .cse0 .cse22 .cse7 .cse11) (let ((.cse28 (not .cse27))) (and .cse5 .cse0 .cse6 .cse1 .cse3 (or .cse28 (not (= |ULTIMATE.start_calculate_output2_~input#1| 4))) (or .cse28 .cse21) .cse8)) (and .cse29 .cse16) (and .cse0 .cse3 .cse24 .cse11 .cse15 .cse9) (and .cse0 .cse1 .cse2 .cse11 .cse15) (and .cse29 .cse9) (and .cse11 .cse26 .cse20) (and .cse10 .cse24 .cse16) (and .cse6 .cse30 .cse9) (and .cse25 .cse27 (or (and .cse10 .cse24) (and .cse10 (exists ((v_~a29~0_899 Int)) (let ((.cse32 (* 9 v_~a29~0_899))) (and (let ((.cse31 (mod (+ (div .cse32 10) 1) 63))) (or (<= .cse31 (+ ~a29~0 80)) (and (<= .cse31 (+ ~a29~0 143)) (not (= .cse31 0))))) (not (= (mod .cse32 10) 0)) (< .cse32 0)))))) .cse9) (and .cse30 .cse16) (and .cse33 .cse16) (and .cse33 .cse17)))))) [2022-07-19 12:29:44,061 INFO L899 garLoopResultBuilder]: For program point L455(lines 455 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,062 INFO L899 garLoopResultBuilder]: For program point L191(line 191) no Hoare annotation was computed. [2022-07-19 12:29:44,062 INFO L899 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2022-07-19 12:29:44,062 INFO L899 garLoopResultBuilder]: For program point L1645(lines 1645 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,062 INFO L899 garLoopResultBuilder]: For program point L1381(lines 1381 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,062 INFO L899 garLoopResultBuilder]: For program point L193-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,062 INFO L899 garLoopResultBuilder]: For program point L1118(lines 1118 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,062 INFO L899 garLoopResultBuilder]: For program point L61-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,062 INFO L899 garLoopResultBuilder]: For program point L722(lines 722 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,062 INFO L899 garLoopResultBuilder]: For program point L194(line 194) no Hoare annotation was computed. [2022-07-19 12:29:44,063 INFO L899 garLoopResultBuilder]: For program point L62(line 62) no Hoare annotation was computed. [2022-07-19 12:29:44,063 INFO L899 garLoopResultBuilder]: For program point L855(lines 855 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,063 INFO L899 garLoopResultBuilder]: For program point L459(lines 459 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,063 INFO L899 garLoopResultBuilder]: For program point L1781(line 1781) no Hoare annotation was computed. [2022-07-19 12:29:44,063 INFO L899 garLoopResultBuilder]: For program point L1253(lines 1253 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,063 INFO L899 garLoopResultBuilder]: For program point L196-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,063 INFO L899 garLoopResultBuilder]: For program point L64-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,064 INFO L899 garLoopResultBuilder]: For program point L989(lines 989 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,064 INFO L899 garLoopResultBuilder]: For program point L1650(lines 1650 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,064 INFO L899 garLoopResultBuilder]: For program point L1518(lines 1518 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,064 INFO L899 garLoopResultBuilder]: For program point L197(line 197) no Hoare annotation was computed. [2022-07-19 12:29:44,064 INFO L899 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2022-07-19 12:29:44,064 INFO L899 garLoopResultBuilder]: For program point L330(lines 330 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,064 INFO L899 garLoopResultBuilder]: For program point L1388(lines 1388 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,064 INFO L899 garLoopResultBuilder]: For program point L199-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,065 INFO L899 garLoopResultBuilder]: For program point L67-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,065 INFO L899 garLoopResultBuilder]: For program point L728(lines 728 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,065 INFO L899 garLoopResultBuilder]: For program point L1521(lines 1521 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,065 INFO L899 garLoopResultBuilder]: For program point L200(line 200) no Hoare annotation was computed. [2022-07-19 12:29:44,065 INFO L899 garLoopResultBuilder]: For program point L1125(lines 1125 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,065 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2022-07-19 12:29:44,065 INFO L899 garLoopResultBuilder]: For program point L861(lines 861 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,065 INFO L899 garLoopResultBuilder]: For program point L597(lines 597 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,066 INFO L899 garLoopResultBuilder]: For program point L466(lines 466 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,066 INFO L899 garLoopResultBuilder]: For program point L1259(lines 1259 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,066 INFO L899 garLoopResultBuilder]: For program point L202-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,066 INFO L899 garLoopResultBuilder]: For program point L70-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,066 INFO L899 garLoopResultBuilder]: For program point L995(lines 995 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,066 INFO L899 garLoopResultBuilder]: For program point L203(line 203) no Hoare annotation was computed. [2022-07-19 12:29:44,066 INFO L899 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2022-07-19 12:29:44,066 INFO L899 garLoopResultBuilder]: For program point L1657(lines 1657 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,067 INFO L899 garLoopResultBuilder]: For program point L865(lines 865 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,067 INFO L899 garLoopResultBuilder]: For program point L1526(lines 1526 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,067 INFO L899 garLoopResultBuilder]: For program point L337(lines 337 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,067 INFO L899 garLoopResultBuilder]: For program point L205-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,067 INFO L899 garLoopResultBuilder]: For program point L73-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,067 INFO L899 garLoopResultBuilder]: For program point L1395(lines 1395 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,067 INFO L899 garLoopResultBuilder]: For program point L206(line 206) no Hoare annotation was computed. [2022-07-19 12:29:44,067 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2022-07-19 12:29:44,068 INFO L899 garLoopResultBuilder]: For program point L735(lines 735 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,068 INFO L899 garLoopResultBuilder]: For program point L1132(lines 1132 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,068 INFO L899 garLoopResultBuilder]: For program point L604(lines 604 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,068 INFO L899 garLoopResultBuilder]: For program point L472(lines 472 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,068 INFO L899 garLoopResultBuilder]: For program point L1265(lines 1265 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,068 INFO L899 garLoopResultBuilder]: For program point L208-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,068 INFO L899 garLoopResultBuilder]: For program point L76-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,069 INFO L899 garLoopResultBuilder]: For program point L605(lines 605 615) no Hoare annotation was computed. [2022-07-19 12:29:44,069 INFO L899 garLoopResultBuilder]: For program point L605-2(lines 605 615) no Hoare annotation was computed. [2022-07-19 12:29:44,069 INFO L899 garLoopResultBuilder]: For program point L1398(lines 1398 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,069 INFO L899 garLoopResultBuilder]: For program point L209(line 209) no Hoare annotation was computed. [2022-07-19 12:29:44,069 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2022-07-19 12:29:44,069 INFO L899 garLoopResultBuilder]: For program point L1002(lines 1002 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,069 INFO L899 garLoopResultBuilder]: For program point L1532(lines 1532 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,069 INFO L899 garLoopResultBuilder]: For program point L343(lines 343 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,070 INFO L899 garLoopResultBuilder]: For program point L211-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,070 INFO L899 garLoopResultBuilder]: For program point L79-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,070 INFO L899 garLoopResultBuilder]: For program point L872(lines 872 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,070 INFO L895 garLoopResultBuilder]: At program point L1665(lines 33 1666) the Hoare annotation is: (let ((.cse35 (+ ~a4~0 86)) (.cse12 (+ ~a29~0 127))) (let ((.cse10 (<= (+ 89 ~a4~0) 0)) (.cse1 (<= 0 .cse12)) (.cse34 (<= 0 (+ ~a0~0 60))) (.cse26 (<= .cse35 0)) (.cse36 (+ ~a29~0 144))) (let ((.cse20 (<= .cse36 0)) (.cse13 (or (and .cse1 .cse10) (and .cse1 .cse34 .cse26))) (.cse4 (<= 5 ~a2~0)) (.cse8 (<= ~a2~0 2)) (.cse19 (= 3 ~a2~0))) (let ((.cse14 (<= 4 ~a2~0)) (.cse23 (<= (+ ~a0~0 99) 0)) (.cse18 (< 0 .cse36)) (.cse22 (<= 44 ~a29~0)) (.cse7 (<= (+ ~a0~0 147) 0)) (.cse5 (< 0 .cse35)) (.cse21 (not (= |ULTIMATE.start_calculate_output_~input#1| 4))) (.cse3 (<= (+ 98 ~a0~0) 0)) (.cse0 (<= (+ 42 ~a4~0) 0)) (.cse2 (not .cse26)) (.cse15 (<= ~a29~0 43)) (.cse29 (or (and .cse1 .cse26 .cse19) (and .cse10 .cse19))) (.cse11 (= ~a2~0 1)) (.cse6 (<= 2 ~a2~0)) (.cse25 (= ~a2~0 4)) (.cse27 (<= (+ ~a29~0 16) 0)) (.cse24 (<= 0 (+ 146 ~a0~0))) (.cse9 (<= 0 (+ 599999 ~a29~0))) (.cse30 (or (and .cse34 .cse26 .cse8) (and .cse10 .cse8))) (.cse16 (<= (+ ~a0~0 61) 0)) (.cse33 (or (and .cse13 .cse4) (and .cse10 .cse4))) (.cse17 (not .cse20))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse10 .cse11 (<= 0 (+ 44 ~a0~0)) (<= .cse12 0)) (and .cse13 .cse14 .cse15) (and .cse1 .cse10 .cse16) (and .cse0 .cse2 .cse7 .cse4 .cse17) (and (<= (+ 216075 ~a0~0) 0) .cse0 .cse11 .cse18) (and .cse0 (or (and .cse5 .cse7 .cse19 .cse20) (and .cse2 .cse7 .cse21 .cse19))) (and .cse0 .cse22 .cse7 .cse4) (and .cse0 .cse1 .cse7 .cse19) (and .cse5 .cse0 .cse23 .cse24 (not .cse25) .cse14 .cse9) (and .cse0 .cse23 .cse2 .cse24 .cse19) (and .cse5 .cse0 .cse7 .cse25 .cse9) (and .cse11 .cse26 .cse16) (and .cse5 .cse0 .cse3 (<= (+ ~a29~0 120873) 0) .cse19) (and (<= 0 (+ 97 ~a0~0)) .cse0 .cse11 .cse18 .cse27 .cse16) (and .cse0 .cse22 .cse7 .cse11) (let ((.cse28 (not .cse27))) (and .cse5 .cse0 .cse6 .cse1 .cse3 (or .cse28 (not (= |ULTIMATE.start_calculate_output2_~input#1| 4))) (or .cse28 .cse21) .cse8)) (and .cse29 .cse16) (and .cse0 .cse3 .cse24 .cse11 .cse15 .cse9) (and .cse0 .cse1 .cse2 .cse11 .cse15) (and .cse29 .cse9) (and .cse11 .cse26 .cse20) (and .cse10 .cse24 .cse16) (and .cse6 .cse30 .cse9) (and .cse25 .cse27 (or (and .cse10 .cse24) (and .cse10 (exists ((v_~a29~0_899 Int)) (let ((.cse32 (* 9 v_~a29~0_899))) (and (let ((.cse31 (mod (+ (div .cse32 10) 1) 63))) (or (<= .cse31 (+ ~a29~0 80)) (and (<= .cse31 (+ ~a29~0 143)) (not (= .cse31 0))))) (not (= (mod .cse32 10) 0)) (< .cse32 0)))))) .cse9) (and .cse30 .cse16) (and .cse33 .cse16) (and .cse33 .cse17)))))) [2022-07-19 12:29:44,070 INFO L899 garLoopResultBuilder]: For program point L212(line 212) no Hoare annotation was computed. [2022-07-19 12:29:44,071 INFO L899 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2022-07-19 12:29:44,071 INFO L899 garLoopResultBuilder]: For program point L1138(lines 1138 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,071 INFO L899 garLoopResultBuilder]: For program point L742(lines 742 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,071 INFO L899 garLoopResultBuilder]: For program point L478(lines 478 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,071 INFO L899 garLoopResultBuilder]: For program point L346(lines 346 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,071 INFO L899 garLoopResultBuilder]: For program point L1271(lines 1271 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,071 INFO L899 garLoopResultBuilder]: For program point L214-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,071 INFO L899 garLoopResultBuilder]: For program point L82-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,072 INFO L899 garLoopResultBuilder]: For program point L1404(lines 1404 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,072 INFO L899 garLoopResultBuilder]: For program point L215(line 215) no Hoare annotation was computed. [2022-07-19 12:29:44,072 INFO L899 garLoopResultBuilder]: For program point L83(line 83) no Hoare annotation was computed. [2022-07-19 12:29:44,072 INFO L899 garLoopResultBuilder]: For program point L1008(lines 1008 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,072 INFO L899 garLoopResultBuilder]: For program point L1405(lines 1405 1417) no Hoare annotation was computed. [2022-07-19 12:29:44,072 INFO L899 garLoopResultBuilder]: For program point L1405-2(lines 1405 1417) no Hoare annotation was computed. [2022-07-19 12:29:44,072 INFO L899 garLoopResultBuilder]: For program point L745(lines 745 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,072 INFO L899 garLoopResultBuilder]: For program point L1538(lines 1538 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,073 INFO L899 garLoopResultBuilder]: For program point L1274(lines 1274 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,073 INFO L899 garLoopResultBuilder]: For program point L85-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,073 INFO L899 garLoopResultBuilder]: For program point L878(lines 878 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,073 INFO L899 garLoopResultBuilder]: For program point L1671(lines 1671 1766) no Hoare annotation was computed. [2022-07-19 12:29:44,073 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-19 12:29:44,073 INFO L899 garLoopResultBuilder]: For program point L86(line 86) no Hoare annotation was computed. [2022-07-19 12:29:44,073 INFO L899 garLoopResultBuilder]: For program point L351(lines 351 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,074 INFO L899 garLoopResultBuilder]: For program point L1144(lines 1144 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,074 INFO L899 garLoopResultBuilder]: For program point L616(lines 616 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,074 INFO L899 garLoopResultBuilder]: For program point L484(lines 484 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,074 INFO L899 garLoopResultBuilder]: For program point L352(lines 352 359) no Hoare annotation was computed. [2022-07-19 12:29:44,074 INFO L899 garLoopResultBuilder]: For program point L352-2(lines 352 359) no Hoare annotation was computed. [2022-07-19 12:29:44,074 INFO L899 garLoopResultBuilder]: For program point L1145(lines 1145 1154) no Hoare annotation was computed. [2022-07-19 12:29:44,074 INFO L899 garLoopResultBuilder]: For program point L88-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,074 INFO L899 garLoopResultBuilder]: For program point L1145-2(lines 1145 1154) no Hoare annotation was computed. [2022-07-19 12:29:44,075 INFO L899 garLoopResultBuilder]: For program point L89(line 89) no Hoare annotation was computed. [2022-07-19 12:29:44,075 INFO L899 garLoopResultBuilder]: For program point L1014(lines 1014 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,075 INFO L899 garLoopResultBuilder]: For program point L1543(lines 1543 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,075 INFO L899 garLoopResultBuilder]: For program point L91-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,075 INFO L899 garLoopResultBuilder]: For program point L884(lines 884 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,075 INFO L899 garLoopResultBuilder]: For program point L752(lines 752 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,075 INFO L899 garLoopResultBuilder]: For program point L1281(lines 1281 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,075 INFO L899 garLoopResultBuilder]: For program point L224(lines 224 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,076 INFO L899 garLoopResultBuilder]: For program point L92(line 92) no Hoare annotation was computed. [2022-07-19 12:29:44,076 INFO L899 garLoopResultBuilder]: For program point L1678(lines 1678 1766) no Hoare annotation was computed. [2022-07-19 12:29:44,076 INFO L899 garLoopResultBuilder]: For program point L489(lines 489 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,076 INFO L899 garLoopResultBuilder]: For program point L94-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,076 INFO L899 garLoopResultBuilder]: For program point L623(lines 623 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,076 INFO L899 garLoopResultBuilder]: For program point L95(line 95) no Hoare annotation was computed. [2022-07-19 12:29:44,076 INFO L899 garLoopResultBuilder]: For program point L360(lines 360 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,076 INFO L899 garLoopResultBuilder]: For program point L1021(lines 1021 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,077 INFO L899 garLoopResultBuilder]: For program point L1682(lines 1682 1766) no Hoare annotation was computed. [2022-07-19 12:29:44,077 INFO L899 garLoopResultBuilder]: For program point L1550(lines 1550 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,077 INFO L899 garLoopResultBuilder]: For program point L1418(lines 1418 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,077 INFO L899 garLoopResultBuilder]: For program point L229(lines 229 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,077 INFO L899 garLoopResultBuilder]: For program point L97-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,077 INFO L899 garLoopResultBuilder]: For program point L890(lines 890 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,077 INFO L899 garLoopResultBuilder]: For program point L758(lines 758 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,077 INFO L899 garLoopResultBuilder]: For program point L1287(lines 1287 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,077 INFO L899 garLoopResultBuilder]: For program point L230(lines 230 238) no Hoare annotation was computed. [2022-07-19 12:29:44,078 INFO L899 garLoopResultBuilder]: For program point L230-2(lines 230 238) no Hoare annotation was computed. [2022-07-19 12:29:44,078 INFO L899 garLoopResultBuilder]: For program point L1155(lines 1155 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,078 INFO L899 garLoopResultBuilder]: For program point L98(line 98) no Hoare annotation was computed. [2022-07-19 12:29:44,078 INFO L899 garLoopResultBuilder]: For program point L496(lines 496 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,078 INFO L899 garLoopResultBuilder]: For program point L100-1(lines 33 1666) no Hoare annotation was computed. [2022-07-19 12:29:44,078 INFO L899 garLoopResultBuilder]: For program point L365(lines 365 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,078 INFO L899 garLoopResultBuilder]: For program point L101(line 101) no Hoare annotation was computed. [2022-07-19 12:29:44,078 INFO L899 garLoopResultBuilder]: For program point L1026(lines 1026 1664) no Hoare annotation was computed. [2022-07-19 12:29:44,082 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, 1, 1, 1, 1, 1] [2022-07-19 12:29:44,083 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 12:29:44,094 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,095 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,096 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,096 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,096 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,104 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,105 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,105 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,105 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,105 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,109 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,109 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,109 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,110 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,110 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,112 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,113 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,113 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,113 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,113 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,115 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,116 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,116 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,116 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,116 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,118 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,118 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,119 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,119 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,119 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 12:29:44 BoogieIcfgContainer [2022-07-19 12:29:44,121 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 12:29:44,122 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 12:29:44,122 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 12:29:44,122 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 12:29:44,123 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 12:27:14" (3/4) ... [2022-07-19 12:29:44,125 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-19 12:29:44,152 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-07-19 12:29:44,154 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-19 12:29:44,156 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-19 12:29:44,158 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-19 12:29:44,182 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((42 + a4 <= 0 && 0 <= a29 + 127) && !(a4 + 86 <= 0)) && 98 + a0 <= 0) && 5 <= a2) || (((((0 < a4 + 86 && 42 + a4 <= 0) && 2 <= a2) && a0 + 147 <= 0) && a2 <= 2) && 0 <= 599999 + a29)) || ((((0 <= a29 + 127 && 89 + a4 <= 0) && a2 == 1) && 0 <= 44 + a0) && a29 + 127 <= 0)) || ((((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && 4 <= a2) && a29 <= 43)) || ((0 <= a29 + 127 && 89 + a4 <= 0) && a0 + 61 <= 0)) || ((((42 + a4 <= 0 && !(a4 + 86 <= 0)) && a0 + 147 <= 0) && 5 <= a2) && !(a29 + 144 <= 0))) || (((216075 + a0 <= 0 && 42 + a4 <= 0) && a2 == 1) && 0 < a29 + 144)) || (42 + a4 <= 0 && ((((0 < a4 + 86 && a0 + 147 <= 0) && 3 == a2) && a29 + 144 <= 0) || (((!(a4 + 86 <= 0) && a0 + 147 <= 0) && !(input == 4)) && 3 == a2)))) || (((42 + a4 <= 0 && 44 <= a29) && a0 + 147 <= 0) && 5 <= a2)) || (((42 + a4 <= 0 && 0 <= a29 + 127) && a0 + 147 <= 0) && 3 == a2)) || ((((((0 < a4 + 86 && 42 + a4 <= 0) && a0 + 99 <= 0) && 0 <= 146 + a0) && !(a2 == 4)) && 4 <= a2) && 0 <= 599999 + a29)) || ((((42 + a4 <= 0 && a0 + 99 <= 0) && !(a4 + 86 <= 0)) && 0 <= 146 + a0) && 3 == a2)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && a0 + 147 <= 0) && a2 == 4) && 0 <= 599999 + a29)) || ((a2 == 1 && a4 + 86 <= 0) && a0 + 61 <= 0)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && 98 + a0 <= 0) && a29 + 120873 <= 0) && 3 == a2)) || (((((0 <= 97 + a0 && 42 + a4 <= 0) && a2 == 1) && 0 < a29 + 144) && a29 + 16 <= 0) && a0 + 61 <= 0)) || (((42 + a4 <= 0 && 44 <= a29) && a0 + 147 <= 0) && a2 == 1)) || (((((((0 < a4 + 86 && 42 + a4 <= 0) && 2 <= a2) && 0 <= a29 + 127) && 98 + a0 <= 0) && (!(a29 + 16 <= 0) || !(input == 4))) && (!(a29 + 16 <= 0) || !(input == 4))) && a2 <= 2)) || ((((0 <= a29 + 127 && a4 + 86 <= 0) && 3 == a2) || (89 + a4 <= 0 && 3 == a2)) && a0 + 61 <= 0)) || (((((42 + a4 <= 0 && 98 + a0 <= 0) && 0 <= 146 + a0) && a2 == 1) && a29 <= 43) && 0 <= 599999 + a29)) || ((((42 + a4 <= 0 && 0 <= a29 + 127) && !(a4 + 86 <= 0)) && a2 == 1) && a29 <= 43)) || ((((0 <= a29 + 127 && a4 + 86 <= 0) && 3 == a2) || (89 + a4 <= 0 && 3 == a2)) && 0 <= 599999 + a29)) || ((a2 == 1 && a4 + 86 <= 0) && a29 + 144 <= 0)) || ((89 + a4 <= 0 && 0 <= 146 + a0) && a0 + 61 <= 0)) || ((2 <= a2 && (((0 <= a0 + 60 && a4 + 86 <= 0) && a2 <= 2) || (89 + a4 <= 0 && a2 <= 2))) && 0 <= 599999 + a29)) || (((a2 == 4 && a29 + 16 <= 0) && ((89 + a4 <= 0 && 0 <= 146 + a0) || (89 + a4 <= 0 && (\exists v_~a29~0_899 : int :: (((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 80 || ((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 143 && !((9 * v_~a29~0_899 / 10 + 1) % 63 == 0))) && !(9 * v_~a29~0_899 % 10 == 0)) && 9 * v_~a29~0_899 < 0)))) && 0 <= 599999 + a29)) || ((((0 <= a0 + 60 && a4 + 86 <= 0) && a2 <= 2) || (89 + a4 <= 0 && a2 <= 2)) && a0 + 61 <= 0)) || (((((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && 5 <= a2) || (89 + a4 <= 0 && 5 <= a2)) && a0 + 61 <= 0)) || (((((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && 5 <= a2) || (89 + a4 <= 0 && 5 <= a2)) && !(a29 + 144 <= 0)) [2022-07-19 12:29:44,187 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((42 + a4 <= 0 && 0 <= a29 + 127) && !(a4 + 86 <= 0)) && 98 + a0 <= 0) && 5 <= a2) || (((((0 < a4 + 86 && 42 + a4 <= 0) && 2 <= a2) && a0 + 147 <= 0) && a2 <= 2) && 0 <= 599999 + a29)) || ((((0 <= a29 + 127 && 89 + a4 <= 0) && a2 == 1) && 0 <= 44 + a0) && a29 + 127 <= 0)) || ((((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && 4 <= a2) && a29 <= 43)) || ((0 <= a29 + 127 && 89 + a4 <= 0) && a0 + 61 <= 0)) || ((((42 + a4 <= 0 && !(a4 + 86 <= 0)) && a0 + 147 <= 0) && 5 <= a2) && !(a29 + 144 <= 0))) || (((216075 + a0 <= 0 && 42 + a4 <= 0) && a2 == 1) && 0 < a29 + 144)) || (42 + a4 <= 0 && ((((0 < a4 + 86 && a0 + 147 <= 0) && 3 == a2) && a29 + 144 <= 0) || (((!(a4 + 86 <= 0) && a0 + 147 <= 0) && !(input == 4)) && 3 == a2)))) || (((42 + a4 <= 0 && 44 <= a29) && a0 + 147 <= 0) && 5 <= a2)) || (((42 + a4 <= 0 && 0 <= a29 + 127) && a0 + 147 <= 0) && 3 == a2)) || ((((((0 < a4 + 86 && 42 + a4 <= 0) && a0 + 99 <= 0) && 0 <= 146 + a0) && !(a2 == 4)) && 4 <= a2) && 0 <= 599999 + a29)) || ((((42 + a4 <= 0 && a0 + 99 <= 0) && !(a4 + 86 <= 0)) && 0 <= 146 + a0) && 3 == a2)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && a0 + 147 <= 0) && a2 == 4) && 0 <= 599999 + a29)) || ((a2 == 1 && a4 + 86 <= 0) && a0 + 61 <= 0)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && 98 + a0 <= 0) && a29 + 120873 <= 0) && 3 == a2)) || (((((0 <= 97 + a0 && 42 + a4 <= 0) && a2 == 1) && 0 < a29 + 144) && a29 + 16 <= 0) && a0 + 61 <= 0)) || (((42 + a4 <= 0 && 44 <= a29) && a0 + 147 <= 0) && a2 == 1)) || (((((((0 < a4 + 86 && 42 + a4 <= 0) && 2 <= a2) && 0 <= a29 + 127) && 98 + a0 <= 0) && (!(a29 + 16 <= 0) || !(input == 4))) && (!(a29 + 16 <= 0) || !(input == 4))) && a2 <= 2)) || ((((0 <= a29 + 127 && a4 + 86 <= 0) && 3 == a2) || (89 + a4 <= 0 && 3 == a2)) && a0 + 61 <= 0)) || (((((42 + a4 <= 0 && 98 + a0 <= 0) && 0 <= 146 + a0) && a2 == 1) && a29 <= 43) && 0 <= 599999 + a29)) || ((((42 + a4 <= 0 && 0 <= a29 + 127) && !(a4 + 86 <= 0)) && a2 == 1) && a29 <= 43)) || ((((0 <= a29 + 127 && a4 + 86 <= 0) && 3 == a2) || (89 + a4 <= 0 && 3 == a2)) && 0 <= 599999 + a29)) || ((a2 == 1 && a4 + 86 <= 0) && a29 + 144 <= 0)) || ((89 + a4 <= 0 && 0 <= 146 + a0) && a0 + 61 <= 0)) || ((2 <= a2 && (((0 <= a0 + 60 && a4 + 86 <= 0) && a2 <= 2) || (89 + a4 <= 0 && a2 <= 2))) && 0 <= 599999 + a29)) || (((a2 == 4 && a29 + 16 <= 0) && ((89 + a4 <= 0 && 0 <= 146 + a0) || (89 + a4 <= 0 && (\exists v_~a29~0_899 : int :: (((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 80 || ((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 143 && !((9 * v_~a29~0_899 / 10 + 1) % 63 == 0))) && !(9 * v_~a29~0_899 % 10 == 0)) && 9 * v_~a29~0_899 < 0)))) && 0 <= 599999 + a29)) || ((((0 <= a0 + 60 && a4 + 86 <= 0) && a2 <= 2) || (89 + a4 <= 0 && a2 <= 2)) && a0 + 61 <= 0)) || (((((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && 5 <= a2) || (89 + a4 <= 0 && 5 <= a2)) && a0 + 61 <= 0)) || (((((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && 5 <= a2) || (89 + a4 <= 0 && 5 <= a2)) && !(a29 + 144 <= 0)) [2022-07-19 12:29:44,198 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((42 + a4 <= 0 && 0 <= a29 + 127) && !(a4 + 86 <= 0)) && 98 + a0 <= 0) && 5 <= a2) || (((((0 < a4 + 86 && 42 + a4 <= 0) && 2 <= a2) && a0 + 147 <= 0) && a2 <= 2) && 0 <= 599999 + a29)) || ((((0 <= a29 + 127 && 89 + a4 <= 0) && a2 == 1) && 0 <= 44 + a0) && a29 + 127 <= 0)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && a0 + 147 <= 0) && !(input == 4)) && 3 == a2)) || ((((42 + a4 <= 0 && !(a4 + 86 <= 0)) && a0 + 147 <= 0) && 5 <= a2) && !(a29 + 144 <= 0))) || (((216075 + a0 <= 0 && 42 + a4 <= 0) && a2 == 1) && 0 < a29 + 144)) || (((42 + a4 <= 0 && 44 <= a29) && a0 + 147 <= 0) && 5 <= a2)) || (((42 + a4 <= 0 && 0 <= a29 + 127) && a0 + 147 <= 0) && 3 == a2)) || ((((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && a2 == 4) && a29 <= 43)) || ((((42 + a4 <= 0 && a0 + 99 <= 0) && !(a4 + 86 <= 0)) && 0 <= 146 + a0) && 3 == a2)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && a0 + 147 <= 0) && a2 == 4) && 0 <= 599999 + a29)) || ((a2 == 1 && a4 + 86 <= 0) && a0 + 61 <= 0)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && 98 + a0 <= 0) && a29 + 120873 <= 0) && 3 == a2)) || (((((0 <= 97 + a0 && 42 + a4 <= 0) && a2 == 1) && 0 < a29 + 144) && a29 + 16 <= 0) && a0 + 61 <= 0)) || (((42 + a4 <= 0 && 44 <= a29) && a0 + 147 <= 0) && a2 == 1)) || ((((0 <= a29 + 127 && a4 + 86 <= 0) && 3 == a2) || (89 + a4 <= 0 && 3 == a2)) && a0 + 61 <= 0)) || (((((42 + a4 <= 0 && 98 + a0 <= 0) && 0 <= 146 + a0) && a2 == 1) && a29 <= 43) && 0 <= 599999 + a29)) || ((((0 <= a29 + 127 && a4 + 86 <= 0) && 3 == a2) || (89 + a4 <= 0 && 3 == a2)) && 0 <= 599999 + a29)) || ((89 + a4 <= 0 && 0 <= 146 + a0) && a0 + 61 <= 0)) || ((2 <= a2 && (((0 <= a0 + 60 && a4 + 86 <= 0) && a2 <= 2) || (89 + a4 <= 0 && a2 <= 2))) && 0 <= 599999 + a29)) || (((a2 == 4 && a29 + 16 <= 0) && ((89 + a4 <= 0 && 0 <= 146 + a0) || (89 + a4 <= 0 && (\exists v_~a29~0_899 : int :: (((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 80 || ((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 143 && !((9 * v_~a29~0_899 / 10 + 1) % 63 == 0))) && !(9 * v_~a29~0_899 % 10 == 0)) && 9 * v_~a29~0_899 < 0)))) && 0 <= 599999 + a29)) || ((((((0 < a4 + 86 && (!(input == 4) || 0 < a29 + 16)) && 42 + a4 <= 0) && 2 == a2) && 0 <= a29 + 127) && 98 + a0 <= 0) && (0 < a29 + 16 || !(input == 4)))) || ((((0 <= a0 + 60 && a4 + 86 <= 0) && a2 <= 2) || (89 + a4 <= 0 && a2 <= 2)) && a0 + 61 <= 0)) || (((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && a0 + 61 <= 0)) || (((((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && 5 <= a2) || (89 + a4 <= 0 && 5 <= a2)) && a0 + 61 <= 0)) || (((((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && 5 <= a2) || (89 + a4 <= 0 && 5 <= a2)) && 0 < a29 + 144)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && 0 <= a29 + 127) && a2 == 1) && a29 <= 43)) || (((((0 < a4 + 86 && 42 + a4 <= 0) && a0 + 99 <= 0) && 0 <= 146 + a0) && 5 <= a2) && 0 <= 599999 + a29) [2022-07-19 12:29:44,308 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 12:29:44,309 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 12:29:44,309 INFO L158 Benchmark]: Toolchain (without parser) took 153229.48ms. Allocated memory was 100.7MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 64.8MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2022-07-19 12:29:44,309 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 100.7MB. Free memory was 55.1MB in the beginning and 55.0MB in the end (delta: 47.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 12:29:44,310 INFO L158 Benchmark]: CACSL2BoogieTranslator took 864.91ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 64.6MB in the beginning and 86.0MB in the end (delta: -21.4MB). Peak memory consumption was 34.8MB. Max. memory is 16.1GB. [2022-07-19 12:29:44,312 INFO L158 Benchmark]: Boogie Procedure Inliner took 198.17ms. Allocated memory is still 121.6MB. Free memory was 86.0MB in the beginning and 49.0MB in the end (delta: 37.0MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-07-19 12:29:44,312 INFO L158 Benchmark]: Boogie Preprocessor took 244.58ms. Allocated memory is still 121.6MB. Free memory was 49.0MB in the beginning and 54.1MB in the end (delta: -5.1MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2022-07-19 12:29:44,312 INFO L158 Benchmark]: RCFGBuilder took 2503.80ms. Allocated memory was 121.6MB in the beginning and 255.9MB in the end (delta: 134.2MB). Free memory was 54.0MB in the beginning and 140.9MB in the end (delta: -86.9MB). Peak memory consumption was 52.6MB. Max. memory is 16.1GB. [2022-07-19 12:29:44,317 INFO L158 Benchmark]: TraceAbstraction took 149223.23ms. Allocated memory was 255.9MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 140.9MB in the beginning and 461.1MB in the end (delta: -320.2MB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2022-07-19 12:29:44,317 INFO L158 Benchmark]: Witness Printer took 187.08ms. Allocated memory is still 1.9GB. Free memory was 461.1MB in the beginning and 1.6GB in the end (delta: -1.1GB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-19 12:29:44,321 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 100.7MB. Free memory was 55.1MB in the beginning and 55.0MB in the end (delta: 47.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 864.91ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 64.6MB in the beginning and 86.0MB in the end (delta: -21.4MB). Peak memory consumption was 34.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 198.17ms. Allocated memory is still 121.6MB. Free memory was 86.0MB in the beginning and 49.0MB in the end (delta: 37.0MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 244.58ms. Allocated memory is still 121.6MB. Free memory was 49.0MB in the beginning and 54.1MB in the end (delta: -5.1MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. * RCFGBuilder took 2503.80ms. Allocated memory was 121.6MB in the beginning and 255.9MB in the end (delta: 134.2MB). Free memory was 54.0MB in the beginning and 140.9MB in the end (delta: -86.9MB). Peak memory consumption was 52.6MB. Max. memory is 16.1GB. * TraceAbstraction took 149223.23ms. Allocated memory was 255.9MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 140.9MB in the beginning and 461.1MB in the end (delta: -320.2MB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 187.08ms. Allocated memory is still 1.9GB. Free memory was 461.1MB in the beginning and 1.6GB in the end (delta: -1.1GB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] * 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: 182]: 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, 424 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 149.1s, OverallIterations: 29, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 56.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 72.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 25207 SdHoareTripleChecker+Valid, 49.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25207 mSDsluCounter, 11117 SdHoareTripleChecker+Invalid, 41.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 785 IncrementalHoareTripleChecker+Unchecked, 1797 mSDsCounter, 6148 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 54169 IncrementalHoareTripleChecker+Invalid, 61102 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6148 mSolverCounterUnsat, 9320 mSDtfsCounter, 54169 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6866 GetRequests, 6720 SyntacticMatches, 1 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2110 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22834occurred in iteration=21, InterpolantAutomatonStates: 177, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.5s AutomataMinimizationTime, 29 MinimizatonAttempts, 40076 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 204 NumberOfFragments, 2540 HoareAnnotationTreeSize, 4 FomulaSimplifications, 736998 FormulaSimplificationTreeSizeReduction, 60.1s HoareSimplificationTime, 4 FomulaSimplificationsInter, 1137411 FormulaSimplificationTreeSizeReductionInter, 12.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 23073 NumberOfCodeBlocks, 23073 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 24878 ConstructedInterpolants, 53 QuantifiedInterpolants, 84586 SizeOfPredicates, 7 NumberOfNonLiveVariables, 5770 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 37 InterpolantComputations, 27 PerfectInterpolantSequences, 36001/37438 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: 1770]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1668]: Loop Invariant [2022-07-19 12:29:44,335 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,335 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,335 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,336 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,336 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,338 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,338 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,338 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,338 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,338 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((42 + a4 <= 0 && 0 <= a29 + 127) && !(a4 + 86 <= 0)) && 98 + a0 <= 0) && 5 <= a2) || (((((0 < a4 + 86 && 42 + a4 <= 0) && 2 <= a2) && a0 + 147 <= 0) && a2 <= 2) && 0 <= 599999 + a29)) || ((((0 <= a29 + 127 && 89 + a4 <= 0) && a2 == 1) && 0 <= 44 + a0) && a29 + 127 <= 0)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && a0 + 147 <= 0) && !(input == 4)) && 3 == a2)) || ((((42 + a4 <= 0 && !(a4 + 86 <= 0)) && a0 + 147 <= 0) && 5 <= a2) && !(a29 + 144 <= 0))) || (((216075 + a0 <= 0 && 42 + a4 <= 0) && a2 == 1) && 0 < a29 + 144)) || (((42 + a4 <= 0 && 44 <= a29) && a0 + 147 <= 0) && 5 <= a2)) || (((42 + a4 <= 0 && 0 <= a29 + 127) && a0 + 147 <= 0) && 3 == a2)) || ((((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && a2 == 4) && a29 <= 43)) || ((((42 + a4 <= 0 && a0 + 99 <= 0) && !(a4 + 86 <= 0)) && 0 <= 146 + a0) && 3 == a2)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && a0 + 147 <= 0) && a2 == 4) && 0 <= 599999 + a29)) || ((a2 == 1 && a4 + 86 <= 0) && a0 + 61 <= 0)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && 98 + a0 <= 0) && a29 + 120873 <= 0) && 3 == a2)) || (((((0 <= 97 + a0 && 42 + a4 <= 0) && a2 == 1) && 0 < a29 + 144) && a29 + 16 <= 0) && a0 + 61 <= 0)) || (((42 + a4 <= 0 && 44 <= a29) && a0 + 147 <= 0) && a2 == 1)) || ((((0 <= a29 + 127 && a4 + 86 <= 0) && 3 == a2) || (89 + a4 <= 0 && 3 == a2)) && a0 + 61 <= 0)) || (((((42 + a4 <= 0 && 98 + a0 <= 0) && 0 <= 146 + a0) && a2 == 1) && a29 <= 43) && 0 <= 599999 + a29)) || ((((0 <= a29 + 127 && a4 + 86 <= 0) && 3 == a2) || (89 + a4 <= 0 && 3 == a2)) && 0 <= 599999 + a29)) || ((89 + a4 <= 0 && 0 <= 146 + a0) && a0 + 61 <= 0)) || ((2 <= a2 && (((0 <= a0 + 60 && a4 + 86 <= 0) && a2 <= 2) || (89 + a4 <= 0 && a2 <= 2))) && 0 <= 599999 + a29)) || (((a2 == 4 && a29 + 16 <= 0) && ((89 + a4 <= 0 && 0 <= 146 + a0) || (89 + a4 <= 0 && (\exists v_~a29~0_899 : int :: (((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 80 || ((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 143 && !((9 * v_~a29~0_899 / 10 + 1) % 63 == 0))) && !(9 * v_~a29~0_899 % 10 == 0)) && 9 * v_~a29~0_899 < 0)))) && 0 <= 599999 + a29)) || ((((((0 < a4 + 86 && (!(input == 4) || 0 < a29 + 16)) && 42 + a4 <= 0) && 2 == a2) && 0 <= a29 + 127) && 98 + a0 <= 0) && (0 < a29 + 16 || !(input == 4)))) || ((((0 <= a0 + 60 && a4 + 86 <= 0) && a2 <= 2) || (89 + a4 <= 0 && a2 <= 2)) && a0 + 61 <= 0)) || (((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && a0 + 61 <= 0)) || (((((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && 5 <= a2) || (89 + a4 <= 0 && 5 <= a2)) && a0 + 61 <= 0)) || (((((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && 5 <= a2) || (89 + a4 <= 0 && 5 <= a2)) && 0 < a29 + 144)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && 0 <= a29 + 127) && a2 == 1) && a29 <= 43)) || (((((0 < a4 + 86 && 42 + a4 <= 0) && a0 + 99 <= 0) && 0 <= 146 + a0) && 5 <= a2) && 0 <= 599999 + a29) - InvariantResult [Line: 1776]: Loop Invariant [2022-07-19 12:29:44,341 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,341 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,341 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,341 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,341 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,343 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,343 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,343 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,343 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,343 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((42 + a4 <= 0 && 0 <= a29 + 127) && !(a4 + 86 <= 0)) && 98 + a0 <= 0) && 5 <= a2) || (((((0 < a4 + 86 && 42 + a4 <= 0) && 2 <= a2) && a0 + 147 <= 0) && a2 <= 2) && 0 <= 599999 + a29)) || ((((0 <= a29 + 127 && 89 + a4 <= 0) && a2 == 1) && 0 <= 44 + a0) && a29 + 127 <= 0)) || ((((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && 4 <= a2) && a29 <= 43)) || ((0 <= a29 + 127 && 89 + a4 <= 0) && a0 + 61 <= 0)) || ((((42 + a4 <= 0 && !(a4 + 86 <= 0)) && a0 + 147 <= 0) && 5 <= a2) && !(a29 + 144 <= 0))) || (((216075 + a0 <= 0 && 42 + a4 <= 0) && a2 == 1) && 0 < a29 + 144)) || (42 + a4 <= 0 && ((((0 < a4 + 86 && a0 + 147 <= 0) && 3 == a2) && a29 + 144 <= 0) || (((!(a4 + 86 <= 0) && a0 + 147 <= 0) && !(input == 4)) && 3 == a2)))) || (((42 + a4 <= 0 && 44 <= a29) && a0 + 147 <= 0) && 5 <= a2)) || (((42 + a4 <= 0 && 0 <= a29 + 127) && a0 + 147 <= 0) && 3 == a2)) || ((((((0 < a4 + 86 && 42 + a4 <= 0) && a0 + 99 <= 0) && 0 <= 146 + a0) && !(a2 == 4)) && 4 <= a2) && 0 <= 599999 + a29)) || ((((42 + a4 <= 0 && a0 + 99 <= 0) && !(a4 + 86 <= 0)) && 0 <= 146 + a0) && 3 == a2)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && a0 + 147 <= 0) && a2 == 4) && 0 <= 599999 + a29)) || ((a2 == 1 && a4 + 86 <= 0) && a0 + 61 <= 0)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && 98 + a0 <= 0) && a29 + 120873 <= 0) && 3 == a2)) || (((((0 <= 97 + a0 && 42 + a4 <= 0) && a2 == 1) && 0 < a29 + 144) && a29 + 16 <= 0) && a0 + 61 <= 0)) || (((42 + a4 <= 0 && 44 <= a29) && a0 + 147 <= 0) && a2 == 1)) || (((((((0 < a4 + 86 && 42 + a4 <= 0) && 2 <= a2) && 0 <= a29 + 127) && 98 + a0 <= 0) && (!(a29 + 16 <= 0) || !(input == 4))) && (!(a29 + 16 <= 0) || !(input == 4))) && a2 <= 2)) || ((((0 <= a29 + 127 && a4 + 86 <= 0) && 3 == a2) || (89 + a4 <= 0 && 3 == a2)) && a0 + 61 <= 0)) || (((((42 + a4 <= 0 && 98 + a0 <= 0) && 0 <= 146 + a0) && a2 == 1) && a29 <= 43) && 0 <= 599999 + a29)) || ((((42 + a4 <= 0 && 0 <= a29 + 127) && !(a4 + 86 <= 0)) && a2 == 1) && a29 <= 43)) || ((((0 <= a29 + 127 && a4 + 86 <= 0) && 3 == a2) || (89 + a4 <= 0 && 3 == a2)) && 0 <= 599999 + a29)) || ((a2 == 1 && a4 + 86 <= 0) && a29 + 144 <= 0)) || ((89 + a4 <= 0 && 0 <= 146 + a0) && a0 + 61 <= 0)) || ((2 <= a2 && (((0 <= a0 + 60 && a4 + 86 <= 0) && a2 <= 2) || (89 + a4 <= 0 && a2 <= 2))) && 0 <= 599999 + a29)) || (((a2 == 4 && a29 + 16 <= 0) && ((89 + a4 <= 0 && 0 <= 146 + a0) || (89 + a4 <= 0 && (\exists v_~a29~0_899 : int :: (((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 80 || ((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 143 && !((9 * v_~a29~0_899 / 10 + 1) % 63 == 0))) && !(9 * v_~a29~0_899 % 10 == 0)) && 9 * v_~a29~0_899 < 0)))) && 0 <= 599999 + a29)) || ((((0 <= a0 + 60 && a4 + 86 <= 0) && a2 <= 2) || (89 + a4 <= 0 && a2 <= 2)) && a0 + 61 <= 0)) || (((((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && 5 <= a2) || (89 + a4 <= 0 && 5 <= a2)) && a0 + 61 <= 0)) || (((((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && 5 <= a2) || (89 + a4 <= 0 && 5 <= a2)) && !(a29 + 144 <= 0)) - InvariantResult [Line: 33]: Loop Invariant [2022-07-19 12:29:44,345 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,345 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,345 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,345 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,345 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,348 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,348 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,348 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,349 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-19 12:29:44,349 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((42 + a4 <= 0 && 0 <= a29 + 127) && !(a4 + 86 <= 0)) && 98 + a0 <= 0) && 5 <= a2) || (((((0 < a4 + 86 && 42 + a4 <= 0) && 2 <= a2) && a0 + 147 <= 0) && a2 <= 2) && 0 <= 599999 + a29)) || ((((0 <= a29 + 127 && 89 + a4 <= 0) && a2 == 1) && 0 <= 44 + a0) && a29 + 127 <= 0)) || ((((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && 4 <= a2) && a29 <= 43)) || ((0 <= a29 + 127 && 89 + a4 <= 0) && a0 + 61 <= 0)) || ((((42 + a4 <= 0 && !(a4 + 86 <= 0)) && a0 + 147 <= 0) && 5 <= a2) && !(a29 + 144 <= 0))) || (((216075 + a0 <= 0 && 42 + a4 <= 0) && a2 == 1) && 0 < a29 + 144)) || (42 + a4 <= 0 && ((((0 < a4 + 86 && a0 + 147 <= 0) && 3 == a2) && a29 + 144 <= 0) || (((!(a4 + 86 <= 0) && a0 + 147 <= 0) && !(input == 4)) && 3 == a2)))) || (((42 + a4 <= 0 && 44 <= a29) && a0 + 147 <= 0) && 5 <= a2)) || (((42 + a4 <= 0 && 0 <= a29 + 127) && a0 + 147 <= 0) && 3 == a2)) || ((((((0 < a4 + 86 && 42 + a4 <= 0) && a0 + 99 <= 0) && 0 <= 146 + a0) && !(a2 == 4)) && 4 <= a2) && 0 <= 599999 + a29)) || ((((42 + a4 <= 0 && a0 + 99 <= 0) && !(a4 + 86 <= 0)) && 0 <= 146 + a0) && 3 == a2)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && a0 + 147 <= 0) && a2 == 4) && 0 <= 599999 + a29)) || ((a2 == 1 && a4 + 86 <= 0) && a0 + 61 <= 0)) || ((((0 < a4 + 86 && 42 + a4 <= 0) && 98 + a0 <= 0) && a29 + 120873 <= 0) && 3 == a2)) || (((((0 <= 97 + a0 && 42 + a4 <= 0) && a2 == 1) && 0 < a29 + 144) && a29 + 16 <= 0) && a0 + 61 <= 0)) || (((42 + a4 <= 0 && 44 <= a29) && a0 + 147 <= 0) && a2 == 1)) || (((((((0 < a4 + 86 && 42 + a4 <= 0) && 2 <= a2) && 0 <= a29 + 127) && 98 + a0 <= 0) && (!(a29 + 16 <= 0) || !(input == 4))) && (!(a29 + 16 <= 0) || !(input == 4))) && a2 <= 2)) || ((((0 <= a29 + 127 && a4 + 86 <= 0) && 3 == a2) || (89 + a4 <= 0 && 3 == a2)) && a0 + 61 <= 0)) || (((((42 + a4 <= 0 && 98 + a0 <= 0) && 0 <= 146 + a0) && a2 == 1) && a29 <= 43) && 0 <= 599999 + a29)) || ((((42 + a4 <= 0 && 0 <= a29 + 127) && !(a4 + 86 <= 0)) && a2 == 1) && a29 <= 43)) || ((((0 <= a29 + 127 && a4 + 86 <= 0) && 3 == a2) || (89 + a4 <= 0 && 3 == a2)) && 0 <= 599999 + a29)) || ((a2 == 1 && a4 + 86 <= 0) && a29 + 144 <= 0)) || ((89 + a4 <= 0 && 0 <= 146 + a0) && a0 + 61 <= 0)) || ((2 <= a2 && (((0 <= a0 + 60 && a4 + 86 <= 0) && a2 <= 2) || (89 + a4 <= 0 && a2 <= 2))) && 0 <= 599999 + a29)) || (((a2 == 4 && a29 + 16 <= 0) && ((89 + a4 <= 0 && 0 <= 146 + a0) || (89 + a4 <= 0 && (\exists v_~a29~0_899 : int :: (((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 80 || ((9 * v_~a29~0_899 / 10 + 1) % 63 <= a29 + 143 && !((9 * v_~a29~0_899 / 10 + 1) % 63 == 0))) && !(9 * v_~a29~0_899 % 10 == 0)) && 9 * v_~a29~0_899 < 0)))) && 0 <= 599999 + a29)) || ((((0 <= a0 + 60 && a4 + 86 <= 0) && a2 <= 2) || (89 + a4 <= 0 && a2 <= 2)) && a0 + 61 <= 0)) || (((((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && 5 <= a2) || (89 + a4 <= 0 && 5 <= a2)) && a0 + 61 <= 0)) || (((((0 <= a29 + 127 && 89 + a4 <= 0) || ((0 <= a29 + 127 && 0 <= a0 + 60) && a4 + 86 <= 0)) && 5 <= a2) || (89 + a4 <= 0 && 5 <= a2)) && !(a29 + 144 <= 0)) RESULT: Ultimate proved your program to be correct! [2022-07-19 12:29:44,366 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