./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 f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/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-?-f4b24e3 [2022-07-13 13:01:56,006 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 13:01:56,008 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 13:01:56,053 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 13:01:56,053 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 13:01:56,055 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 13:01:56,057 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 13:01:56,059 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 13:01:56,062 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 13:01:56,066 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 13:01:56,067 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 13:01:56,069 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 13:01:56,069 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 13:01:56,071 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 13:01:56,072 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 13:01:56,074 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 13:01:56,075 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 13:01:56,076 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 13:01:56,078 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 13:01:56,083 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 13:01:56,085 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 13:01:56,085 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 13:01:56,086 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 13:01:56,087 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 13:01:56,088 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 13:01:56,095 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 13:01:56,095 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 13:01:56,096 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 13:01:56,097 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 13:01:56,097 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 13:01:56,098 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 13:01:56,098 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 13:01:56,100 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 13:01:56,101 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 13:01:56,101 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 13:01:56,102 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 13:01:56,102 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 13:01:56,103 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 13:01:56,103 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 13:01:56,103 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 13:01:56,104 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 13:01:56,105 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 13:01:56,106 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 13:01:56,136 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 13:01:56,136 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 13:01:56,137 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 13:01:56,137 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 13:01:56,137 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 13:01:56,138 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 13:01:56,138 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 13:01:56,138 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 13:01:56,138 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 13:01:56,139 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 13:01:56,139 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 13:01:56,140 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 13:01:56,140 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 13:01:56,140 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 13:01:56,140 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 13:01:56,140 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 13:01:56,140 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 13:01:56,141 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 13:01:56,141 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 13:01:56,142 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 13:01:56,142 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 13:01:56,142 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 13:01:56,142 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 13:01:56,143 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 13:01:56,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 13:01:56,143 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 13:01:56,143 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 13:01:56,143 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 13:01:56,144 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 13:01:56,144 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 13:01:56,144 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 13:01:56,144 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 13:01:56,144 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 13:01:56,145 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-13 13:01:56,344 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 13:01:56,370 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 13:01:56,372 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 13:01:56,373 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 13:01:56,374 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 13:01:56,375 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-13 13:01:56,460 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99f0cd0fc/5f2d1695b0c54b0d810a78a9fae99c0c/FLAG3f56bf811 [2022-07-13 13:01:56,950 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 13:01:56,951 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label11.c [2022-07-13 13:01:56,969 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99f0cd0fc/5f2d1695b0c54b0d810a78a9fae99c0c/FLAG3f56bf811 [2022-07-13 13:01:57,208 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99f0cd0fc/5f2d1695b0c54b0d810a78a9fae99c0c [2022-07-13 13:01:57,210 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 13:01:57,211 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 13:01:57,214 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 13:01:57,214 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 13:01:57,217 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 13:01:57,218 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 01:01:57" (1/1) ... [2022-07-13 13:01:57,219 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bcd5d64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:01:57, skipping insertion in model container [2022-07-13 13:01:57,219 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 01:01:57" (1/1) ... [2022-07-13 13:01:57,224 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 13:01:57,290 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 13:01:57,519 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-13 13:01:57,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 13:01:57,795 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 13:01:57,825 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-13 13:01:58,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 13:01:58,043 INFO L208 MainTranslator]: Completed translation [2022-07-13 13:01:58,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:01:58 WrapperNode [2022-07-13 13:01:58,044 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 13:01:58,045 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 13:01:58,045 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 13:01:58,045 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 13:01:58,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:01:58" (1/1) ... [2022-07-13 13:01:58,076 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:01:58" (1/1) ... [2022-07-13 13:01:58,255 INFO L137 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1758 [2022-07-13 13:01:58,255 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 13:01:58,256 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 13:01:58,256 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 13:01:58,257 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 13:01:58,264 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:01:58" (1/1) ... [2022-07-13 13:01:58,264 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:01:58" (1/1) ... [2022-07-13 13:01:58,284 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:01:58" (1/1) ... [2022-07-13 13:01:58,284 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:01:58" (1/1) ... [2022-07-13 13:01:58,377 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:01:58" (1/1) ... [2022-07-13 13:01:58,401 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:01:58" (1/1) ... [2022-07-13 13:01:58,419 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:01:58" (1/1) ... [2022-07-13 13:01:58,445 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 13:01:58,447 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 13:01:58,447 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 13:01:58,447 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 13:01:58,451 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:01:58" (1/1) ... [2022-07-13 13:01:58,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 13:01:58,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 13:01:58,485 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 13:01:58,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 13:01:58,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 13:01:58,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 13:01:58,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 13:01:58,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 13:01:58,573 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 13:01:58,574 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 13:02:00,844 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 13:02:00,860 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 13:02:00,862 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 13:02:00,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 01:02:00 BoogieIcfgContainer [2022-07-13 13:02:00,865 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 13:02:00,867 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 13:02:00,868 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 13:02:00,871 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 13:02:00,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 01:01:57" (1/3) ... [2022-07-13 13:02:00,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1df30a68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 01:02:00, skipping insertion in model container [2022-07-13 13:02:00,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:01:58" (2/3) ... [2022-07-13 13:02:00,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1df30a68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 01:02:00, skipping insertion in model container [2022-07-13 13:02:00,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 01:02:00" (3/3) ... [2022-07-13 13:02:00,873 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem15_label11.c [2022-07-13 13:02:00,885 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 13:02:00,885 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 13:02:00,929 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 13:02:00,934 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@1787c5e1, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3c69229 [2022-07-13 13:02:00,935 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 13:02:00,940 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-13 13:02:00,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-13 13:02:00,947 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 13:02:00,947 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-13 13:02:00,948 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 13:02:00,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 13:02:00,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1246856209, now seen corresponding path program 1 times [2022-07-13 13:02:00,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 13:02:00,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71251765] [2022-07-13 13:02:00,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:02:00,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 13:02:01,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:02:01,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 13:02:01,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 13:02:01,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71251765] [2022-07-13 13:02:01,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71251765] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 13:02:01,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 13:02:01,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 13:02:01,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337365465] [2022-07-13 13:02:01,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 13:02:01,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 13:02:01,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 13:02:01,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 13:02:01,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:02:01,235 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-13 13:02:03,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 13:02:03,487 INFO L93 Difference]: Finished difference Result 1197 states and 2163 transitions. [2022-07-13 13:02:03,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 13:02:03,490 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-13 13:02:03,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 13:02:03,511 INFO L225 Difference]: With dead ends: 1197 [2022-07-13 13:02:03,512 INFO L226 Difference]: Without dead ends: 694 [2022-07-13 13:02:03,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:02:03,526 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.2s IncrementalHoareTripleChecker+Time [2022-07-13 13:02:03,529 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.2s Time] [2022-07-13 13:02:03,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2022-07-13 13:02:03,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 684. [2022-07-13 13:02:03,629 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-13 13:02:03,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1174 transitions. [2022-07-13 13:02:03,633 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1174 transitions. Word has length 55 [2022-07-13 13:02:03,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 13:02:03,635 INFO L495 AbstractCegarLoop]: Abstraction has 684 states and 1174 transitions. [2022-07-13 13:02:03,635 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-13 13:02:03,655 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1174 transitions. [2022-07-13 13:02:03,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-13 13:02:03,665 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 13:02:03,665 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-13 13:02:03,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 13:02:03,666 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 13:02:03,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 13:02:03,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1666804951, now seen corresponding path program 1 times [2022-07-13 13:02:03,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 13:02:03,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876233057] [2022-07-13 13:02:03,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:02:03,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 13:02:03,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:02:03,882 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-13 13:02:03,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 13:02:03,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876233057] [2022-07-13 13:02:03,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876233057] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 13:02:03,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 13:02:03,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 13:02:03,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759163829] [2022-07-13 13:02:03,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 13:02:03,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 13:02:03,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 13:02:03,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 13:02:03,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:02:03,888 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-13 13:02:05,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 13:02:05,507 INFO L93 Difference]: Finished difference Result 1681 states and 2896 transitions. [2022-07-13 13:02:05,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 13:02:05,508 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-13 13:02:05,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 13:02:05,513 INFO L225 Difference]: With dead ends: 1681 [2022-07-13 13:02:05,513 INFO L226 Difference]: Without dead ends: 999 [2022-07-13 13:02:05,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:02:05,516 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-13 13:02:05,516 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-13 13:02:05,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2022-07-13 13:02:05,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 989. [2022-07-13 13:02:05,536 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-13 13:02:05,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1600 transitions. [2022-07-13 13:02:05,539 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1600 transitions. Word has length 120 [2022-07-13 13:02:05,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 13:02:05,539 INFO L495 AbstractCegarLoop]: Abstraction has 989 states and 1600 transitions. [2022-07-13 13:02:05,540 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-13 13:02:05,540 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1600 transitions. [2022-07-13 13:02:05,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-13 13:02:05,541 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 13:02:05,542 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-13 13:02:05,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 13:02:05,542 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 13:02:05,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 13:02:05,543 INFO L85 PathProgramCache]: Analyzing trace with hash -2119716484, now seen corresponding path program 1 times [2022-07-13 13:02:05,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 13:02:05,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641725684] [2022-07-13 13:02:05,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:02:05,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 13:02:05,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:02:05,616 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-13 13:02:05,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 13:02:05,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641725684] [2022-07-13 13:02:05,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641725684] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 13:02:05,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 13:02:05,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 13:02:05,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369250018] [2022-07-13 13:02:05,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 13:02:05,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 13:02:05,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 13:02:05,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 13:02:05,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:02:05,619 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-13 13:02:07,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 13:02:07,037 INFO L93 Difference]: Finished difference Result 2575 states and 4255 transitions. [2022-07-13 13:02:07,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 13:02:07,038 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-13 13:02:07,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 13:02:07,044 INFO L225 Difference]: With dead ends: 2575 [2022-07-13 13:02:07,044 INFO L226 Difference]: Without dead ends: 1588 [2022-07-13 13:02:07,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:02:07,051 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 284 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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-13 13:02:07,052 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-13 13:02:07,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1588 states. [2022-07-13 13:02:07,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1588 to 1584. [2022-07-13 13:02:07,080 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-13 13:02:07,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2214 transitions. [2022-07-13 13:02:07,086 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2214 transitions. Word has length 121 [2022-07-13 13:02:07,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 13:02:07,087 INFO L495 AbstractCegarLoop]: Abstraction has 1584 states and 2214 transitions. [2022-07-13 13:02:07,088 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-13 13:02:07,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2214 transitions. [2022-07-13 13:02:07,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-07-13 13:02:07,093 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 13:02:07,094 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-13 13:02:07,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 13:02:07,094 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 13:02:07,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 13:02:07,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1178280902, now seen corresponding path program 1 times [2022-07-13 13:02:07,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 13:02:07,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541629563] [2022-07-13 13:02:07,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:02:07,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 13:02:07,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:02:07,263 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-13 13:02:07,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 13:02:07,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541629563] [2022-07-13 13:02:07,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541629563] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 13:02:07,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 13:02:07,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 13:02:07,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031699329] [2022-07-13 13:02:07,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 13:02:07,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 13:02:07,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 13:02:07,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 13:02:07,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 13:02:07,268 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-13 13:02:09,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 13:02:09,333 INFO L93 Difference]: Finished difference Result 4090 states and 5888 transitions. [2022-07-13 13:02:09,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 13:02:09,334 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-13 13:02:09,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 13:02:09,344 INFO L225 Difference]: With dead ends: 4090 [2022-07-13 13:02:09,344 INFO L226 Difference]: Without dead ends: 2807 [2022-07-13 13:02:09,346 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-13 13:02:09,353 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 349 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 1709 mSolverCounterSat, 454 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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-13 13:02:09,354 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-13 13:02:09,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2807 states. [2022-07-13 13:02:09,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2807 to 2184. [2022-07-13 13:02:09,392 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-13 13:02:09,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2184 states to 2184 states and 2904 transitions. [2022-07-13 13:02:09,396 INFO L78 Accepts]: Start accepts. Automaton has 2184 states and 2904 transitions. Word has length 125 [2022-07-13 13:02:09,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 13:02:09,397 INFO L495 AbstractCegarLoop]: Abstraction has 2184 states and 2904 transitions. [2022-07-13 13:02:09,398 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-13 13:02:09,398 INFO L276 IsEmpty]: Start isEmpty. Operand 2184 states and 2904 transitions. [2022-07-13 13:02:09,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2022-07-13 13:02:09,401 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 13:02:09,402 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-13 13:02:09,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 13:02:09,402 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 13:02:09,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 13:02:09,403 INFO L85 PathProgramCache]: Analyzing trace with hash -2088752626, now seen corresponding path program 1 times [2022-07-13 13:02:09,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 13:02:09,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046001622] [2022-07-13 13:02:09,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:02:09,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 13:02:09,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:02:09,655 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-13 13:02:09,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 13:02:09,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046001622] [2022-07-13 13:02:09,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046001622] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 13:02:09,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 13:02:09,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 13:02:09,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521715388] [2022-07-13 13:02:09,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 13:02:09,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 13:02:09,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 13:02:09,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 13:02:09,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:02:09,658 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-13 13:02:11,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 13:02:11,483 INFO L93 Difference]: Finished difference Result 5868 states and 7890 transitions. [2022-07-13 13:02:11,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 13:02:11,484 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-13 13:02:11,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 13:02:11,497 INFO L225 Difference]: With dead ends: 5868 [2022-07-13 13:02:11,497 INFO L226 Difference]: Without dead ends: 3686 [2022-07-13 13:02:11,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:02:11,501 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 43 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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.8s IncrementalHoareTripleChecker+Time [2022-07-13 13:02:11,501 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.8s Time] [2022-07-13 13:02:11,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3686 states. [2022-07-13 13:02:11,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3686 to 3684. [2022-07-13 13:02:11,554 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-13 13:02:11,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3684 states to 3684 states and 4634 transitions. [2022-07-13 13:02:11,560 INFO L78 Accepts]: Start accepts. Automaton has 3684 states and 4634 transitions. Word has length 325 [2022-07-13 13:02:11,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 13:02:11,561 INFO L495 AbstractCegarLoop]: Abstraction has 3684 states and 4634 transitions. [2022-07-13 13:02:11,562 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-13 13:02:11,562 INFO L276 IsEmpty]: Start isEmpty. Operand 3684 states and 4634 transitions. [2022-07-13 13:02:11,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2022-07-13 13:02:11,567 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 13:02:11,568 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-13 13:02:11,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 13:02:11,568 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 13:02:11,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 13:02:11,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1998947477, now seen corresponding path program 1 times [2022-07-13 13:02:11,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 13:02:11,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665194259] [2022-07-13 13:02:11,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:02:11,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 13:02:11,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:02:11,805 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-13 13:02:11,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 13:02:11,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665194259] [2022-07-13 13:02:11,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665194259] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 13:02:11,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 13:02:11,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 13:02:11,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691125659] [2022-07-13 13:02:11,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 13:02:11,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 13:02:11,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 13:02:11,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 13:02:11,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:02:11,809 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-13 13:02:13,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 13:02:13,125 INFO L93 Difference]: Finished difference Result 7665 states and 9577 transitions. [2022-07-13 13:02:13,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 13:02:13,128 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-13 13:02:13,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 13:02:13,139 INFO L225 Difference]: With dead ends: 7665 [2022-07-13 13:02:13,139 INFO L226 Difference]: Without dead ends: 3983 [2022-07-13 13:02:13,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:02:13,145 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.3s IncrementalHoareTripleChecker+Time [2022-07-13 13:02:13,145 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.3s Time] [2022-07-13 13:02:13,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3983 states. [2022-07-13 13:02:13,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3983 to 3983. [2022-07-13 13:02:13,201 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-13 13:02:13,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3983 states to 3983 states and 4939 transitions. [2022-07-13 13:02:13,208 INFO L78 Accepts]: Start accepts. Automaton has 3983 states and 4939 transitions. Word has length 373 [2022-07-13 13:02:13,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 13:02:13,209 INFO L495 AbstractCegarLoop]: Abstraction has 3983 states and 4939 transitions. [2022-07-13 13:02:13,209 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-13 13:02:13,209 INFO L276 IsEmpty]: Start isEmpty. Operand 3983 states and 4939 transitions. [2022-07-13 13:02:13,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2022-07-13 13:02:13,215 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 13:02:13,215 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-13 13:02:13,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 13:02:13,216 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 13:02:13,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 13:02:13,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1174077085, now seen corresponding path program 1 times [2022-07-13 13:02:13,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 13:02:13,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624451391] [2022-07-13 13:02:13,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:02:13,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 13:02:13,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:02:13,427 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-13 13:02:13,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 13:02:13,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624451391] [2022-07-13 13:02:13,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624451391] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 13:02:13,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 13:02:13,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 13:02:13,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576478719] [2022-07-13 13:02:13,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 13:02:13,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 13:02:13,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 13:02:13,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 13:02:13,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:02:13,430 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-13 13:02:15,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 13:02:15,158 INFO L93 Difference]: Finished difference Result 8861 states and 11333 transitions. [2022-07-13 13:02:15,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 13:02:15,158 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-13 13:02:15,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 13:02:15,172 INFO L225 Difference]: With dead ends: 8861 [2022-07-13 13:02:15,173 INFO L226 Difference]: Without dead ends: 5179 [2022-07-13 13:02:15,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:02:15,178 INFO L413 NwaCegarLoop]: 277 mSDtfsCounter, 259 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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-13 13:02:15,178 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-13 13:02:15,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5179 states. [2022-07-13 13:02:15,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5179 to 3381. [2022-07-13 13:02:15,233 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-13 13:02:15,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 4269 transitions. [2022-07-13 13:02:15,239 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 4269 transitions. Word has length 416 [2022-07-13 13:02:15,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 13:02:15,240 INFO L495 AbstractCegarLoop]: Abstraction has 3381 states and 4269 transitions. [2022-07-13 13:02:15,240 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-13 13:02:15,240 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 4269 transitions. [2022-07-13 13:02:15,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2022-07-13 13:02:15,246 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 13:02:15,246 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-13 13:02:15,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 13:02:15,247 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 13:02:15,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 13:02:15,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1674238342, now seen corresponding path program 1 times [2022-07-13 13:02:15,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 13:02:15,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840900853] [2022-07-13 13:02:15,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:02:15,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 13:02:15,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:02:15,534 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-13 13:02:15,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 13:02:15,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840900853] [2022-07-13 13:02:15,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840900853] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 13:02:15,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 13:02:15,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 13:02:15,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565858797] [2022-07-13 13:02:15,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 13:02:15,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 13:02:15,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 13:02:15,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 13:02:15,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 13:02:15,537 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-13 13:02:17,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 13:02:17,270 INFO L93 Difference]: Finished difference Result 8297 states and 10744 transitions. [2022-07-13 13:02:17,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 13:02:17,271 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-13 13:02:17,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 13:02:17,287 INFO L225 Difference]: With dead ends: 8297 [2022-07-13 13:02:17,287 INFO L226 Difference]: Without dead ends: 5217 [2022-07-13 13:02:17,291 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-13 13:02:17,292 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-13 13:02:17,292 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-13 13:02:17,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5217 states. [2022-07-13 13:02:17,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5217 to 4878. [2022-07-13 13:02:17,381 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-13 13:02:17,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4878 states to 4878 states and 5979 transitions. [2022-07-13 13:02:17,396 INFO L78 Accepts]: Start accepts. Automaton has 4878 states and 5979 transitions. Word has length 420 [2022-07-13 13:02:17,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 13:02:17,397 INFO L495 AbstractCegarLoop]: Abstraction has 4878 states and 5979 transitions. [2022-07-13 13:02:17,397 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-13 13:02:17,397 INFO L276 IsEmpty]: Start isEmpty. Operand 4878 states and 5979 transitions. [2022-07-13 13:02:17,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2022-07-13 13:02:17,403 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 13:02:17,404 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-13 13:02:17,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 13:02:17,406 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 13:02:17,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 13:02:17,407 INFO L85 PathProgramCache]: Analyzing trace with hash 381390040, now seen corresponding path program 1 times [2022-07-13 13:02:17,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 13:02:17,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267270452] [2022-07-13 13:02:17,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:02:17,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 13:02:17,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:02:17,612 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-13 13:02:17,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 13:02:17,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267270452] [2022-07-13 13:02:17,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267270452] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 13:02:17,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 13:02:17,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 13:02:17,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834643756] [2022-07-13 13:02:17,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 13:02:17,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 13:02:17,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 13:02:17,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 13:02:17,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:02:17,615 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-13 13:02:19,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 13:02:19,048 INFO L93 Difference]: Finished difference Result 10952 states and 13771 transitions. [2022-07-13 13:02:19,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 13:02:19,049 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-13 13:02:19,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 13:02:19,066 INFO L225 Difference]: With dead ends: 10952 [2022-07-13 13:02:19,067 INFO L226 Difference]: Without dead ends: 6375 [2022-07-13 13:02:19,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:02:19,071 INFO L413 NwaCegarLoop]: 580 mSDtfsCounter, 273 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.4s IncrementalHoareTripleChecker+Time [2022-07-13 13:02:19,071 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.4s Time] [2022-07-13 13:02:19,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6375 states. [2022-07-13 13:02:19,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6375 to 6374. [2022-07-13 13:02:19,182 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-13 13:02:19,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6374 states to 6374 states and 7635 transitions. [2022-07-13 13:02:19,194 INFO L78 Accepts]: Start accepts. Automaton has 6374 states and 7635 transitions. Word has length 432 [2022-07-13 13:02:19,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 13:02:19,197 INFO L495 AbstractCegarLoop]: Abstraction has 6374 states and 7635 transitions. [2022-07-13 13:02:19,198 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-13 13:02:19,198 INFO L276 IsEmpty]: Start isEmpty. Operand 6374 states and 7635 transitions. [2022-07-13 13:02:19,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2022-07-13 13:02:19,210 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 13:02:19,211 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-13 13:02:19,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 13:02:19,211 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 13:02:19,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 13:02:19,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1616945835, now seen corresponding path program 1 times [2022-07-13 13:02:19,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 13:02:19,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20421837] [2022-07-13 13:02:19,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:02:19,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 13:02:19,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:02:19,431 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-13 13:02:19,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 13:02:19,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20421837] [2022-07-13 13:02:19,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20421837] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 13:02:19,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 13:02:19,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 13:02:19,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620728911] [2022-07-13 13:02:19,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 13:02:19,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 13:02:19,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 13:02:19,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 13:02:19,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:02:19,434 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-13 13:02:21,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 13:02:21,274 INFO L93 Difference]: Finished difference Result 16633 states and 20159 transitions. [2022-07-13 13:02:21,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 13:02:21,275 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-13 13:02:21,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 13:02:21,298 INFO L225 Difference]: With dead ends: 16633 [2022-07-13 13:02:21,298 INFO L226 Difference]: Without dead ends: 10560 [2022-07-13 13:02:21,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:02:21,305 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 285 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 956 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.8s IncrementalHoareTripleChecker+Time [2022-07-13 13:02:21,306 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.8s Time] [2022-07-13 13:02:21,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10560 states. [2022-07-13 13:02:21,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10560 to 8467. [2022-07-13 13:02:21,408 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-13 13:02:21,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8467 states to 8467 states and 10127 transitions. [2022-07-13 13:02:21,421 INFO L78 Accepts]: Start accepts. Automaton has 8467 states and 10127 transitions. Word has length 529 [2022-07-13 13:02:21,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 13:02:21,422 INFO L495 AbstractCegarLoop]: Abstraction has 8467 states and 10127 transitions. [2022-07-13 13:02:21,422 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-13 13:02:21,422 INFO L276 IsEmpty]: Start isEmpty. Operand 8467 states and 10127 transitions. [2022-07-13 13:02:21,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2022-07-13 13:02:21,428 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 13:02:21,429 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-13 13:02:21,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 13:02:21,430 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 13:02:21,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 13:02:21,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1652572232, now seen corresponding path program 1 times [2022-07-13 13:02:21,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 13:02:21,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680268950] [2022-07-13 13:02:21,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:02:21,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 13:02:21,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:02:21,648 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-13 13:02:21,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 13:02:21,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680268950] [2022-07-13 13:02:21,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680268950] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 13:02:21,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 13:02:21,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 13:02:21,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630068354] [2022-07-13 13:02:21,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 13:02:21,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 13:02:21,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 13:02:21,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 13:02:21,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:02:21,651 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-13 13:02:23,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 13:02:23,427 INFO L93 Difference]: Finished difference Result 19937 states and 23976 transitions. [2022-07-13 13:02:23,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 13:02:23,427 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-13 13:02:23,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 13:02:23,446 INFO L225 Difference]: With dead ends: 19937 [2022-07-13 13:02:23,446 INFO L226 Difference]: Without dead ends: 11771 [2022-07-13 13:02:23,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:02:23,456 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-13 13:02:23,456 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-13 13:02:23,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11771 states. [2022-07-13 13:02:23,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11771 to 11759. [2022-07-13 13:02:23,577 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-13 13:02:23,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11759 states to 11759 states and 13803 transitions. [2022-07-13 13:02:23,592 INFO L78 Accepts]: Start accepts. Automaton has 11759 states and 13803 transitions. Word has length 546 [2022-07-13 13:02:23,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 13:02:23,593 INFO L495 AbstractCegarLoop]: Abstraction has 11759 states and 13803 transitions. [2022-07-13 13:02:23,593 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-13 13:02:23,594 INFO L276 IsEmpty]: Start isEmpty. Operand 11759 states and 13803 transitions. [2022-07-13 13:02:23,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2022-07-13 13:02:23,601 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 13:02:23,601 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-13 13:02:23,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 13:02:23,602 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 13:02:23,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 13:02:23,603 INFO L85 PathProgramCache]: Analyzing trace with hash -889884113, now seen corresponding path program 1 times [2022-07-13 13:02:23,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 13:02:23,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101283367] [2022-07-13 13:02:23,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:02:23,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 13:02:23,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:02:23,862 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-13 13:02:23,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 13:02:23,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101283367] [2022-07-13 13:02:23,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101283367] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 13:02:23,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 13:02:23,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 13:02:23,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175498754] [2022-07-13 13:02:23,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 13:02:23,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 13:02:23,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 13:02:23,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 13:02:23,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:02:23,865 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-13 13:02:25,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 13:02:25,321 INFO L93 Difference]: Finished difference Result 23514 states and 27644 transitions. [2022-07-13 13:02:25,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 13:02:25,322 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-13 13:02:25,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 13:02:25,341 INFO L225 Difference]: With dead ends: 23514 [2022-07-13 13:02:25,341 INFO L226 Difference]: Without dead ends: 12056 [2022-07-13 13:02:25,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:02:25,353 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 465 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.4s IncrementalHoareTripleChecker+Time [2022-07-13 13:02:25,354 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.4s Time] [2022-07-13 13:02:25,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12056 states. [2022-07-13 13:02:25,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12056 to 11757. [2022-07-13 13:02:25,475 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-13 13:02:25,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11757 states to 11757 states and 13799 transitions. [2022-07-13 13:02:25,489 INFO L78 Accepts]: Start accepts. Automaton has 11757 states and 13799 transitions. Word has length 556 [2022-07-13 13:02:25,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 13:02:25,490 INFO L495 AbstractCegarLoop]: Abstraction has 11757 states and 13799 transitions. [2022-07-13 13:02:25,491 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-13 13:02:25,491 INFO L276 IsEmpty]: Start isEmpty. Operand 11757 states and 13799 transitions. [2022-07-13 13:02:25,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2022-07-13 13:02:25,501 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 13:02:25,503 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-13 13:02:25,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 13:02:25,504 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 13:02:25,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 13:02:25,504 INFO L85 PathProgramCache]: Analyzing trace with hash 967458274, now seen corresponding path program 1 times [2022-07-13 13:02:25,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 13:02:25,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940290360] [2022-07-13 13:02:25,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:02:25,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 13:02:25,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:02:25,730 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-13 13:02:25,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 13:02:25,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940290360] [2022-07-13 13:02:25,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940290360] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 13:02:25,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 13:02:25,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 13:02:25,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671951391] [2022-07-13 13:02:25,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 13:02:25,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 13:02:25,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 13:02:25,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 13:02:25,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:02:25,733 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-13 13:02:26,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 13:02:26,819 INFO L93 Difference]: Finished difference Result 24708 states and 28972 transitions. [2022-07-13 13:02:26,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 13:02:26,820 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-13 13:02:26,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 13:02:26,841 INFO L225 Difference]: With dead ends: 24708 [2022-07-13 13:02:26,841 INFO L226 Difference]: Without dead ends: 13252 [2022-07-13 13:02:26,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:02:26,854 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-13 13:02:26,854 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-13 13:02:26,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13252 states. [2022-07-13 13:02:27,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13252 to 9960. [2022-07-13 13:02:27,042 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-13 13:02:27,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9960 states to 9960 states and 11857 transitions. [2022-07-13 13:02:27,056 INFO L78 Accepts]: Start accepts. Automaton has 9960 states and 11857 transitions. Word has length 576 [2022-07-13 13:02:27,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 13:02:27,057 INFO L495 AbstractCegarLoop]: Abstraction has 9960 states and 11857 transitions. [2022-07-13 13:02:27,058 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-13 13:02:27,058 INFO L276 IsEmpty]: Start isEmpty. Operand 9960 states and 11857 transitions. [2022-07-13 13:02:27,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2022-07-13 13:02:27,068 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 13:02:27,069 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-13 13:02:27,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 13:02:27,069 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 13:02:27,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 13:02:27,070 INFO L85 PathProgramCache]: Analyzing trace with hash -270881818, now seen corresponding path program 1 times [2022-07-13 13:02:27,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 13:02:27,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535849375] [2022-07-13 13:02:27,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:02:27,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 13:02:27,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:02:27,316 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-13 13:02:27,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 13:02:27,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535849375] [2022-07-13 13:02:27,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535849375] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 13:02:27,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 13:02:27,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 13:02:27,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930359574] [2022-07-13 13:02:27,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 13:02:27,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 13:02:27,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 13:02:27,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 13:02:27,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:02:27,320 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-13 13:02:28,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 13:02:28,981 INFO L93 Difference]: Finished difference Result 25898 states and 30912 transitions. [2022-07-13 13:02:28,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 13:02:28,981 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-13 13:02:28,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 13:02:28,993 INFO L225 Difference]: With dead ends: 25898 [2022-07-13 13:02:28,993 INFO L226 Difference]: Without dead ends: 16239 [2022-07-13 13:02:28,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:02:28,998 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.6s IncrementalHoareTripleChecker+Time [2022-07-13 13:02:28,999 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.6s Time] [2022-07-13 13:02:29,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16239 states. [2022-07-13 13:02:29,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16239 to 12053. [2022-07-13 13:02:29,120 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-13 13:02:29,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12053 states to 12053 states and 14604 transitions. [2022-07-13 13:02:29,136 INFO L78 Accepts]: Start accepts. Automaton has 12053 states and 14604 transitions. Word has length 582 [2022-07-13 13:02:29,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 13:02:29,137 INFO L495 AbstractCegarLoop]: Abstraction has 12053 states and 14604 transitions. [2022-07-13 13:02:29,138 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-13 13:02:29,138 INFO L276 IsEmpty]: Start isEmpty. Operand 12053 states and 14604 transitions. [2022-07-13 13:02:29,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 620 [2022-07-13 13:02:29,148 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 13:02:29,148 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-13 13:02:29,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 13:02:29,148 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 13:02:29,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 13:02:29,149 INFO L85 PathProgramCache]: Analyzing trace with hash -830480631, now seen corresponding path program 1 times [2022-07-13 13:02:29,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 13:02:29,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107816828] [2022-07-13 13:02:29,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:02:29,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 13:02:29,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:02:29,374 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-13 13:02:29,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 13:02:29,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107816828] [2022-07-13 13:02:29,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107816828] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 13:02:29,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118798642] [2022-07-13 13:02:29,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:02:29,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 13:02:29,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 13:02:29,380 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 13:02:29,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 13:02:29,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:02:29,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 13:02:29,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 13:02:29,805 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-13 13:02:29,805 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 13:02:29,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118798642] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 13:02:29,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 13:02:29,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-07-13 13:02:29,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264712638] [2022-07-13 13:02:29,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 13:02:29,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 13:02:29,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 13:02:29,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 13:02:29,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 13:02:29,809 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-13 13:02:31,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 13:02:31,353 INFO L93 Difference]: Finished difference Result 27095 states and 33543 transitions. [2022-07-13 13:02:31,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 13:02:31,354 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-13 13:02:31,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 13:02:31,373 INFO L225 Difference]: With dead ends: 27095 [2022-07-13 13:02:31,373 INFO L226 Difference]: Without dead ends: 15343 [2022-07-13 13:02:31,383 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-13 13:02:31,384 INFO L413 NwaCegarLoop]: 595 mSDtfsCounter, 266 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.4s IncrementalHoareTripleChecker+Time [2022-07-13 13:02:31,384 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.4s Time] [2022-07-13 13:02:31,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15343 states. [2022-07-13 13:02:31,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15343 to 14446. [2022-07-13 13:02:31,525 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-13 13:02:31,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14446 states to 14446 states and 17205 transitions. [2022-07-13 13:02:31,544 INFO L78 Accepts]: Start accepts. Automaton has 14446 states and 17205 transitions. Word has length 619 [2022-07-13 13:02:31,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 13:02:31,545 INFO L495 AbstractCegarLoop]: Abstraction has 14446 states and 17205 transitions. [2022-07-13 13:02:31,545 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-13 13:02:31,545 INFO L276 IsEmpty]: Start isEmpty. Operand 14446 states and 17205 transitions. [2022-07-13 13:02:31,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 677 [2022-07-13 13:02:31,560 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 13:02:31,561 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-13 13:02:31,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 13:02:31,775 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-13 13:02:31,775 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 13:02:31,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 13:02:31,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1205457609, now seen corresponding path program 1 times [2022-07-13 13:02:31,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 13:02:31,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866336842] [2022-07-13 13:02:31,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:02:31,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 13:02:31,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:02:32,068 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-13 13:02:32,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 13:02:32,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866336842] [2022-07-13 13:02:32,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866336842] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 13:02:32,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631595336] [2022-07-13 13:02:32,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:02:32,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 13:02:32,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 13:02:32,070 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-13 13:02:32,122 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-13 13:02:32,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:02:32,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 13:02:32,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 13:02:32,923 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-13 13:02:32,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 13:02:33,548 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-13 13:02:33,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631595336] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 13:02:33,548 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 13:02:33,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-07-13 13:02:33,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23833324] [2022-07-13 13:02:33,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 13:02:33,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 13:02:33,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 13:02:33,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 13:02:33,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-07-13 13:02:33,552 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-13 13:02:38,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 13:02:38,988 INFO L93 Difference]: Finished difference Result 36223 states and 42637 transitions. [2022-07-13 13:02:38,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 13:02:38,989 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-13 13:02:38,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 13:02:39,008 INFO L225 Difference]: With dead ends: 36223 [2022-07-13 13:02:39,008 INFO L226 Difference]: Without dead ends: 16839 [2022-07-13 13:02:39,016 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-13 13:02:39,016 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-13 13:02:39,017 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-13 13:02:39,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16839 states. [2022-07-13 13:02:39,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16839 to 16836. [2022-07-13 13:02:39,174 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-13 13:02:39,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16836 states to 16836 states and 17942 transitions. [2022-07-13 13:02:39,196 INFO L78 Accepts]: Start accepts. Automaton has 16836 states and 17942 transitions. Word has length 676 [2022-07-13 13:02:39,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 13:02:39,197 INFO L495 AbstractCegarLoop]: Abstraction has 16836 states and 17942 transitions. [2022-07-13 13:02:39,197 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-13 13:02:39,197 INFO L276 IsEmpty]: Start isEmpty. Operand 16836 states and 17942 transitions. [2022-07-13 13:02:39,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 685 [2022-07-13 13:02:39,207 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 13:02:39,207 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-13 13:02:39,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-13 13:02:39,423 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-13 13:02:39,424 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 13:02:39,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 13:02:39,424 INFO L85 PathProgramCache]: Analyzing trace with hash 547646301, now seen corresponding path program 1 times [2022-07-13 13:02:39,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 13:02:39,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788582956] [2022-07-13 13:02:39,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:02:39,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 13:02:39,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:02:39,807 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-13 13:02:39,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 13:02:39,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788582956] [2022-07-13 13:02:39,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788582956] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 13:02:39,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 13:02:39,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 13:02:39,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166733653] [2022-07-13 13:02:39,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 13:02:39,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 13:02:39,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 13:02:39,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 13:02:39,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:02:39,810 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-13 13:02:40,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 13:02:40,657 INFO L93 Difference]: Finished difference Result 35761 states and 38184 transitions. [2022-07-13 13:02:40,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 13:02:40,661 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-13 13:02:40,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 13:02:40,679 INFO L225 Difference]: With dead ends: 35761 [2022-07-13 13:02:40,679 INFO L226 Difference]: Without dead ends: 19226 [2022-07-13 13:02:40,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:02:40,691 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.7s IncrementalHoareTripleChecker+Time [2022-07-13 13:02:40,691 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.7s Time] [2022-07-13 13:02:40,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19226 states. [2022-07-13 13:02:40,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19226 to 18927. [2022-07-13 13:02:40,849 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-13 13:02:40,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18927 states to 18927 states and 19964 transitions. [2022-07-13 13:02:40,865 INFO L78 Accepts]: Start accepts. Automaton has 18927 states and 19964 transitions. Word has length 684 [2022-07-13 13:02:40,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 13:02:40,866 INFO L495 AbstractCegarLoop]: Abstraction has 18927 states and 19964 transitions. [2022-07-13 13:02:40,866 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-13 13:02:40,866 INFO L276 IsEmpty]: Start isEmpty. Operand 18927 states and 19964 transitions. [2022-07-13 13:02:40,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 695 [2022-07-13 13:02:40,873 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 13:02:40,874 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-13 13:02:40,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-13 13:02:40,874 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 13:02:40,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 13:02:40,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1636456743, now seen corresponding path program 1 times [2022-07-13 13:02:40,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 13:02:40,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868459082] [2022-07-13 13:02:40,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:02:40,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 13:02:40,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:02:41,221 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-13 13:02:41,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 13:02:41,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868459082] [2022-07-13 13:02:41,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868459082] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 13:02:41,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383774899] [2022-07-13 13:02:41,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:02:41,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 13:02:41,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 13:02:41,224 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-13 13:02:41,263 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-13 13:02:41,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:02:41,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 822 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 13:02:41,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 13:02:41,725 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-13 13:02:41,725 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 13:02:41,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383774899] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 13:02:41,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 13:02:41,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-07-13 13:02:41,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233689250] [2022-07-13 13:02:41,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 13:02:41,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 13:02:41,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 13:02:41,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 13:02:41,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 13:02:41,730 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-13 13:02:42,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 13:02:42,540 INFO L93 Difference]: Finished difference Result 37555 states and 39628 transitions. [2022-07-13 13:02:42,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 13:02:42,540 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-13 13:02:42,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 13:02:42,560 INFO L225 Difference]: With dead ends: 37555 [2022-07-13 13:02:42,561 INFO L226 Difference]: Without dead ends: 18929 [2022-07-13 13:02:42,573 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-13 13:02:42,574 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-13 13:02:42,574 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-13 13:02:42,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18929 states. [2022-07-13 13:02:42,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18929 to 18626. [2022-07-13 13:02:42,790 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-13 13:02:42,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18626 states to 18626 states and 19534 transitions. [2022-07-13 13:02:42,806 INFO L78 Accepts]: Start accepts. Automaton has 18626 states and 19534 transitions. Word has length 694 [2022-07-13 13:02:42,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 13:02:42,807 INFO L495 AbstractCegarLoop]: Abstraction has 18626 states and 19534 transitions. [2022-07-13 13:02:42,807 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-13 13:02:42,807 INFO L276 IsEmpty]: Start isEmpty. Operand 18626 states and 19534 transitions. [2022-07-13 13:02:42,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2022-07-13 13:02:42,817 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 13:02:42,817 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-13 13:02:42,837 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-13 13:02:43,031 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-13 13:02:43,032 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 13:02:43,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 13:02:43,032 INFO L85 PathProgramCache]: Analyzing trace with hash 696512821, now seen corresponding path program 1 times [2022-07-13 13:02:43,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 13:02:43,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930266434] [2022-07-13 13:02:43,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:02:43,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 13:02:43,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:02:43,321 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-13 13:02:43,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 13:02:43,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930266434] [2022-07-13 13:02:43,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930266434] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 13:02:43,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 13:02:43,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 13:02:43,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543437355] [2022-07-13 13:02:43,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 13:02:43,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 13:02:43,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 13:02:43,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 13:02:43,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 13:02:43,324 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-13 13:02:44,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 13:02:44,630 INFO L93 Difference]: Finished difference Result 42657 states and 44659 transitions. [2022-07-13 13:02:44,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 13:02:44,630 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-13 13:02:44,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 13:02:44,648 INFO L225 Difference]: With dead ends: 42657 [2022-07-13 13:02:44,649 INFO L226 Difference]: Without dead ends: 24332 [2022-07-13 13:02:44,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 13:02:44,658 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-13 13:02:44,658 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-13 13:02:44,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24332 states. [2022-07-13 13:02:44,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24332 to 22533. [2022-07-13 13:02:44,878 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-13 13:02:44,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22533 states to 22533 states and 23504 transitions. [2022-07-13 13:02:44,898 INFO L78 Accepts]: Start accepts. Automaton has 22533 states and 23504 transitions. Word has length 732 [2022-07-13 13:02:44,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 13:02:44,899 INFO L495 AbstractCegarLoop]: Abstraction has 22533 states and 23504 transitions. [2022-07-13 13:02:44,899 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-13 13:02:44,899 INFO L276 IsEmpty]: Start isEmpty. Operand 22533 states and 23504 transitions. [2022-07-13 13:02:44,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 747 [2022-07-13 13:02:44,906 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 13:02:44,907 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-13 13:02:44,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-13 13:02:44,907 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 13:02:44,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 13:02:44,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1684182335, now seen corresponding path program 1 times [2022-07-13 13:02:44,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 13:02:44,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431143670] [2022-07-13 13:02:44,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:02:44,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 13:02:44,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:02:45,210 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-13 13:02:45,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 13:02:45,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431143670] [2022-07-13 13:02:45,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431143670] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 13:02:45,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82232115] [2022-07-13 13:02:45,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:02:45,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 13:02:45,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 13:02:45,214 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-13 13:02:45,259 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-13 13:02:45,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:02:45,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 13:02:45,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 13:02:47,307 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-13 13:02:47,310 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 13:02:47,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82232115] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 13:02:47,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 13:02:47,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-07-13 13:02:47,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145437295] [2022-07-13 13:02:47,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 13:02:47,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 13:02:47,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 13:02:47,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 13:02:47,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 13:02:47,315 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-13 13:02:47,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 13:02:47,383 INFO L93 Difference]: Finished difference Result 23437 states and 24418 transitions. [2022-07-13 13:02:47,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 13:02:47,383 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-13 13:02:47,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 13:02:47,402 INFO L225 Difference]: With dead ends: 23437 [2022-07-13 13:02:47,403 INFO L226 Difference]: Without dead ends: 23435 [2022-07-13 13:02:47,406 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-13 13:02:47,407 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-13 13:02:47,407 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-13 13:02:47,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23435 states. [2022-07-13 13:02:47,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23435 to 22234. [2022-07-13 13:02:47,582 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-13 13:02:47,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22234 states to 22234 states and 23185 transitions. [2022-07-13 13:02:47,693 INFO L78 Accepts]: Start accepts. Automaton has 22234 states and 23185 transitions. Word has length 746 [2022-07-13 13:02:47,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 13:02:47,693 INFO L495 AbstractCegarLoop]: Abstraction has 22234 states and 23185 transitions. [2022-07-13 13:02:47,694 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-13 13:02:47,694 INFO L276 IsEmpty]: Start isEmpty. Operand 22234 states and 23185 transitions. [2022-07-13 13:02:47,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 866 [2022-07-13 13:02:47,707 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 13:02:47,708 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-13 13:02:47,728 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-13 13:02:47,908 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-13 13:02:47,908 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 13:02:47,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 13:02:47,910 INFO L85 PathProgramCache]: Analyzing trace with hash 341621360, now seen corresponding path program 1 times [2022-07-13 13:02:47,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 13:02:47,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427419610] [2022-07-13 13:02:47,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:02:47,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 13:02:48,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:02:48,255 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-13 13:02:48,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 13:02:48,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427419610] [2022-07-13 13:02:48,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427419610] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 13:02:48,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 13:02:48,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 13:02:48,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476980396] [2022-07-13 13:02:48,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 13:02:48,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 13:02:48,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 13:02:48,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 13:02:48,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 13:02:48,257 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-13 13:02:49,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 13:02:49,475 INFO L93 Difference]: Finished difference Result 44956 states and 46868 transitions. [2022-07-13 13:02:49,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 13:02:49,476 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-13 13:02:49,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 13:02:49,500 INFO L225 Difference]: With dead ends: 44956 [2022-07-13 13:02:49,501 INFO L226 Difference]: Without dead ends: 23023 [2022-07-13 13:02:49,515 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-13 13:02:49,517 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-13 13:02:49,517 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-13 13:02:49,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23023 states. [2022-07-13 13:02:49,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23023 to 22834. [2022-07-13 13:02:49,746 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-13 13:02:49,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22834 states to 22834 states and 23789 transitions. [2022-07-13 13:02:49,766 INFO L78 Accepts]: Start accepts. Automaton has 22834 states and 23789 transitions. Word has length 865 [2022-07-13 13:02:49,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 13:02:49,767 INFO L495 AbstractCegarLoop]: Abstraction has 22834 states and 23789 transitions. [2022-07-13 13:02:49,767 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-13 13:02:49,767 INFO L276 IsEmpty]: Start isEmpty. Operand 22834 states and 23789 transitions. [2022-07-13 13:02:49,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 896 [2022-07-13 13:02:49,780 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 13:02:49,780 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-13 13:02:49,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-13 13:02:49,780 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 13:02:49,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 13:02:49,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1669164797, now seen corresponding path program 1 times [2022-07-13 13:02:49,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 13:02:49,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024072605] [2022-07-13 13:02:49,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:02:49,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 13:02:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:02:50,082 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-13 13:02:50,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 13:02:50,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024072605] [2022-07-13 13:02:50,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024072605] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 13:02:50,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 13:02:50,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 13:02:50,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118353574] [2022-07-13 13:02:50,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 13:02:50,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 13:02:50,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 13:02:50,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 13:02:50,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:02:50,085 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-13 13:02:50,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 13:02:50,975 INFO L93 Difference]: Finished difference Result 45663 states and 47588 transitions. [2022-07-13 13:02:50,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 13:02:50,976 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-13 13:02:50,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 13:02:50,995 INFO L225 Difference]: With dead ends: 45663 [2022-07-13 13:02:50,995 INFO L226 Difference]: Without dead ends: 23130 [2022-07-13 13:02:51,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:02:51,084 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-13 13:02:51,084 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-13 13:02:51,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23130 states. [2022-07-13 13:02:51,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23130 to 21634. [2022-07-13 13:02:51,310 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-13 13:02:51,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21634 states to 21634 states and 22528 transitions. [2022-07-13 13:02:51,336 INFO L78 Accepts]: Start accepts. Automaton has 21634 states and 22528 transitions. Word has length 895 [2022-07-13 13:02:51,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 13:02:51,338 INFO L495 AbstractCegarLoop]: Abstraction has 21634 states and 22528 transitions. [2022-07-13 13:02:51,339 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-13 13:02:51,339 INFO L276 IsEmpty]: Start isEmpty. Operand 21634 states and 22528 transitions. [2022-07-13 13:02:51,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 901 [2022-07-13 13:02:51,353 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 13:02:51,354 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-13 13:02:51,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-13 13:02:51,354 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 13:02:51,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 13:02:51,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1629824559, now seen corresponding path program 1 times [2022-07-13 13:02:51,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 13:02:51,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228166301] [2022-07-13 13:02:51,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:02:51,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 13:02:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:02:51,867 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-13 13:02:51,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 13:02:51,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228166301] [2022-07-13 13:02:51,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228166301] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 13:02:51,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59006433] [2022-07-13 13:02:51,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:02:51,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 13:02:51,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 13:02:51,873 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-13 13:02:51,874 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-13 13:02:52,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:02:52,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 1065 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 13:02:52,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 13:02:52,292 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-13 13:02:52,292 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 13:02:52,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59006433] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 13:02:52,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 13:02:52,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2022-07-13 13:02:52,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587613500] [2022-07-13 13:02:52,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 13:02:52,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 13:02:52,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 13:02:52,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 13:02:52,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-13 13:02:52,295 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-13 13:02:53,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 13:02:53,286 INFO L93 Difference]: Finished difference Result 42666 states and 44447 transitions. [2022-07-13 13:02:53,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 13:02:53,286 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-13 13:02:53,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 13:02:53,302 INFO L225 Difference]: With dead ends: 42666 [2022-07-13 13:02:53,303 INFO L226 Difference]: Without dead ends: 21333 [2022-07-13 13:02:53,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 909 GetRequests, 902 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-13 13:02:53,311 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.8s IncrementalHoareTripleChecker+Time [2022-07-13 13:02:53,311 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.8s Time] [2022-07-13 13:02:53,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21333 states. [2022-07-13 13:02:53,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21333 to 21333. [2022-07-13 13:02:53,475 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-13 13:02:53,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21333 states to 21333 states and 22012 transitions. [2022-07-13 13:02:53,495 INFO L78 Accepts]: Start accepts. Automaton has 21333 states and 22012 transitions. Word has length 900 [2022-07-13 13:02:53,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 13:02:53,496 INFO L495 AbstractCegarLoop]: Abstraction has 21333 states and 22012 transitions. [2022-07-13 13:02:53,496 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-13 13:02:53,496 INFO L276 IsEmpty]: Start isEmpty. Operand 21333 states and 22012 transitions. [2022-07-13 13:02:53,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 920 [2022-07-13 13:02:53,511 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 13:02:53,512 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-13 13:02:53,538 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-13 13:02:53,735 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-13 13:02:53,736 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 13:02:53,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 13:02:53,736 INFO L85 PathProgramCache]: Analyzing trace with hash -470354541, now seen corresponding path program 1 times [2022-07-13 13:02:53,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 13:02:53,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136686087] [2022-07-13 13:02:53,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:02:53,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 13:02:53,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:02:54,094 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-13 13:02:54,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 13:02:54,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136686087] [2022-07-13 13:02:54,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136686087] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 13:02:54,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 13:02:54,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 13:02:54,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477064071] [2022-07-13 13:02:54,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 13:02:54,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 13:02:54,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 13:02:54,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 13:02:54,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 13:02:54,097 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-13 13:02:55,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 13:02:55,710 INFO L93 Difference]: Finished difference Result 44646 states and 46038 transitions. [2022-07-13 13:02:55,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 13:02:55,710 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-13 13:02:55,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 13:02:55,728 INFO L225 Difference]: With dead ends: 44646 [2022-07-13 13:02:55,728 INFO L226 Difference]: Without dead ends: 23614 [2022-07-13 13:02:55,736 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-13 13:02:55,737 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-13 13:02:55,737 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-13 13:02:55,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23614 states. [2022-07-13 13:02:55,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23614 to 21333. [2022-07-13 13:02:55,912 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-13 13:02:55,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21333 states to 21333 states and 22011 transitions. [2022-07-13 13:02:55,935 INFO L78 Accepts]: Start accepts. Automaton has 21333 states and 22011 transitions. Word has length 919 [2022-07-13 13:02:55,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 13:02:55,936 INFO L495 AbstractCegarLoop]: Abstraction has 21333 states and 22011 transitions. [2022-07-13 13:02:55,936 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-13 13:02:55,936 INFO L276 IsEmpty]: Start isEmpty. Operand 21333 states and 22011 transitions. [2022-07-13 13:02:55,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 953 [2022-07-13 13:02:55,952 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 13:02:55,953 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-13 13:02:55,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-13 13:02:55,953 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 13:02:55,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 13:02:55,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1011364661, now seen corresponding path program 1 times [2022-07-13 13:02:55,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 13:02:55,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307573797] [2022-07-13 13:02:55,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:02:55,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 13:02:56,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:02:56,308 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-13 13:02:56,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 13:02:56,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307573797] [2022-07-13 13:02:56,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307573797] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 13:02:56,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 13:02:56,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 13:02:56,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536014289] [2022-07-13 13:02:56,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 13:02:56,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 13:02:56,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 13:02:56,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 13:02:56,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 13:02:56,311 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-13 13:02:57,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 13:02:57,912 INFO L93 Difference]: Finished difference Result 43731 states and 45101 transitions. [2022-07-13 13:02:57,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 13:02:57,913 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-13 13:02:57,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 13:02:57,930 INFO L225 Difference]: With dead ends: 43731 [2022-07-13 13:02:57,930 INFO L226 Difference]: Without dead ends: 22699 [2022-07-13 13:02:57,936 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-13 13:02:57,937 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.4s IncrementalHoareTripleChecker+Time [2022-07-13 13:02:57,937 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.4s Time] [2022-07-13 13:02:57,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22699 states. [2022-07-13 13:02:58,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22699 to 18630. [2022-07-13 13:02:58,106 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-13 13:02:58,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18630 states to 18630 states and 19259 transitions. [2022-07-13 13:02:58,122 INFO L78 Accepts]: Start accepts. Automaton has 18630 states and 19259 transitions. Word has length 952 [2022-07-13 13:02:58,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 13:02:58,123 INFO L495 AbstractCegarLoop]: Abstraction has 18630 states and 19259 transitions. [2022-07-13 13:02:58,123 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-13 13:02:58,123 INFO L276 IsEmpty]: Start isEmpty. Operand 18630 states and 19259 transitions. [2022-07-13 13:02:58,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1013 [2022-07-13 13:02:58,139 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 13:02:58,140 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-13 13:02:58,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-13 13:02:58,140 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 13:02:58,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 13:02:58,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1022383996, now seen corresponding path program 1 times [2022-07-13 13:02:58,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 13:02:58,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64469598] [2022-07-13 13:02:58,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:02:58,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 13:02:58,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:02:58,459 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-13 13:02:58,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 13:02:58,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64469598] [2022-07-13 13:02:58,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64469598] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 13:02:58,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 13:02:58,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 13:02:58,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833108050] [2022-07-13 13:02:58,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 13:02:58,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 13:02:58,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 13:02:58,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 13:02:58,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:02:58,462 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-13 13:02:59,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 13:02:59,272 INFO L93 Difference]: Finished difference Result 36959 states and 38215 transitions. [2022-07-13 13:02:59,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 13:02:59,273 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-13 13:02:59,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 13:02:59,290 INFO L225 Difference]: With dead ends: 36959 [2022-07-13 13:02:59,290 INFO L226 Difference]: Without dead ends: 18630 [2022-07-13 13:02:59,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:02:59,301 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-13 13:02:59,301 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-13 13:02:59,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18630 states. [2022-07-13 13:02:59,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18630 to 18030. [2022-07-13 13:02:59,526 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-13 13:02:59,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18030 states to 18030 states and 18542 transitions. [2022-07-13 13:02:59,544 INFO L78 Accepts]: Start accepts. Automaton has 18030 states and 18542 transitions. Word has length 1012 [2022-07-13 13:02:59,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 13:02:59,545 INFO L495 AbstractCegarLoop]: Abstraction has 18030 states and 18542 transitions. [2022-07-13 13:02:59,545 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-13 13:02:59,545 INFO L276 IsEmpty]: Start isEmpty. Operand 18030 states and 18542 transitions. [2022-07-13 13:02:59,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1014 [2022-07-13 13:02:59,560 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 13:02:59,561 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-13 13:02:59,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-13 13:02:59,561 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 13:02:59,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 13:02:59,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1553755039, now seen corresponding path program 1 times [2022-07-13 13:02:59,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 13:02:59,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262537472] [2022-07-13 13:02:59,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:02:59,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 13:02:59,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:02:59,894 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-13 13:02:59,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 13:02:59,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262537472] [2022-07-13 13:02:59,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262537472] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 13:02:59,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 13:02:59,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 13:02:59,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277160349] [2022-07-13 13:02:59,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 13:02:59,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 13:02:59,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 13:02:59,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 13:02:59,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:02:59,898 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-13 13:03:00,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 13:03:00,673 INFO L93 Difference]: Finished difference Result 30641 states and 31385 transitions. [2022-07-13 13:03:00,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 13:03:00,674 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-13 13:03:00,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 13:03:00,689 INFO L225 Difference]: With dead ends: 30641 [2022-07-13 13:03:00,689 INFO L226 Difference]: Without dead ends: 12912 [2022-07-13 13:03:00,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 13:03:00,698 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 323 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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-13 13:03:00,698 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-13 13:03:00,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12912 states. [2022-07-13 13:03:00,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12912 to 11409. [2022-07-13 13:03:00,784 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-13 13:03:00,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11409 states to 11409 states and 11602 transitions. [2022-07-13 13:03:00,792 INFO L78 Accepts]: Start accepts. Automaton has 11409 states and 11602 transitions. Word has length 1013 [2022-07-13 13:03:00,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 13:03:00,793 INFO L495 AbstractCegarLoop]: Abstraction has 11409 states and 11602 transitions. [2022-07-13 13:03:00,793 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-13 13:03:00,793 INFO L276 IsEmpty]: Start isEmpty. Operand 11409 states and 11602 transitions. [2022-07-13 13:03:00,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1167 [2022-07-13 13:03:00,806 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 13:03:00,807 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-13 13:03:00,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-13 13:03:00,807 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 13:03:00,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 13:03:00,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1574290295, now seen corresponding path program 1 times [2022-07-13 13:03:00,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 13:03:00,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353234849] [2022-07-13 13:03:00,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:03:00,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 13:03:00,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:03:01,288 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-13 13:03:01,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 13:03:01,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353234849] [2022-07-13 13:03:01,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353234849] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 13:03:01,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057040921] [2022-07-13 13:03:01,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:03:01,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 13:03:01,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 13:03:01,292 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-13 13:03:01,331 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-13 13:03:01,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:03:01,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 1370 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 13:03:01,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 13:03:01,946 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-13 13:03:01,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 13:03:02,277 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-13 13:03:02,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057040921] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 13:03:02,278 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 13:03:02,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 12 [2022-07-13 13:03:02,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850110465] [2022-07-13 13:03:02,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 13:03:02,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 13:03:02,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 13:03:02,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 13:03:02,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-07-13 13:03:02,282 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-13 13:03:15,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 13:03:15,276 INFO L93 Difference]: Finished difference Result 34979 states and 35549 transitions. [2022-07-13 13:03:15,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-07-13 13:03:15,277 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-13 13:03:15,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 13:03:15,300 INFO L225 Difference]: With dead ends: 34979 [2022-07-13 13:03:15,300 INFO L226 Difference]: Without dead ends: 23871 [2022-07-13 13:03:15,312 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-13 13:03:15,313 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 14426 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 20840 mSolverCounterSat, 957 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s 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-13 13:03:15,313 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-13 13:03:15,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23871 states. [2022-07-13 13:03:15,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23871 to 11104. [2022-07-13 13:03:15,483 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-13 13:03:15,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11104 states to 11104 states and 11251 transitions. [2022-07-13 13:03:15,491 INFO L78 Accepts]: Start accepts. Automaton has 11104 states and 11251 transitions. Word has length 1166 [2022-07-13 13:03:15,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 13:03:15,492 INFO L495 AbstractCegarLoop]: Abstraction has 11104 states and 11251 transitions. [2022-07-13 13:03:15,492 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-13 13:03:15,492 INFO L276 IsEmpty]: Start isEmpty. Operand 11104 states and 11251 transitions. [2022-07-13 13:03:15,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1224 [2022-07-13 13:03:15,507 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 13:03:15,508 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-13 13:03:15,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 13:03:15,711 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-13 13:03:15,712 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 13:03:15,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 13:03:15,712 INFO L85 PathProgramCache]: Analyzing trace with hash 550818549, now seen corresponding path program 1 times [2022-07-13 13:03:15,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 13:03:15,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005537134] [2022-07-13 13:03:15,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 13:03:15,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 13:03:15,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 13:03:16,174 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-13 13:03:16,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 13:03:16,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005537134] [2022-07-13 13:03:16,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005537134] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 13:03:16,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 13:03:16,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 13:03:16,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410155639] [2022-07-13 13:03:16,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 13:03:16,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 13:03:16,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 13:03:16,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 13:03:16,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 13:03:16,178 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-13 13:03:17,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 13:03:17,350 INFO L93 Difference]: Finished difference Result 14104 states and 14288 transitions. [2022-07-13 13:03:17,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 13:03:17,351 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-13 13:03:17,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 13:03:17,351 INFO L225 Difference]: With dead ends: 14104 [2022-07-13 13:03:17,351 INFO L226 Difference]: Without dead ends: 0 [2022-07-13 13:03:17,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 13:03:17,356 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.1s IncrementalHoareTripleChecker+Time [2022-07-13 13:03:17,357 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.1s Time] [2022-07-13 13:03:17,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-13 13:03:17,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-13 13:03:17,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 13:03:17,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-13 13:03:17,358 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1223 [2022-07-13 13:03:17,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 13:03:17,358 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 13:03:17,358 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-13 13:03:17,358 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-13 13:03:17,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-13 13:03:17,361 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 13:03:17,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-13 13:03:17,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-13 13:03:50,129 WARN L233 SmtUtils]: Spent 29.93s 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-13 13:04:20,067 WARN L233 SmtUtils]: Spent 29.93s 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-13 13:04:32,081 INFO L899 garLoopResultBuilder]: For program point L630(lines 630 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,081 INFO L899 garLoopResultBuilder]: For program point L1423(lines 1423 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,081 INFO L899 garLoopResultBuilder]: For program point L895(lines 895 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,081 INFO L899 garLoopResultBuilder]: For program point L1688(lines 1688 1766) no Hoare annotation was computed. [2022-07-13 13:04:32,081 INFO L899 garLoopResultBuilder]: For program point L1160(lines 1160 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,081 INFO L899 garLoopResultBuilder]: For program point L103-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,082 INFO L899 garLoopResultBuilder]: For program point L896(lines 896 904) no Hoare annotation was computed. [2022-07-13 13:04:32,082 INFO L899 garLoopResultBuilder]: For program point L896-2(lines 896 904) no Hoare annotation was computed. [2022-07-13 13:04:32,082 INFO L899 garLoopResultBuilder]: For program point L764(lines 764 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,082 INFO L899 garLoopResultBuilder]: For program point L1557(lines 1557 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,082 INFO L899 garLoopResultBuilder]: For program point L1293(lines 1293 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,082 INFO L899 garLoopResultBuilder]: For program point L104(line 104) no Hoare annotation was computed. [2022-07-13 13:04:32,082 INFO L899 garLoopResultBuilder]: For program point L1029(lines 1029 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,082 INFO L899 garLoopResultBuilder]: For program point L501(lines 501 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,082 INFO L899 garLoopResultBuilder]: For program point L106-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,082 INFO L899 garLoopResultBuilder]: For program point L371(lines 371 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,082 INFO L899 garLoopResultBuilder]: For program point L239(lines 239 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,082 INFO L899 garLoopResultBuilder]: For program point L107(line 107) no Hoare annotation was computed. [2022-07-13 13:04:32,083 INFO L899 garLoopResultBuilder]: For program point L1429(lines 1429 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,083 INFO L899 garLoopResultBuilder]: For program point L637(lines 637 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,083 INFO L899 garLoopResultBuilder]: For program point L1430(lines 1430 1440) no Hoare annotation was computed. [2022-07-13 13:04:32,083 INFO L899 garLoopResultBuilder]: For program point L1430-2(lines 1430 1440) no Hoare annotation was computed. [2022-07-13 13:04:32,083 INFO L899 garLoopResultBuilder]: For program point L1166(lines 1166 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,083 INFO L899 garLoopResultBuilder]: For program point L109-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,083 INFO L899 garLoopResultBuilder]: For program point L1695(lines 1695 1766) no Hoare annotation was computed. [2022-07-13 13:04:32,083 INFO L899 garLoopResultBuilder]: For program point L1299(lines 1299 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,083 INFO L899 garLoopResultBuilder]: For program point L110(line 110) no Hoare annotation was computed. [2022-07-13 13:04:32,083 INFO L899 garLoopResultBuilder]: For program point L771(lines 771 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,083 INFO L899 garLoopResultBuilder]: For program point L1696(lines 1696 1703) no Hoare annotation was computed. [2022-07-13 13:04:32,083 INFO L899 garLoopResultBuilder]: For program point L1696-2(lines 1696 1703) no Hoare annotation was computed. [2022-07-13 13:04:32,083 INFO L899 garLoopResultBuilder]: For program point L1564(lines 1564 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,083 INFO L899 garLoopResultBuilder]: For program point L507(lines 507 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,083 INFO L899 garLoopResultBuilder]: For program point L1300(lines 1300 1309) no Hoare annotation was computed. [2022-07-13 13:04:32,083 INFO L899 garLoopResultBuilder]: For program point L1300-2(lines 1300 1309) no Hoare annotation was computed. [2022-07-13 13:04:32,083 INFO L899 garLoopResultBuilder]: For program point L1036(lines 1036 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,083 INFO L899 garLoopResultBuilder]: For program point L244(lines 244 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,083 INFO L899 garLoopResultBuilder]: For program point L112-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,084 INFO L899 garLoopResultBuilder]: For program point L905(lines 905 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,084 INFO L899 garLoopResultBuilder]: For program point L377(lines 377 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,084 INFO L899 garLoopResultBuilder]: For program point L113(line 113) no Hoare annotation was computed. [2022-07-13 13:04:32,084 INFO L899 garLoopResultBuilder]: For program point L1172(lines 1172 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,084 INFO L899 garLoopResultBuilder]: For program point L115-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,084 INFO L899 garLoopResultBuilder]: For program point L1040(lines 1040 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,084 INFO L899 garLoopResultBuilder]: For program point L644(lines 644 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,084 INFO L899 garLoopResultBuilder]: For program point L1569(lines 1569 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,084 INFO L899 garLoopResultBuilder]: For program point L512(lines 512 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,084 INFO L899 garLoopResultBuilder]: For program point L116(line 116) no Hoare annotation was computed. [2022-07-13 13:04:32,084 INFO L899 garLoopResultBuilder]: For program point L778(lines 778 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,084 INFO L899 garLoopResultBuilder]: For program point L118-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,084 INFO L899 garLoopResultBuilder]: For program point L911(lines 911 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,084 INFO L899 garLoopResultBuilder]: For program point L1704(lines 1704 1766) no Hoare annotation was computed. [2022-07-13 13:04:32,084 INFO L899 garLoopResultBuilder]: For program point L383(lines 383 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,084 INFO L899 garLoopResultBuilder]: For program point L251(lines 251 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,084 INFO L899 garLoopResultBuilder]: For program point L119(line 119) no Hoare annotation was computed. [2022-07-13 13:04:32,084 INFO L899 garLoopResultBuilder]: For program point L1441(lines 1441 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,084 INFO L899 garLoopResultBuilder]: For program point L1045(lines 1045 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,085 INFO L899 garLoopResultBuilder]: For program point L517(lines 517 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,085 INFO L899 garLoopResultBuilder]: For program point L1310(lines 1310 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,085 INFO L899 garLoopResultBuilder]: For program point L1178(lines 1178 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,085 INFO L899 garLoopResultBuilder]: For program point L121-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,085 INFO L899 garLoopResultBuilder]: For program point L122(line 122) no Hoare annotation was computed. [2022-07-13 13:04:32,085 INFO L899 garLoopResultBuilder]: For program point L651(lines 651 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,085 INFO L899 garLoopResultBuilder]: For program point L1576(lines 1576 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,085 INFO L899 garLoopResultBuilder]: For program point L1048(lines 1048 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,085 INFO L899 garLoopResultBuilder]: For program point L784(lines 784 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,085 INFO L899 garLoopResultBuilder]: For program point L652(lines 652 661) no Hoare annotation was computed. [2022-07-13 13:04:32,085 INFO L899 garLoopResultBuilder]: For program point L652-2(lines 652 661) no Hoare annotation was computed. [2022-07-13 13:04:32,085 INFO L899 garLoopResultBuilder]: For program point L124-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,085 INFO L899 garLoopResultBuilder]: For program point L917(lines 917 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,085 INFO L899 garLoopResultBuilder]: For program point L257(lines 257 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,085 INFO L899 garLoopResultBuilder]: For program point L1182(lines 1182 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,085 INFO L899 garLoopResultBuilder]: For program point L125(line 125) no Hoare annotation was computed. [2022-07-13 13:04:32,085 INFO L899 garLoopResultBuilder]: For program point L1711(lines 1711 1766) no Hoare annotation was computed. [2022-07-13 13:04:32,085 INFO L899 garLoopResultBuilder]: For program point L390(lines 390 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,086 INFO L899 garLoopResultBuilder]: For program point L1580(lines 1580 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,086 INFO L899 garLoopResultBuilder]: For program point L1448(lines 1448 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,086 INFO L899 garLoopResultBuilder]: For program point L1316(lines 1316 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,086 INFO L899 garLoopResultBuilder]: For program point L127-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,086 INFO L899 garLoopResultBuilder]: For program point L1581(lines 1581 1591) no Hoare annotation was computed. [2022-07-13 13:04:32,086 INFO L899 garLoopResultBuilder]: For program point L524(lines 524 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,086 INFO L899 garLoopResultBuilder]: For program point L1581-2(lines 1581 1591) no Hoare annotation was computed. [2022-07-13 13:04:32,086 INFO L899 garLoopResultBuilder]: For program point L1449(lines 1449 1458) no Hoare annotation was computed. [2022-07-13 13:04:32,086 INFO L899 garLoopResultBuilder]: For program point L1449-2(lines 1449 1458) no Hoare annotation was computed. [2022-07-13 13:04:32,086 INFO L899 garLoopResultBuilder]: For program point L128(line 128) no Hoare annotation was computed. [2022-07-13 13:04:32,086 INFO L899 garLoopResultBuilder]: For program point L789(lines 789 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,086 INFO L899 garLoopResultBuilder]: For program point L1054(lines 1054 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,086 INFO L899 garLoopResultBuilder]: For program point L922(lines 922 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,086 INFO L899 garLoopResultBuilder]: For program point L394(lines 394 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,086 INFO L899 garLoopResultBuilder]: For program point L130-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,086 INFO L899 garLoopResultBuilder]: For program point L1716(lines 1716 1766) no Hoare annotation was computed. [2022-07-13 13:04:32,086 INFO L899 garLoopResultBuilder]: For program point L263(lines 263 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,086 INFO L899 garLoopResultBuilder]: For program point L1188(lines 1188 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,086 INFO L899 garLoopResultBuilder]: For program point L131(line 131) no Hoare annotation was computed. [2022-07-13 13:04:32,087 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-13 13:04:32,087 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 182) no Hoare annotation was computed. [2022-07-13 13:04:32,087 INFO L899 garLoopResultBuilder]: For program point L133-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,087 INFO L899 garLoopResultBuilder]: For program point L1719(lines 1719 1766) no Hoare annotation was computed. [2022-07-13 13:04:32,087 INFO L899 garLoopResultBuilder]: For program point L662(lines 662 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,087 INFO L899 garLoopResultBuilder]: For program point L530(lines 530 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,087 INFO L899 garLoopResultBuilder]: For program point L1323(lines 1323 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,087 INFO L899 garLoopResultBuilder]: For program point L134(line 134) no Hoare annotation was computed. [2022-07-13 13:04:32,087 INFO L899 garLoopResultBuilder]: For program point L1059(lines 1059 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,087 INFO L899 garLoopResultBuilder]: For program point L1720(lines 1720 1731) no Hoare annotation was computed. [2022-07-13 13:04:32,087 INFO L899 garLoopResultBuilder]: For program point L1720-2(lines 1720 1731) no Hoare annotation was computed. [2022-07-13 13:04:32,087 INFO L899 garLoopResultBuilder]: For program point L531(lines 531 538) no Hoare annotation was computed. [2022-07-13 13:04:32,088 INFO L899 garLoopResultBuilder]: For program point L531-2(lines 531 538) no Hoare annotation was computed. [2022-07-13 13:04:32,088 INFO L899 garLoopResultBuilder]: For program point L1060(lines 1060 1071) no Hoare annotation was computed. [2022-07-13 13:04:32,088 INFO L899 garLoopResultBuilder]: For program point L1060-2(lines 1060 1071) no Hoare annotation was computed. [2022-07-13 13:04:32,088 INFO L899 garLoopResultBuilder]: For program point L796(lines 796 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,088 INFO L899 garLoopResultBuilder]: For program point L400(lines 400 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,088 INFO L899 garLoopResultBuilder]: For program point L136-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,088 INFO L899 garLoopResultBuilder]: For program point L929(lines 929 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,088 INFO L899 garLoopResultBuilder]: For program point L401(lines 401 412) no Hoare annotation was computed. [2022-07-13 13:04:32,088 INFO L899 garLoopResultBuilder]: For program point L401-2(lines 401 412) no Hoare annotation was computed. [2022-07-13 13:04:32,088 INFO L899 garLoopResultBuilder]: For program point L1194(lines 1194 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,088 INFO L899 garLoopResultBuilder]: For program point L137(line 137) no Hoare annotation was computed. [2022-07-13 13:04:32,088 INFO L899 garLoopResultBuilder]: For program point L1459(lines 1459 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,088 INFO L899 garLoopResultBuilder]: For program point L1327(lines 1327 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,088 INFO L899 garLoopResultBuilder]: For program point L270(lines 270 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,088 INFO L899 garLoopResultBuilder]: For program point L667(lines 667 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,089 INFO L899 garLoopResultBuilder]: For program point L1592(lines 1592 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,089 INFO L899 garLoopResultBuilder]: For program point L139-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,089 INFO L899 garLoopResultBuilder]: For program point L140(line 140) no Hoare annotation was computed. [2022-07-13 13:04:32,089 INFO L899 garLoopResultBuilder]: For program point L1331(lines 1331 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,089 INFO L899 garLoopResultBuilder]: For program point L142-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,089 INFO L899 garLoopResultBuilder]: For program point L935(lines 935 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,089 INFO L899 garLoopResultBuilder]: For program point L803(lines 803 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,089 INFO L899 garLoopResultBuilder]: For program point L539(lines 539 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,089 INFO L899 garLoopResultBuilder]: For program point L1332(lines 1332 1342) no Hoare annotation was computed. [2022-07-13 13:04:32,089 INFO L899 garLoopResultBuilder]: For program point L1332-2(lines 1332 1342) no Hoare annotation was computed. [2022-07-13 13:04:32,089 INFO L899 garLoopResultBuilder]: For program point L1200(lines 1200 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,089 INFO L899 garLoopResultBuilder]: For program point L143(line 143) no Hoare annotation was computed. [2022-07-13 13:04:32,089 INFO L899 garLoopResultBuilder]: For program point L804(lines 804 813) no Hoare annotation was computed. [2022-07-13 13:04:32,089 INFO L899 garLoopResultBuilder]: For program point L804-2(lines 804 813) no Hoare annotation was computed. [2022-07-13 13:04:32,089 INFO L899 garLoopResultBuilder]: For program point L672(lines 672 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,089 INFO L899 garLoopResultBuilder]: For program point L540(lines 540 551) no Hoare annotation was computed. [2022-07-13 13:04:32,089 INFO L899 garLoopResultBuilder]: For program point L540-2(lines 540 551) no Hoare annotation was computed. [2022-07-13 13:04:32,089 INFO L899 garLoopResultBuilder]: For program point L276(lines 276 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,089 INFO L899 garLoopResultBuilder]: For program point L1466(lines 1466 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,090 INFO L899 garLoopResultBuilder]: For program point L145-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,090 INFO L899 garLoopResultBuilder]: For program point L1599(lines 1599 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,090 INFO L899 garLoopResultBuilder]: For program point L146(line 146) no Hoare annotation was computed. [2022-07-13 13:04:32,090 INFO L899 garLoopResultBuilder]: For program point L1732(lines 1732 1766) no Hoare annotation was computed. [2022-07-13 13:04:32,090 INFO L899 garLoopResultBuilder]: For program point L1072(lines 1072 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,090 INFO L899 garLoopResultBuilder]: For program point L940(lines 940 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,090 INFO L899 garLoopResultBuilder]: For program point L148-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,090 INFO L899 garLoopResultBuilder]: For program point L1073(lines 1073 1083) no Hoare annotation was computed. [2022-07-13 13:04:32,090 INFO L899 garLoopResultBuilder]: For program point L1073-2(lines 1073 1083) no Hoare annotation was computed. [2022-07-13 13:04:32,090 INFO L899 garLoopResultBuilder]: For program point L413(lines 413 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,090 INFO L899 garLoopResultBuilder]: For program point L149(line 149) no Hoare annotation was computed. [2022-07-13 13:04:32,090 INFO L899 garLoopResultBuilder]: For program point L678(lines 678 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,090 INFO L899 garLoopResultBuilder]: For program point L1471(lines 1471 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,090 INFO L899 garLoopResultBuilder]: For program point L1207(lines 1207 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,090 INFO L899 garLoopResultBuilder]: For program point L283(lines 283 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,090 INFO L899 garLoopResultBuilder]: For program point L151-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,090 INFO L899 garLoopResultBuilder]: For program point L1605(lines 1605 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,090 INFO L899 garLoopResultBuilder]: For program point L152(line 152) no Hoare annotation was computed. [2022-07-13 13:04:32,091 INFO L899 garLoopResultBuilder]: For program point L945(lines 945 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,091 INFO L899 garLoopResultBuilder]: For program point L814(lines 814 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,091 INFO L899 garLoopResultBuilder]: For program point L1739(lines 1739 1766) no Hoare annotation was computed. [2022-07-13 13:04:32,091 INFO L899 garLoopResultBuilder]: For program point L418(lines 418 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,091 INFO L899 garLoopResultBuilder]: For program point L1343(lines 1343 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,091 INFO L899 garLoopResultBuilder]: For program point L154-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,091 INFO L899 garLoopResultBuilder]: For program point L1476(lines 1476 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,091 INFO L899 garLoopResultBuilder]: For program point L155(line 155) no Hoare annotation was computed. [2022-07-13 13:04:32,092 INFO L899 garLoopResultBuilder]: For program point L552(lines 552 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,092 INFO L899 garLoopResultBuilder]: For program point L288(lines 288 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,092 INFO L899 garLoopResultBuilder]: For program point L1213(lines 1213 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,092 INFO L899 garLoopResultBuilder]: For program point L685(lines 685 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,092 INFO L899 garLoopResultBuilder]: For program point L157-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,092 INFO L899 garLoopResultBuilder]: For program point L158(line 158) no Hoare annotation was computed. [2022-07-13 13:04:32,092 INFO L899 garLoopResultBuilder]: For program point L1612(lines 1612 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,092 INFO L899 garLoopResultBuilder]: For program point L1348(lines 1348 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,093 INFO L899 garLoopResultBuilder]: For program point L1084(lines 1084 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,093 INFO L899 garLoopResultBuilder]: For program point L952(lines 952 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,093 INFO L899 garLoopResultBuilder]: For program point L1745(lines 1745 1766) no Hoare annotation was computed. [2022-07-13 13:04:32,093 INFO L899 garLoopResultBuilder]: For program point L556(lines 556 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,093 INFO L899 garLoopResultBuilder]: For program point L160-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,093 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-13 13:04:32,093 INFO L899 garLoopResultBuilder]: For program point L821(lines 821 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,093 INFO L899 garLoopResultBuilder]: For program point L557(lines 557 566) no Hoare annotation was computed. [2022-07-13 13:04:32,094 INFO L899 garLoopResultBuilder]: For program point L557-2(lines 557 566) no Hoare annotation was computed. [2022-07-13 13:04:32,094 INFO L899 garLoopResultBuilder]: For program point L425(lines 425 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,094 INFO L899 garLoopResultBuilder]: For program point L1218(lines 1218 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,094 INFO L899 garLoopResultBuilder]: For program point L161(line 161) no Hoare annotation was computed. [2022-07-13 13:04:32,094 INFO L899 garLoopResultBuilder]: For program point L1483(lines 1483 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,094 INFO L899 garLoopResultBuilder]: For program point L691(lines 691 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,094 INFO L899 garLoopResultBuilder]: For program point L1616(lines 1616 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,095 INFO L899 garLoopResultBuilder]: For program point L295(lines 295 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,095 INFO L899 garLoopResultBuilder]: For program point L163-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,095 INFO L899 garLoopResultBuilder]: For program point L164(line 164) no Hoare annotation was computed. [2022-07-13 13:04:32,095 INFO L899 garLoopResultBuilder]: For program point L1354(lines 1354 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,095 INFO L899 garLoopResultBuilder]: For program point L1222(lines 1222 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,095 INFO L899 garLoopResultBuilder]: For program point L958(lines 958 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,095 INFO L899 garLoopResultBuilder]: For program point L166-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,095 INFO L899 garLoopResultBuilder]: For program point L1091(lines 1091 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,096 INFO L899 garLoopResultBuilder]: For program point L34(lines 34 36) no Hoare annotation was computed. [2022-07-13 13:04:32,096 INFO L899 garLoopResultBuilder]: For program point L34-2(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,096 INFO L899 garLoopResultBuilder]: For program point L827(lines 827 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,096 INFO L899 garLoopResultBuilder]: For program point L1752(lines 1752 1766) no Hoare annotation was computed. [2022-07-13 13:04:32,096 INFO L899 garLoopResultBuilder]: For program point L1488(lines 1488 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,096 INFO L899 garLoopResultBuilder]: For program point L167(line 167) no Hoare annotation was computed. [2022-07-13 13:04:32,096 INFO L899 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2022-07-13 13:04:32,096 INFO L899 garLoopResultBuilder]: For program point L432(lines 432 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,097 INFO L899 garLoopResultBuilder]: For program point L697(lines 697 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,097 INFO L899 garLoopResultBuilder]: For program point L1622(lines 1622 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,097 INFO L899 garLoopResultBuilder]: For program point L169-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,097 INFO L899 garLoopResultBuilder]: For program point L37-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,097 INFO L899 garLoopResultBuilder]: For program point L1623(lines 1623 1632) no Hoare annotation was computed. [2022-07-13 13:04:32,097 INFO L899 garLoopResultBuilder]: For program point L1623-2(lines 1623 1632) no Hoare annotation was computed. [2022-07-13 13:04:32,097 INFO L899 garLoopResultBuilder]: For program point L302(lines 302 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,097 INFO L899 garLoopResultBuilder]: For program point L170(line 170) no Hoare annotation was computed. [2022-07-13 13:04:32,098 INFO L899 garLoopResultBuilder]: For program point L38(line 38) no Hoare annotation was computed. [2022-07-13 13:04:32,098 INFO L899 garLoopResultBuilder]: For program point L567(lines 567 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,098 INFO L899 garLoopResultBuilder]: For program point L1492(lines 1492 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,098 INFO L899 garLoopResultBuilder]: For program point L1360(lines 1360 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,098 INFO L899 garLoopResultBuilder]: For program point L1228(lines 1228 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,098 INFO L899 garLoopResultBuilder]: For program point L1096(lines 1096 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,098 INFO L899 garLoopResultBuilder]: For program point L568(lines 568 578) no Hoare annotation was computed. [2022-07-13 13:04:32,098 INFO L899 garLoopResultBuilder]: For program point L568-2(lines 568 578) no Hoare annotation was computed. [2022-07-13 13:04:32,099 INFO L899 garLoopResultBuilder]: For program point L1361(lines 1361 1368) no Hoare annotation was computed. [2022-07-13 13:04:32,099 INFO L899 garLoopResultBuilder]: For program point L1361-2(lines 1361 1368) no Hoare annotation was computed. [2022-07-13 13:04:32,099 INFO L899 garLoopResultBuilder]: For program point L172-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,099 INFO L899 garLoopResultBuilder]: For program point L40-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,099 INFO L899 garLoopResultBuilder]: For program point L965(lines 965 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,099 INFO L899 garLoopResultBuilder]: For program point L173(line 173) no Hoare annotation was computed. [2022-07-13 13:04:32,099 INFO L899 garLoopResultBuilder]: For program point L41(line 41) no Hoare annotation was computed. [2022-07-13 13:04:32,099 INFO L899 garLoopResultBuilder]: For program point L834(lines 834 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,100 INFO L899 garLoopResultBuilder]: For program point L1759(lines 1759 1766) no Hoare annotation was computed. [2022-07-13 13:04:32,100 INFO L899 garLoopResultBuilder]: For program point L438(lines 438 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,100 INFO L899 garLoopResultBuilder]: For program point L703(lines 703 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,100 INFO L899 garLoopResultBuilder]: For program point L175-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,100 INFO L899 garLoopResultBuilder]: For program point L43-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,100 INFO L899 garLoopResultBuilder]: For program point L704(lines 704 716) no Hoare annotation was computed. [2022-07-13 13:04:32,100 INFO L899 garLoopResultBuilder]: For program point L704-2(lines 704 716) no Hoare annotation was computed. [2022-07-13 13:04:32,100 INFO L899 garLoopResultBuilder]: For program point L176(line 176) no Hoare annotation was computed. [2022-07-13 13:04:32,101 INFO L899 garLoopResultBuilder]: For program point L1101(lines 1101 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,101 INFO L899 garLoopResultBuilder]: For program point L44(line 44) no Hoare annotation was computed. [2022-07-13 13:04:32,101 INFO L899 garLoopResultBuilder]: For program point L969(lines 969 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,101 INFO L899 garLoopResultBuilder]: For program point L1498(lines 1498 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,101 INFO L899 garLoopResultBuilder]: For program point L309(lines 309 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,101 INFO L899 garLoopResultBuilder]: For program point L1234(lines 1234 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,101 INFO L899 garLoopResultBuilder]: For program point L178-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,101 INFO L899 garLoopResultBuilder]: For program point L46-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,102 INFO L899 garLoopResultBuilder]: For program point L839(lines 839 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,102 INFO L899 garLoopResultBuilder]: For program point L443(lines 443 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,102 INFO L899 garLoopResultBuilder]: For program point L179(line 179) no Hoare annotation was computed. [2022-07-13 13:04:32,102 INFO L899 garLoopResultBuilder]: For program point L47(line 47) no Hoare annotation was computed. [2022-07-13 13:04:32,102 INFO L899 garLoopResultBuilder]: For program point L840(lines 840 849) no Hoare annotation was computed. [2022-07-13 13:04:32,102 INFO L899 garLoopResultBuilder]: For program point L840-2(lines 840 849) no Hoare annotation was computed. [2022-07-13 13:04:32,102 INFO L899 garLoopResultBuilder]: For program point L1633(lines 1633 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,102 INFO L899 garLoopResultBuilder]: For program point L1369(lines 1369 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,103 INFO L899 garLoopResultBuilder]: For program point L181-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,103 INFO L899 garLoopResultBuilder]: For program point L49-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,103 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-13 13:04:32,103 INFO L899 garLoopResultBuilder]: For program point L182(line 182) no Hoare annotation was computed. [2022-07-13 13:04:32,104 INFO L899 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2022-07-13 13:04:32,104 INFO L899 garLoopResultBuilder]: For program point L579(lines 579 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,104 INFO L899 garLoopResultBuilder]: For program point L1504(lines 1504 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,104 INFO L899 garLoopResultBuilder]: For program point L1108(lines 1108 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,104 INFO L899 garLoopResultBuilder]: For program point L976(lines 976 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,104 INFO L899 garLoopResultBuilder]: For program point L316(lines 316 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,104 INFO L899 garLoopResultBuilder]: For program point L1241(lines 1241 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,104 INFO L899 garLoopResultBuilder]: For program point L184-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,105 INFO L899 garLoopResultBuilder]: For program point L1109(lines 1109 1117) no Hoare annotation was computed. [2022-07-13 13:04:32,105 INFO L899 garLoopResultBuilder]: For program point L52-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,105 INFO L899 garLoopResultBuilder]: For program point L1109-2(lines 1109 1117) no Hoare annotation was computed. [2022-07-13 13:04:32,105 INFO L902 garLoopResultBuilder]: At program point L1770(lines 1770 1786) the Hoare annotation is: true [2022-07-13 13:04:32,105 INFO L899 garLoopResultBuilder]: For program point L449(lines 449 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,105 INFO L899 garLoopResultBuilder]: For program point L317(lines 317 329) no Hoare annotation was computed. [2022-07-13 13:04:32,105 INFO L899 garLoopResultBuilder]: For program point L317-2(lines 317 329) no Hoare annotation was computed. [2022-07-13 13:04:32,106 INFO L899 garLoopResultBuilder]: For program point L185(line 185) no Hoare annotation was computed. [2022-07-13 13:04:32,106 INFO L899 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2022-07-13 13:04:32,106 INFO L899 garLoopResultBuilder]: For program point L1639(lines 1639 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,106 INFO L899 garLoopResultBuilder]: For program point L1375(lines 1375 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,106 INFO L899 garLoopResultBuilder]: For program point L187-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,106 INFO L899 garLoopResultBuilder]: For program point L55-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,106 INFO L899 garLoopResultBuilder]: For program point L584(lines 584 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,106 INFO L899 garLoopResultBuilder]: For program point L188(line 188) no Hoare annotation was computed. [2022-07-13 13:04:32,107 INFO L899 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2022-07-13 13:04:32,107 INFO L899 garLoopResultBuilder]: For program point L717(lines 717 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,107 INFO L899 garLoopResultBuilder]: For program point L585(lines 585 596) no Hoare annotation was computed. [2022-07-13 13:04:32,107 INFO L899 garLoopResultBuilder]: For program point L585-2(lines 585 596) no Hoare annotation was computed. [2022-07-13 13:04:32,107 INFO L899 garLoopResultBuilder]: For program point L850(lines 850 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,107 INFO L899 garLoopResultBuilder]: For program point L1511(lines 1511 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,107 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-13 13:04:32,107 INFO L899 garLoopResultBuilder]: For program point L1247(lines 1247 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,108 INFO L899 garLoopResultBuilder]: For program point L190-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,108 INFO L899 garLoopResultBuilder]: For program point L58-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,108 INFO L899 garLoopResultBuilder]: For program point L983(lines 983 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,108 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-13 13:04:32,108 INFO L899 garLoopResultBuilder]: For program point L455(lines 455 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,109 INFO L899 garLoopResultBuilder]: For program point L191(line 191) no Hoare annotation was computed. [2022-07-13 13:04:32,109 INFO L899 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2022-07-13 13:04:32,109 INFO L899 garLoopResultBuilder]: For program point L1645(lines 1645 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,109 INFO L899 garLoopResultBuilder]: For program point L1381(lines 1381 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,109 INFO L899 garLoopResultBuilder]: For program point L193-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,109 INFO L899 garLoopResultBuilder]: For program point L1118(lines 1118 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,109 INFO L899 garLoopResultBuilder]: For program point L61-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,109 INFO L899 garLoopResultBuilder]: For program point L722(lines 722 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,110 INFO L899 garLoopResultBuilder]: For program point L194(line 194) no Hoare annotation was computed. [2022-07-13 13:04:32,110 INFO L899 garLoopResultBuilder]: For program point L62(line 62) no Hoare annotation was computed. [2022-07-13 13:04:32,110 INFO L899 garLoopResultBuilder]: For program point L855(lines 855 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,110 INFO L899 garLoopResultBuilder]: For program point L459(lines 459 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,110 INFO L899 garLoopResultBuilder]: For program point L1781(line 1781) no Hoare annotation was computed. [2022-07-13 13:04:32,110 INFO L899 garLoopResultBuilder]: For program point L1253(lines 1253 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,110 INFO L899 garLoopResultBuilder]: For program point L196-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,110 INFO L899 garLoopResultBuilder]: For program point L64-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,111 INFO L899 garLoopResultBuilder]: For program point L989(lines 989 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,111 INFO L899 garLoopResultBuilder]: For program point L1650(lines 1650 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,111 INFO L899 garLoopResultBuilder]: For program point L1518(lines 1518 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,111 INFO L899 garLoopResultBuilder]: For program point L197(line 197) no Hoare annotation was computed. [2022-07-13 13:04:32,111 INFO L899 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2022-07-13 13:04:32,111 INFO L899 garLoopResultBuilder]: For program point L330(lines 330 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,111 INFO L899 garLoopResultBuilder]: For program point L1388(lines 1388 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,111 INFO L899 garLoopResultBuilder]: For program point L199-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,112 INFO L899 garLoopResultBuilder]: For program point L67-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,112 INFO L899 garLoopResultBuilder]: For program point L728(lines 728 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,112 INFO L899 garLoopResultBuilder]: For program point L1521(lines 1521 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,112 INFO L899 garLoopResultBuilder]: For program point L200(line 200) no Hoare annotation was computed. [2022-07-13 13:04:32,112 INFO L899 garLoopResultBuilder]: For program point L1125(lines 1125 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,112 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2022-07-13 13:04:32,112 INFO L899 garLoopResultBuilder]: For program point L861(lines 861 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,112 INFO L899 garLoopResultBuilder]: For program point L597(lines 597 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,113 INFO L899 garLoopResultBuilder]: For program point L466(lines 466 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,113 INFO L899 garLoopResultBuilder]: For program point L1259(lines 1259 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,113 INFO L899 garLoopResultBuilder]: For program point L202-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,113 INFO L899 garLoopResultBuilder]: For program point L70-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,113 INFO L899 garLoopResultBuilder]: For program point L995(lines 995 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,113 INFO L899 garLoopResultBuilder]: For program point L203(line 203) no Hoare annotation was computed. [2022-07-13 13:04:32,113 INFO L899 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2022-07-13 13:04:32,113 INFO L899 garLoopResultBuilder]: For program point L1657(lines 1657 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,114 INFO L899 garLoopResultBuilder]: For program point L865(lines 865 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,114 INFO L899 garLoopResultBuilder]: For program point L1526(lines 1526 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,114 INFO L899 garLoopResultBuilder]: For program point L337(lines 337 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,114 INFO L899 garLoopResultBuilder]: For program point L205-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,114 INFO L899 garLoopResultBuilder]: For program point L73-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,114 INFO L899 garLoopResultBuilder]: For program point L1395(lines 1395 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,114 INFO L899 garLoopResultBuilder]: For program point L206(line 206) no Hoare annotation was computed. [2022-07-13 13:04:32,114 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2022-07-13 13:04:32,115 INFO L899 garLoopResultBuilder]: For program point L735(lines 735 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,115 INFO L899 garLoopResultBuilder]: For program point L1132(lines 1132 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,115 INFO L899 garLoopResultBuilder]: For program point L604(lines 604 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,115 INFO L899 garLoopResultBuilder]: For program point L472(lines 472 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,115 INFO L899 garLoopResultBuilder]: For program point L1265(lines 1265 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,115 INFO L899 garLoopResultBuilder]: For program point L208-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,115 INFO L899 garLoopResultBuilder]: For program point L76-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,115 INFO L899 garLoopResultBuilder]: For program point L605(lines 605 615) no Hoare annotation was computed. [2022-07-13 13:04:32,116 INFO L899 garLoopResultBuilder]: For program point L605-2(lines 605 615) no Hoare annotation was computed. [2022-07-13 13:04:32,116 INFO L899 garLoopResultBuilder]: For program point L1398(lines 1398 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,116 INFO L899 garLoopResultBuilder]: For program point L209(line 209) no Hoare annotation was computed. [2022-07-13 13:04:32,116 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2022-07-13 13:04:32,116 INFO L899 garLoopResultBuilder]: For program point L1002(lines 1002 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,116 INFO L899 garLoopResultBuilder]: For program point L1532(lines 1532 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,116 INFO L899 garLoopResultBuilder]: For program point L343(lines 343 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,116 INFO L899 garLoopResultBuilder]: For program point L211-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,116 INFO L899 garLoopResultBuilder]: For program point L79-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,116 INFO L899 garLoopResultBuilder]: For program point L872(lines 872 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,117 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-13 13:04:32,117 INFO L899 garLoopResultBuilder]: For program point L212(line 212) no Hoare annotation was computed. [2022-07-13 13:04:32,117 INFO L899 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2022-07-13 13:04:32,117 INFO L899 garLoopResultBuilder]: For program point L1138(lines 1138 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,117 INFO L899 garLoopResultBuilder]: For program point L742(lines 742 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,117 INFO L899 garLoopResultBuilder]: For program point L478(lines 478 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,117 INFO L899 garLoopResultBuilder]: For program point L346(lines 346 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,117 INFO L899 garLoopResultBuilder]: For program point L1271(lines 1271 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,118 INFO L899 garLoopResultBuilder]: For program point L214-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,118 INFO L899 garLoopResultBuilder]: For program point L82-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,118 INFO L899 garLoopResultBuilder]: For program point L1404(lines 1404 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,118 INFO L899 garLoopResultBuilder]: For program point L215(line 215) no Hoare annotation was computed. [2022-07-13 13:04:32,118 INFO L899 garLoopResultBuilder]: For program point L83(line 83) no Hoare annotation was computed. [2022-07-13 13:04:32,118 INFO L899 garLoopResultBuilder]: For program point L1008(lines 1008 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,118 INFO L899 garLoopResultBuilder]: For program point L1405(lines 1405 1417) no Hoare annotation was computed. [2022-07-13 13:04:32,118 INFO L899 garLoopResultBuilder]: For program point L1405-2(lines 1405 1417) no Hoare annotation was computed. [2022-07-13 13:04:32,119 INFO L899 garLoopResultBuilder]: For program point L745(lines 745 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,119 INFO L899 garLoopResultBuilder]: For program point L1538(lines 1538 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,119 INFO L899 garLoopResultBuilder]: For program point L1274(lines 1274 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,119 INFO L899 garLoopResultBuilder]: For program point L85-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,119 INFO L899 garLoopResultBuilder]: For program point L878(lines 878 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,119 INFO L899 garLoopResultBuilder]: For program point L1671(lines 1671 1766) no Hoare annotation was computed. [2022-07-13 13:04:32,119 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-13 13:04:32,119 INFO L899 garLoopResultBuilder]: For program point L86(line 86) no Hoare annotation was computed. [2022-07-13 13:04:32,120 INFO L899 garLoopResultBuilder]: For program point L351(lines 351 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,120 INFO L899 garLoopResultBuilder]: For program point L1144(lines 1144 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,120 INFO L899 garLoopResultBuilder]: For program point L616(lines 616 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,120 INFO L899 garLoopResultBuilder]: For program point L484(lines 484 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,120 INFO L899 garLoopResultBuilder]: For program point L352(lines 352 359) no Hoare annotation was computed. [2022-07-13 13:04:32,120 INFO L899 garLoopResultBuilder]: For program point L352-2(lines 352 359) no Hoare annotation was computed. [2022-07-13 13:04:32,120 INFO L899 garLoopResultBuilder]: For program point L1145(lines 1145 1154) no Hoare annotation was computed. [2022-07-13 13:04:32,120 INFO L899 garLoopResultBuilder]: For program point L88-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,121 INFO L899 garLoopResultBuilder]: For program point L1145-2(lines 1145 1154) no Hoare annotation was computed. [2022-07-13 13:04:32,121 INFO L899 garLoopResultBuilder]: For program point L89(line 89) no Hoare annotation was computed. [2022-07-13 13:04:32,121 INFO L899 garLoopResultBuilder]: For program point L1014(lines 1014 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,121 INFO L899 garLoopResultBuilder]: For program point L1543(lines 1543 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,121 INFO L899 garLoopResultBuilder]: For program point L91-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,121 INFO L899 garLoopResultBuilder]: For program point L884(lines 884 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,121 INFO L899 garLoopResultBuilder]: For program point L752(lines 752 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,121 INFO L899 garLoopResultBuilder]: For program point L1281(lines 1281 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,122 INFO L899 garLoopResultBuilder]: For program point L224(lines 224 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,122 INFO L899 garLoopResultBuilder]: For program point L92(line 92) no Hoare annotation was computed. [2022-07-13 13:04:32,122 INFO L899 garLoopResultBuilder]: For program point L1678(lines 1678 1766) no Hoare annotation was computed. [2022-07-13 13:04:32,122 INFO L899 garLoopResultBuilder]: For program point L489(lines 489 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,122 INFO L899 garLoopResultBuilder]: For program point L94-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,122 INFO L899 garLoopResultBuilder]: For program point L623(lines 623 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,122 INFO L899 garLoopResultBuilder]: For program point L95(line 95) no Hoare annotation was computed. [2022-07-13 13:04:32,122 INFO L899 garLoopResultBuilder]: For program point L360(lines 360 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,123 INFO L899 garLoopResultBuilder]: For program point L1021(lines 1021 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,123 INFO L899 garLoopResultBuilder]: For program point L1682(lines 1682 1766) no Hoare annotation was computed. [2022-07-13 13:04:32,123 INFO L899 garLoopResultBuilder]: For program point L1550(lines 1550 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,123 INFO L899 garLoopResultBuilder]: For program point L1418(lines 1418 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,123 INFO L899 garLoopResultBuilder]: For program point L229(lines 229 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,123 INFO L899 garLoopResultBuilder]: For program point L97-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,123 INFO L899 garLoopResultBuilder]: For program point L890(lines 890 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,123 INFO L899 garLoopResultBuilder]: For program point L758(lines 758 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,123 INFO L899 garLoopResultBuilder]: For program point L1287(lines 1287 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,123 INFO L899 garLoopResultBuilder]: For program point L230(lines 230 238) no Hoare annotation was computed. [2022-07-13 13:04:32,123 INFO L899 garLoopResultBuilder]: For program point L230-2(lines 230 238) no Hoare annotation was computed. [2022-07-13 13:04:32,123 INFO L899 garLoopResultBuilder]: For program point L1155(lines 1155 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,123 INFO L899 garLoopResultBuilder]: For program point L98(line 98) no Hoare annotation was computed. [2022-07-13 13:04:32,123 INFO L899 garLoopResultBuilder]: For program point L496(lines 496 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,124 INFO L899 garLoopResultBuilder]: For program point L100-1(lines 33 1666) no Hoare annotation was computed. [2022-07-13 13:04:32,124 INFO L899 garLoopResultBuilder]: For program point L365(lines 365 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,124 INFO L899 garLoopResultBuilder]: For program point L101(line 101) no Hoare annotation was computed. [2022-07-13 13:04:32,124 INFO L899 garLoopResultBuilder]: For program point L1026(lines 1026 1664) no Hoare annotation was computed. [2022-07-13 13:04:32,126 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-13 13:04:32,128 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 13:04:32,150 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,152 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,152 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,152 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,153 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,168 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,171 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,171 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,171 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,171 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,174 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,177 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,179 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,182 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,182 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,184 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,184 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,187 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,187 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,187 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,189 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,189 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,189 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,190 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,195 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,197 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,197 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,197 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,197 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,198 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 01:04:32 BoogieIcfgContainer [2022-07-13 13:04:32,199 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 13:04:32,200 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 13:04:32,200 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 13:04:32,200 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 13:04:32,201 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 01:02:00" (3/4) ... [2022-07-13 13:04:32,203 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-13 13:04:32,232 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-07-13 13:04:32,234 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-13 13:04:32,236 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-13 13:04:32,238 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-13 13:04:32,261 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-13 13:04:32,266 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-13 13:04:32,277 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-13 13:04:32,378 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 13:04:32,378 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 13:04:32,379 INFO L158 Benchmark]: Toolchain (without parser) took 155167.65ms. Allocated memory was 96.5MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 56.0MB in the beginning and 970.7MB in the end (delta: -914.7MB). Peak memory consumption was 458.7MB. Max. memory is 16.1GB. [2022-07-13 13:04:32,380 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 96.5MB. Free memory was 76.0MB in the beginning and 75.9MB in the end (delta: 41.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 13:04:32,380 INFO L158 Benchmark]: CACSL2BoogieTranslator took 830.20ms. Allocated memory is still 96.5MB. Free memory was 55.8MB in the beginning and 43.8MB in the end (delta: 11.9MB). Peak memory consumption was 33.5MB. Max. memory is 16.1GB. [2022-07-13 13:04:32,382 INFO L158 Benchmark]: Boogie Procedure Inliner took 210.30ms. Allocated memory was 96.5MB in the beginning and 119.5MB in the end (delta: 23.1MB). Free memory was 43.8MB in the beginning and 54.0MB in the end (delta: -10.2MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2022-07-13 13:04:32,382 INFO L158 Benchmark]: Boogie Preprocessor took 189.47ms. Allocated memory is still 119.5MB. Free memory was 54.0MB in the beginning and 54.5MB in the end (delta: -505.7kB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. [2022-07-13 13:04:32,382 INFO L158 Benchmark]: RCFGBuilder took 2418.96ms. Allocated memory was 119.5MB in the beginning and 230.7MB in the end (delta: 111.1MB). Free memory was 54.5MB in the beginning and 122.2MB in the end (delta: -67.7MB). Peak memory consumption was 79.8MB. Max. memory is 16.1GB. [2022-07-13 13:04:32,387 INFO L158 Benchmark]: TraceAbstraction took 151331.85ms. Allocated memory was 230.7MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 121.2MB in the beginning and 995.3MB in the end (delta: -874.0MB). Peak memory consumption was 978.2MB. Max. memory is 16.1GB. [2022-07-13 13:04:32,387 INFO L158 Benchmark]: Witness Printer took 178.79ms. Allocated memory is still 1.5GB. Free memory was 994.2MB in the beginning and 970.7MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-07-13 13:04:32,390 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.20ms. Allocated memory is still 96.5MB. Free memory was 76.0MB in the beginning and 75.9MB in the end (delta: 41.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 830.20ms. Allocated memory is still 96.5MB. Free memory was 55.8MB in the beginning and 43.8MB in the end (delta: 11.9MB). Peak memory consumption was 33.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 210.30ms. Allocated memory was 96.5MB in the beginning and 119.5MB in the end (delta: 23.1MB). Free memory was 43.8MB in the beginning and 54.0MB in the end (delta: -10.2MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 189.47ms. Allocated memory is still 119.5MB. Free memory was 54.0MB in the beginning and 54.5MB in the end (delta: -505.7kB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. * RCFGBuilder took 2418.96ms. Allocated memory was 119.5MB in the beginning and 230.7MB in the end (delta: 111.1MB). Free memory was 54.5MB in the beginning and 122.2MB in the end (delta: -67.7MB). Peak memory consumption was 79.8MB. Max. memory is 16.1GB. * TraceAbstraction took 151331.85ms. Allocated memory was 230.7MB in the beginning and 1.5GB in the end (delta: 1.2GB). Free memory was 121.2MB in the beginning and 995.3MB in the end (delta: -874.0MB). Peak memory consumption was 978.2MB. Max. memory is 16.1GB. * Witness Printer took 178.79ms. Allocated memory is still 1.5GB. Free memory was 994.2MB in the beginning and 970.7MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. 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: 151.2s, OverallIterations: 29, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 56.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 74.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 25207 SdHoareTripleChecker+Valid, 50.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25207 mSDsluCounter, 11117 SdHoareTripleChecker+Invalid, 42.0s 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.2s AutomataMinimizationTime, 29 MinimizatonAttempts, 40076 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 204 NumberOfFragments, 2540 HoareAnnotationTreeSize, 4 FomulaSimplifications, 736998 FormulaSimplificationTreeSizeReduction, 62.7s HoareSimplificationTime, 4 FomulaSimplificationsInter, 1137411 FormulaSimplificationTreeSizeReductionInter, 12.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 9.3s 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-13 13:04:32,404 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,404 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,404 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,404 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,404 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,406 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,406 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,406 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,406 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,406 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-13 13:04:32,408 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,408 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,408 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,408 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,409 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,410 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,411 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,411 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,411 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,411 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-13 13:04:32,413 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,413 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,413 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,413 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,413 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,415 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,415 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,415 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,415 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_899,QUANTIFIED] [2022-07-13 13:04:32,415 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-13 13:04:32,432 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