./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.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/loop-lit/gj2007.c.i.p+nlh-reducer.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 78a4cc43ce1234c075e2c73cca2f6f44edddfccbee7278c746f2db07d17136bf --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 15:38:38,128 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 15:38:38,130 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 15:38:38,155 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 15:38:38,156 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 15:38:38,157 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 15:38:38,158 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 15:38:38,160 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 15:38:38,161 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 15:38:38,162 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 15:38:38,163 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 15:38:38,164 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 15:38:38,165 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 15:38:38,166 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 15:38:38,167 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 15:38:38,168 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 15:38:38,169 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 15:38:38,170 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 15:38:38,171 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 15:38:38,173 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 15:38:38,174 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 15:38:38,175 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 15:38:38,176 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 15:38:38,177 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 15:38:38,178 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 15:38:38,181 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 15:38:38,181 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 15:38:38,181 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 15:38:38,182 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 15:38:38,183 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 15:38:38,183 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 15:38:38,184 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 15:38:38,184 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 15:38:38,185 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 15:38:38,186 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 15:38:38,187 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 15:38:38,187 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 15:38:38,188 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 15:38:38,188 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 15:38:38,188 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 15:38:38,189 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 15:38:38,193 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 15:38:38,195 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 15:38:38,213 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 15:38:38,213 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 15:38:38,213 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 15:38:38,214 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 15:38:38,214 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 15:38:38,214 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 15:38:38,215 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 15:38:38,215 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 15:38:38,215 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 15:38:38,216 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 15:38:38,216 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 15:38:38,216 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 15:38:38,216 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 15:38:38,216 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 15:38:38,217 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 15:38:38,217 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 15:38:38,217 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 15:38:38,217 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 15:38:38,218 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 15:38:38,218 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 15:38:38,219 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 15:38:38,219 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 15:38:38,219 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 15:38:38,219 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 15:38:38,219 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:38:38,220 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 15:38:38,220 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 15:38:38,220 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 15:38:38,226 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 15:38:38,226 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 15:38:38,226 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 15:38:38,227 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 15:38:38,227 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 15:38:38,227 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 -> 78a4cc43ce1234c075e2c73cca2f6f44edddfccbee7278c746f2db07d17136bf [2022-07-13 15:38:38,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 15:38:38,481 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 15:38:38,483 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 15:38:38,484 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 15:38:38,484 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 15:38:38,485 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c [2022-07-13 15:38:38,532 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e60307af/edc9d5114fe54132a9ec041108ba3329/FLAGf087a8aa0 [2022-07-13 15:38:38,963 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 15:38:38,963 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/gj2007.c.i.p+nlh-reducer.c [2022-07-13 15:38:38,973 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e60307af/edc9d5114fe54132a9ec041108ba3329/FLAGf087a8aa0 [2022-07-13 15:38:39,349 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e60307af/edc9d5114fe54132a9ec041108ba3329 [2022-07-13 15:38:39,351 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 15:38:39,353 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 15:38:39,355 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 15:38:39,355 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 15:38:39,358 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 15:38:39,359 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:38:39" (1/1) ... [2022-07-13 15:38:39,359 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dd0180b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:38:39, skipping insertion in model container [2022-07-13 15:38:39,360 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:38:39" (1/1) ... [2022-07-13 15:38:39,365 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 15:38:39,420 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 15:38:39,646 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/loop-lit/gj2007.c.i.p+nlh-reducer.c[6448,6461] [2022-07-13 15:38:39,727 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:38:39,734 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 15:38:39,796 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/loop-lit/gj2007.c.i.p+nlh-reducer.c[6448,6461] [2022-07-13 15:38:39,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 15:38:39,855 INFO L208 MainTranslator]: Completed translation [2022-07-13 15:38:39,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:38:39 WrapperNode [2022-07-13 15:38:39,856 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 15:38:39,857 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 15:38:39,857 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 15:38:39,857 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 15:38:39,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:38:39" (1/1) ... [2022-07-13 15:38:39,880 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:38:39" (1/1) ... [2022-07-13 15:38:39,919 INFO L137 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 637 [2022-07-13 15:38:39,922 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 15:38:39,923 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 15:38:39,923 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 15:38:39,923 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 15:38:39,930 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:38:39" (1/1) ... [2022-07-13 15:38:39,930 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:38:39" (1/1) ... [2022-07-13 15:38:39,942 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:38:39" (1/1) ... [2022-07-13 15:38:39,943 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:38:39" (1/1) ... [2022-07-13 15:38:39,951 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:38:39" (1/1) ... [2022-07-13 15:38:39,964 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:38:39" (1/1) ... [2022-07-13 15:38:39,976 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:38:39" (1/1) ... [2022-07-13 15:38:39,979 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 15:38:39,980 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 15:38:39,980 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 15:38:39,980 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 15:38:39,981 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:38:39" (1/1) ... [2022-07-13 15:38:39,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 15:38:40,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:38:40,016 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 15:38:40,041 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 15:38:40,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 15:38:40,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 15:38:40,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 15:38:40,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 15:38:40,106 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 15:38:40,107 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 15:38:40,668 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 15:38:40,675 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 15:38:40,682 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-13 15:38:40,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:38:40 BoogieIcfgContainer [2022-07-13 15:38:40,684 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 15:38:40,685 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 15:38:40,685 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 15:38:40,688 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 15:38:40,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 03:38:39" (1/3) ... [2022-07-13 15:38:40,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f1cc27e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:38:40, skipping insertion in model container [2022-07-13 15:38:40,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:38:39" (2/3) ... [2022-07-13 15:38:40,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f1cc27e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 03:38:40, skipping insertion in model container [2022-07-13 15:38:40,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:38:40" (3/3) ... [2022-07-13 15:38:40,691 INFO L111 eAbstractionObserver]: Analyzing ICFG gj2007.c.i.p+nlh-reducer.c [2022-07-13 15:38:40,702 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 15:38:40,702 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 15:38:40,744 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 15:38:40,750 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@37f32307, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7f8c9e4c [2022-07-13 15:38:40,750 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 15:38:40,755 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 142 states have (on average 1.971830985915493) internal successors, (280), 143 states have internal predecessors, (280), 0 states have call successors, (0), 0 states 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 15:38:40,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-13 15:38:40,767 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:38:40,767 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:38:40,768 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:38:40,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:38:40,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1067704148, now seen corresponding path program 1 times [2022-07-13 15:38:40,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:38:40,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272335418] [2022-07-13 15:38:40,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:38:40,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:38:40,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:38:41,015 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 15:38:41,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:38:41,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272335418] [2022-07-13 15:38:41,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272335418] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:38:41,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:38:41,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:38:41,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792221921] [2022-07-13 15:38:41,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:38:41,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:38:41,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:38:41,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:38:41,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:38:41,057 INFO L87 Difference]: Start difference. First operand has 144 states, 142 states have (on average 1.971830985915493) internal successors, (280), 143 states have internal predecessors, (280), 0 states have call successors, (0), 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 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 15:38:41,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:38:41,410 INFO L93 Difference]: Finished difference Result 284 states and 554 transitions. [2022-07-13 15:38:41,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:38:41,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2022-07-13 15:38:41,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:38:41,426 INFO L225 Difference]: With dead ends: 284 [2022-07-13 15:38:41,427 INFO L226 Difference]: Without dead ends: 141 [2022-07-13 15:38:41,429 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 15:38:41,432 INFO L413 NwaCegarLoop]: 275 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 15:38:41,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 281 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 15:38:41,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-07-13 15:38:41,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2022-07-13 15:38:41,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.4857142857142858) internal successors, (208), 140 states have internal predecessors, (208), 0 states have call successors, (0), 0 states 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 15:38:41,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 208 transitions. [2022-07-13 15:38:41,468 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 208 transitions. Word has length 139 [2022-07-13 15:38:41,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:38:41,468 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 208 transitions. [2022-07-13 15:38:41,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 15:38:41,468 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2022-07-13 15:38:41,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-13 15:38:41,472 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:38:41,472 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:38:41,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 15:38:41,473 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:38:41,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:38:41,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1752580255, now seen corresponding path program 1 times [2022-07-13 15:38:41,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:38:41,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520663577] [2022-07-13 15:38:41,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:38:41,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:38:41,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:38:41,534 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 15:38:41,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:38:41,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520663577] [2022-07-13 15:38:41,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520663577] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:38:41,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:38:41,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 15:38:41,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059685397] [2022-07-13 15:38:41,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:38:41,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 15:38:41,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:38:41,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 15:38:41,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 15:38:41,537 INFO L87 Difference]: Start difference. First operand 141 states and 208 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 15:38:41,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:38:41,970 INFO L93 Difference]: Finished difference Result 406 states and 605 transitions. [2022-07-13 15:38:41,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 15:38:41,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2022-07-13 15:38:41,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:38:41,973 INFO L225 Difference]: With dead ends: 406 [2022-07-13 15:38:41,973 INFO L226 Difference]: Without dead ends: 273 [2022-07-13 15:38:41,974 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 15:38:41,975 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 68 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 15:38:41,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 80 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 15:38:41,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-07-13 15:38:41,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2022-07-13 15:38:41,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 272 states have (on average 1.2536764705882353) internal successors, (341), 272 states have internal predecessors, (341), 0 states have call successors, (0), 0 states 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 15:38:41,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 341 transitions. [2022-07-13 15:38:41,993 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 341 transitions. Word has length 139 [2022-07-13 15:38:41,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:38:41,993 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 341 transitions. [2022-07-13 15:38:41,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 15:38:41,994 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 341 transitions. [2022-07-13 15:38:41,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-13 15:38:41,996 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:38:41,996 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:38:41,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 15:38:41,996 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:38:41,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:38:41,997 INFO L85 PathProgramCache]: Analyzing trace with hash 2041942551, now seen corresponding path program 1 times [2022-07-13 15:38:41,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:38:41,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28332713] [2022-07-13 15:38:41,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:38:41,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:38:42,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:38:42,124 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 15:38:42,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:38:42,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28332713] [2022-07-13 15:38:42,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28332713] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:38:42,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:38:42,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 15:38:42,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165038963] [2022-07-13 15:38:42,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:38:42,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 15:38:42,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:38:42,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 15:38:42,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:38:42,127 INFO L87 Difference]: Start difference. First operand 273 states and 341 transitions. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 15:38:42,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:38:42,409 INFO L93 Difference]: Finished difference Result 402 states and 470 transitions. [2022-07-13 15:38:42,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 15:38:42,409 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2022-07-13 15:38:42,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:38:42,411 INFO L225 Difference]: With dead ends: 402 [2022-07-13 15:38:42,411 INFO L226 Difference]: Without dead ends: 267 [2022-07-13 15:38:42,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-13 15:38:42,420 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 5 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 15:38:42,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 203 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 15:38:42,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-07-13 15:38:42,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2022-07-13 15:38:42,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 266 states have (on average 1.2481203007518797) internal successors, (332), 266 states have internal predecessors, (332), 0 states have call successors, (0), 0 states 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 15:38:42,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 332 transitions. [2022-07-13 15:38:42,441 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 332 transitions. Word has length 139 [2022-07-13 15:38:42,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:38:42,442 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 332 transitions. [2022-07-13 15:38:42,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 15:38:42,442 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 332 transitions. [2022-07-13 15:38:42,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-13 15:38:42,444 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:38:42,445 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:38:42,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 15:38:42,445 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:38:42,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:38:42,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1527946145, now seen corresponding path program 1 times [2022-07-13 15:38:42,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:38:42,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726204708] [2022-07-13 15:38:42,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:38:42,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:38:42,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:38:42,547 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 15:38:42,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:38:42,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726204708] [2022-07-13 15:38:42,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726204708] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:38:42,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:38:42,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 15:38:42,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380711532] [2022-07-13 15:38:42,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:38:42,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 15:38:42,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:38:42,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 15:38:42,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-13 15:38:42,549 INFO L87 Difference]: Start difference. First operand 267 states and 332 transitions. Second operand has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 15:38:42,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:38:42,799 INFO L93 Difference]: Finished difference Result 394 states and 459 transitions. [2022-07-13 15:38:42,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 15:38:42,799 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2022-07-13 15:38:42,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:38:42,801 INFO L225 Difference]: With dead ends: 394 [2022-07-13 15:38:42,801 INFO L226 Difference]: Without dead ends: 265 [2022-07-13 15:38:42,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-13 15:38:42,802 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 6 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:38:42,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 200 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 15:38:42,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-07-13 15:38:42,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2022-07-13 15:38:42,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 1.246212121212121) internal successors, (329), 264 states have internal predecessors, (329), 0 states have call successors, (0), 0 states 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 15:38:42,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 329 transitions. [2022-07-13 15:38:42,813 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 329 transitions. Word has length 139 [2022-07-13 15:38:42,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:38:42,814 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 329 transitions. [2022-07-13 15:38:42,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 15:38:42,814 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 329 transitions. [2022-07-13 15:38:42,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-13 15:38:42,816 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:38:42,816 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:38:42,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 15:38:42,816 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:38:42,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:38:42,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1089183555, now seen corresponding path program 1 times [2022-07-13 15:38:42,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:38:42,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288687724] [2022-07-13 15:38:42,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:38:42,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:38:42,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:38:42,949 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 15:38:42,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:38:42,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288687724] [2022-07-13 15:38:42,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288687724] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:38:42,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:38:42,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 15:38:42,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602875029] [2022-07-13 15:38:42,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:38:42,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 15:38:42,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:38:42,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 15:38:42,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2022-07-13 15:38:42,952 INFO L87 Difference]: Start difference. First operand 265 states and 329 transitions. Second operand has 10 states, 10 states have (on average 13.9) internal successors, (139), 10 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 15:38:43,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:38:43,258 INFO L93 Difference]: Finished difference Result 386 states and 450 transitions. [2022-07-13 15:38:43,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 15:38:43,258 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.9) internal successors, (139), 10 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2022-07-13 15:38:43,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:38:43,260 INFO L225 Difference]: With dead ends: 386 [2022-07-13 15:38:43,260 INFO L226 Difference]: Without dead ends: 259 [2022-07-13 15:38:43,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2022-07-13 15:38:43,261 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 12 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 15:38:43,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 194 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 15:38:43,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-07-13 15:38:43,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2022-07-13 15:38:43,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 258 states have (on average 1.2403100775193798) internal successors, (320), 258 states have internal predecessors, (320), 0 states have call successors, (0), 0 states 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 15:38:43,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 320 transitions. [2022-07-13 15:38:43,270 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 320 transitions. Word has length 139 [2022-07-13 15:38:43,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:38:43,270 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 320 transitions. [2022-07-13 15:38:43,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.9) internal successors, (139), 10 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 15:38:43,270 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 320 transitions. [2022-07-13 15:38:43,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-13 15:38:43,272 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:38:43,272 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:38:43,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 15:38:43,273 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:38:43,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:38:43,273 INFO L85 PathProgramCache]: Analyzing trace with hash -41763050, now seen corresponding path program 1 times [2022-07-13 15:38:43,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:38:43,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745345289] [2022-07-13 15:38:43,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:38:43,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:38:43,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:38:43,392 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 15:38:43,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:38:43,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745345289] [2022-07-13 15:38:43,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745345289] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:38:43,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:38:43,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-13 15:38:43,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556576052] [2022-07-13 15:38:43,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:38:43,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-13 15:38:43,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:38:43,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 15:38:43,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-07-13 15:38:43,395 INFO L87 Difference]: Start difference. First operand 259 states and 320 transitions. Second operand has 13 states, 13 states have (on average 10.692307692307692) internal successors, (139), 13 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 15:38:43,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:38:43,752 INFO L93 Difference]: Finished difference Result 374 states and 435 transitions. [2022-07-13 15:38:43,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 15:38:43,753 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 10.692307692307692) internal successors, (139), 13 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2022-07-13 15:38:43,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:38:43,754 INFO L225 Difference]: With dead ends: 374 [2022-07-13 15:38:43,754 INFO L226 Difference]: Without dead ends: 253 [2022-07-13 15:38:43,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-07-13 15:38:43,755 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 18 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 15:38:43,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 188 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 15:38:43,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-07-13 15:38:43,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2022-07-13 15:38:43,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 252 states have (on average 1.2341269841269842) internal successors, (311), 252 states have internal predecessors, (311), 0 states have call successors, (0), 0 states 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 15:38:43,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 311 transitions. [2022-07-13 15:38:43,762 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 311 transitions. Word has length 139 [2022-07-13 15:38:43,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:38:43,762 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 311 transitions. [2022-07-13 15:38:43,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.692307692307692) internal successors, (139), 13 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 15:38:43,771 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 311 transitions. [2022-07-13 15:38:43,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-13 15:38:43,772 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:38:43,772 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:38:43,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 15:38:43,773 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:38:43,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:38:43,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1153200357, now seen corresponding path program 1 times [2022-07-13 15:38:43,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:38:43,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451371352] [2022-07-13 15:38:43,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:38:43,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:38:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:38:43,904 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 15:38:43,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:38:43,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451371352] [2022-07-13 15:38:43,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451371352] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:38:43,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:38:43,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-13 15:38:43,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994562823] [2022-07-13 15:38:43,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:38:43,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-13 15:38:43,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:38:43,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-13 15:38:43,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2022-07-13 15:38:43,907 INFO L87 Difference]: Start difference. First operand 253 states and 311 transitions. Second operand has 15 states, 15 states have (on average 9.266666666666667) internal successors, (139), 15 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 15:38:44,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:38:44,082 INFO L93 Difference]: Finished difference Result 364 states and 422 transitions. [2022-07-13 15:38:44,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 15:38:44,083 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 9.266666666666667) internal successors, (139), 15 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2022-07-13 15:38:44,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:38:44,084 INFO L225 Difference]: With dead ends: 364 [2022-07-13 15:38:44,084 INFO L226 Difference]: Without dead ends: 249 [2022-07-13 15:38:44,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2022-07-13 15:38:44,086 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 31 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:38:44,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 173 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 15:38:44,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-07-13 15:38:44,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2022-07-13 15:38:44,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 248 states have (on average 1.2298387096774193) internal successors, (305), 248 states have internal predecessors, (305), 0 states have call successors, (0), 0 states 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 15:38:44,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 305 transitions. [2022-07-13 15:38:44,096 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 305 transitions. Word has length 139 [2022-07-13 15:38:44,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:38:44,097 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 305 transitions. [2022-07-13 15:38:44,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.266666666666667) internal successors, (139), 15 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 15:38:44,098 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 305 transitions. [2022-07-13 15:38:44,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-13 15:38:44,099 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:38:44,099 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:38:44,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 15:38:44,100 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:38:44,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:38:44,100 INFO L85 PathProgramCache]: Analyzing trace with hash -717830785, now seen corresponding path program 1 times [2022-07-13 15:38:44,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:38:44,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411204842] [2022-07-13 15:38:44,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:38:44,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:38:44,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:38:44,317 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 15:38:44,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:38:44,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411204842] [2022-07-13 15:38:44,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411204842] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:38:44,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:38:44,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-07-13 15:38:44,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346042278] [2022-07-13 15:38:44,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:38:44,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 15:38:44,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:38:44,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 15:38:44,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2022-07-13 15:38:44,320 INFO L87 Difference]: Start difference. First operand 249 states and 305 transitions. Second operand has 19 states, 19 states have (on average 7.315789473684211) internal successors, (139), 19 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 15:38:44,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:38:44,582 INFO L93 Difference]: Finished difference Result 352 states and 408 transitions. [2022-07-13 15:38:44,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-13 15:38:44,583 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.315789473684211) internal successors, (139), 19 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2022-07-13 15:38:44,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:38:44,584 INFO L225 Difference]: With dead ends: 352 [2022-07-13 15:38:44,584 INFO L226 Difference]: Without dead ends: 241 [2022-07-13 15:38:44,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2022-07-13 15:38:44,585 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 50 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 15:38:44,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 164 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 15:38:44,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-07-13 15:38:44,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2022-07-13 15:38:44,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 240 states have (on average 1.2208333333333334) internal successors, (293), 240 states have internal predecessors, (293), 0 states have call successors, (0), 0 states 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 15:38:44,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 293 transitions. [2022-07-13 15:38:44,593 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 293 transitions. Word has length 139 [2022-07-13 15:38:44,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:38:44,593 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 293 transitions. [2022-07-13 15:38:44,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.315789473684211) internal successors, (139), 19 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 15:38:44,594 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 293 transitions. [2022-07-13 15:38:44,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-13 15:38:44,595 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:38:44,595 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:38:44,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 15:38:44,596 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:38:44,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:38:44,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1738769551, now seen corresponding path program 1 times [2022-07-13 15:38:44,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:38:44,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363546025] [2022-07-13 15:38:44,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:38:44,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:38:44,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:38:44,842 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 15:38:44,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:38:44,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363546025] [2022-07-13 15:38:44,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363546025] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:38:44,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:38:44,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-07-13 15:38:44,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722291332] [2022-07-13 15:38:44,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:38:44,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-13 15:38:44,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:38:44,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-13 15:38:44,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2022-07-13 15:38:44,844 INFO L87 Difference]: Start difference. First operand 241 states and 293 transitions. Second operand has 22 states, 22 states have (on average 6.318181818181818) internal successors, (139), 22 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 15:38:45,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:38:45,147 INFO L93 Difference]: Finished difference Result 338 states and 390 transitions. [2022-07-13 15:38:45,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-13 15:38:45,148 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.318181818181818) internal successors, (139), 22 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2022-07-13 15:38:45,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:38:45,149 INFO L225 Difference]: With dead ends: 338 [2022-07-13 15:38:45,149 INFO L226 Difference]: Without dead ends: 235 [2022-07-13 15:38:45,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2022-07-13 15:38:45,150 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 50 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 15:38:45,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 158 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 15:38:45,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-07-13 15:38:45,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2022-07-13 15:38:45,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 234 states have (on average 1.2136752136752136) internal successors, (284), 234 states have internal predecessors, (284), 0 states have call successors, (0), 0 states 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 15:38:45,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 284 transitions. [2022-07-13 15:38:45,157 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 284 transitions. Word has length 139 [2022-07-13 15:38:45,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:38:45,158 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 284 transitions. [2022-07-13 15:38:45,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.318181818181818) internal successors, (139), 22 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 15:38:45,158 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 284 transitions. [2022-07-13 15:38:45,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-13 15:38:45,159 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:38:45,159 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:38:45,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 15:38:45,160 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:38:45,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:38:45,160 INFO L85 PathProgramCache]: Analyzing trace with hash -834827415, now seen corresponding path program 1 times [2022-07-13 15:38:45,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:38:45,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066996803] [2022-07-13 15:38:45,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:38:45,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:38:45,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:38:45,421 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 15:38:45,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:38:45,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066996803] [2022-07-13 15:38:45,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066996803] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:38:45,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:38:45,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-07-13 15:38:45,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650786649] [2022-07-13 15:38:45,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:38:45,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-13 15:38:45,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:38:45,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-13 15:38:45,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2022-07-13 15:38:45,424 INFO L87 Difference]: Start difference. First operand 235 states and 284 transitions. Second operand has 23 states, 23 states have (on average 6.043478260869565) internal successors, (139), 23 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 15:38:45,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:38:45,776 INFO L93 Difference]: Finished difference Result 330 states and 379 transitions. [2022-07-13 15:38:45,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-13 15:38:45,777 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 6.043478260869565) internal successors, (139), 23 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2022-07-13 15:38:45,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:38:45,778 INFO L225 Difference]: With dead ends: 330 [2022-07-13 15:38:45,778 INFO L226 Difference]: Without dead ends: 233 [2022-07-13 15:38:45,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2022-07-13 15:38:45,779 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 57 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 15:38:45,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 158 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 15:38:45,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-07-13 15:38:45,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2022-07-13 15:38:45,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 232 states have (on average 1.2112068965517242) internal successors, (281), 232 states have internal predecessors, (281), 0 states have call successors, (0), 0 states 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 15:38:45,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 281 transitions. [2022-07-13 15:38:45,786 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 281 transitions. Word has length 139 [2022-07-13 15:38:45,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:38:45,786 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 281 transitions. [2022-07-13 15:38:45,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.043478260869565) internal successors, (139), 23 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 15:38:45,786 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 281 transitions. [2022-07-13 15:38:45,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-13 15:38:45,787 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:38:45,788 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:38:45,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 15:38:45,788 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:38:45,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:38:45,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1868941195, now seen corresponding path program 1 times [2022-07-13 15:38:45,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:38:45,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148592967] [2022-07-13 15:38:45,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:38:45,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:38:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:38:46,083 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 15:38:46,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:38:46,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148592967] [2022-07-13 15:38:46,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148592967] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:38:46,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:38:46,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-07-13 15:38:46,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369051720] [2022-07-13 15:38:46,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:38:46,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-13 15:38:46,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:38:46,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-13 15:38:46,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2022-07-13 15:38:46,085 INFO L87 Difference]: Start difference. First operand 233 states and 281 transitions. Second operand has 26 states, 26 states have (on average 5.346153846153846) internal successors, (139), 26 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 15:38:46,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:38:46,355 INFO L93 Difference]: Finished difference Result 322 states and 370 transitions. [2022-07-13 15:38:46,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-13 15:38:46,355 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.346153846153846) internal successors, (139), 26 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2022-07-13 15:38:46,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:38:46,357 INFO L225 Difference]: With dead ends: 322 [2022-07-13 15:38:46,357 INFO L226 Difference]: Without dead ends: 227 [2022-07-13 15:38:46,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2022-07-13 15:38:46,358 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 88 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 15:38:46,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 143 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 15:38:46,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-07-13 15:38:46,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2022-07-13 15:38:46,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 1.2035398230088497) internal successors, (272), 226 states have internal predecessors, (272), 0 states have call successors, (0), 0 states 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 15:38:46,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 272 transitions. [2022-07-13 15:38:46,364 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 272 transitions. Word has length 139 [2022-07-13 15:38:46,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:38:46,365 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 272 transitions. [2022-07-13 15:38:46,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.346153846153846) internal successors, (139), 26 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 15:38:46,366 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 272 transitions. [2022-07-13 15:38:46,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-13 15:38:46,367 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:38:46,367 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:38:46,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 15:38:46,368 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:38:46,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:38:46,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1432066370, now seen corresponding path program 1 times [2022-07-13 15:38:46,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:38:46,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274728617] [2022-07-13 15:38:46,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:38:46,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:38:46,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:38:46,759 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 15:38:46,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:38:46,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274728617] [2022-07-13 15:38:46,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274728617] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:38:46,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:38:46,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-07-13 15:38:46,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313890661] [2022-07-13 15:38:46,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:38:46,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-13 15:38:46,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:38:46,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-13 15:38:46,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2022-07-13 15:38:46,762 INFO L87 Difference]: Start difference. First operand 227 states and 272 transitions. Second operand has 29 states, 29 states have (on average 4.793103448275862) internal successors, (139), 29 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 15:38:47,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:38:47,068 INFO L93 Difference]: Finished difference Result 310 states and 355 transitions. [2022-07-13 15:38:47,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-13 15:38:47,069 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 4.793103448275862) internal successors, (139), 29 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2022-07-13 15:38:47,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:38:47,070 INFO L225 Difference]: With dead ends: 310 [2022-07-13 15:38:47,071 INFO L226 Difference]: Without dead ends: 221 [2022-07-13 15:38:47,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2022-07-13 15:38:47,072 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 74 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 15:38:47,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 137 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 15:38:47,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-07-13 15:38:47,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2022-07-13 15:38:47,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.1954545454545455) internal successors, (263), 220 states have internal predecessors, (263), 0 states have call successors, (0), 0 states 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 15:38:47,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 263 transitions. [2022-07-13 15:38:47,078 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 263 transitions. Word has length 139 [2022-07-13 15:38:47,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:38:47,079 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 263 transitions. [2022-07-13 15:38:47,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.793103448275862) internal successors, (139), 29 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 15:38:47,079 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 263 transitions. [2022-07-13 15:38:47,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-13 15:38:47,080 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:38:47,081 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:38:47,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 15:38:47,081 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:38:47,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:38:47,081 INFO L85 PathProgramCache]: Analyzing trace with hash -269817043, now seen corresponding path program 1 times [2022-07-13 15:38:47,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:38:47,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211276512] [2022-07-13 15:38:47,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:38:47,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:38:47,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:38:47,537 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 15:38:47,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:38:47,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211276512] [2022-07-13 15:38:47,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211276512] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:38:47,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:38:47,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-07-13 15:38:47,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778227172] [2022-07-13 15:38:47,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:38:47,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-13 15:38:47,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:38:47,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-13 15:38:47,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2022-07-13 15:38:47,539 INFO L87 Difference]: Start difference. First operand 221 states and 263 transitions. Second operand has 31 states, 31 states have (on average 4.483870967741935) internal successors, (139), 31 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 15:38:47,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:38:47,855 INFO L93 Difference]: Finished difference Result 300 states and 342 transitions. [2022-07-13 15:38:47,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-13 15:38:47,856 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 4.483870967741935) internal successors, (139), 31 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2022-07-13 15:38:47,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:38:47,859 INFO L225 Difference]: With dead ends: 300 [2022-07-13 15:38:47,859 INFO L226 Difference]: Without dead ends: 217 [2022-07-13 15:38:47,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2022-07-13 15:38:47,861 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 83 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 15:38:47,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 131 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 15:38:47,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-07-13 15:38:47,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2022-07-13 15:38:47,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.1898148148148149) internal successors, (257), 216 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 15:38:47,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 257 transitions. [2022-07-13 15:38:47,867 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 257 transitions. Word has length 139 [2022-07-13 15:38:47,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:38:47,868 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 257 transitions. [2022-07-13 15:38:47,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 4.483870967741935) internal successors, (139), 31 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 15:38:47,868 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 257 transitions. [2022-07-13 15:38:47,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-13 15:38:47,869 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:38:47,869 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:38:47,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 15:38:47,870 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:38:47,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:38:47,870 INFO L85 PathProgramCache]: Analyzing trace with hash -295254777, now seen corresponding path program 1 times [2022-07-13 15:38:47,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:38:47,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715080348] [2022-07-13 15:38:47,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:38:47,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:38:47,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:38:48,349 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 15:38:48,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:38:48,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715080348] [2022-07-13 15:38:48,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715080348] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:38:48,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:38:48,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-07-13 15:38:48,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273471526] [2022-07-13 15:38:48,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:38:48,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-13 15:38:48,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:38:48,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-13 15:38:48,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2022-07-13 15:38:48,352 INFO L87 Difference]: Start difference. First operand 217 states and 257 transitions. Second operand has 35 states, 35 states have (on average 3.9714285714285715) internal successors, (139), 35 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 15:38:48,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:38:48,654 INFO L93 Difference]: Finished difference Result 288 states and 328 transitions. [2022-07-13 15:38:48,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-13 15:38:48,655 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.9714285714285715) internal successors, (139), 35 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2022-07-13 15:38:48,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:38:48,656 INFO L225 Difference]: With dead ends: 288 [2022-07-13 15:38:48,656 INFO L226 Difference]: Without dead ends: 209 [2022-07-13 15:38:48,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2022-07-13 15:38:48,657 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 94 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 15:38:48,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 116 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 15:38:48,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-07-13 15:38:48,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2022-07-13 15:38:48,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.1778846153846154) internal successors, (245), 208 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:38:48,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 245 transitions. [2022-07-13 15:38:48,665 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 245 transitions. Word has length 139 [2022-07-13 15:38:48,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:38:48,665 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 245 transitions. [2022-07-13 15:38:48,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.9714285714285715) internal successors, (139), 35 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 15:38:48,666 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 245 transitions. [2022-07-13 15:38:48,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-13 15:38:48,667 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:38:48,667 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:38:48,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 15:38:48,667 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:38:48,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:38:48,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1471149049, now seen corresponding path program 1 times [2022-07-13 15:38:48,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:38:48,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135863689] [2022-07-13 15:38:48,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:38:48,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:38:48,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:38:49,268 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 15:38:49,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:38:49,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135863689] [2022-07-13 15:38:49,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135863689] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:38:49,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:38:49,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-07-13 15:38:49,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705858328] [2022-07-13 15:38:49,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:38:49,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-13 15:38:49,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:38:49,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-13 15:38:49,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2022-07-13 15:38:49,271 INFO L87 Difference]: Start difference. First operand 209 states and 245 transitions. Second operand has 38 states, 38 states have (on average 3.6578947368421053) internal successors, (139), 38 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 15:38:49,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:38:49,589 INFO L93 Difference]: Finished difference Result 274 states and 310 transitions. [2022-07-13 15:38:49,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-13 15:38:49,589 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 3.6578947368421053) internal successors, (139), 38 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2022-07-13 15:38:49,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:38:49,590 INFO L225 Difference]: With dead ends: 274 [2022-07-13 15:38:49,590 INFO L226 Difference]: Without dead ends: 203 [2022-07-13 15:38:49,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2022-07-13 15:38:49,591 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 124 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 15:38:49,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 110 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 15:38:49,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-07-13 15:38:49,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2022-07-13 15:38:49,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 202 states have (on average 1.1683168316831682) internal successors, (236), 202 states have internal predecessors, (236), 0 states have call successors, (0), 0 states 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 15:38:49,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 236 transitions. [2022-07-13 15:38:49,597 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 236 transitions. Word has length 139 [2022-07-13 15:38:49,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:38:49,597 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 236 transitions. [2022-07-13 15:38:49,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.6578947368421053) internal successors, (139), 38 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 15:38:49,597 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 236 transitions. [2022-07-13 15:38:49,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-13 15:38:49,598 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:38:49,598 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:38:49,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-13 15:38:49,599 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:38:49,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:38:49,599 INFO L85 PathProgramCache]: Analyzing trace with hash -2129031119, now seen corresponding path program 1 times [2022-07-13 15:38:49,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:38:49,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084025986] [2022-07-13 15:38:49,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:38:49,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:38:49,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:38:50,179 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 15:38:50,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:38:50,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084025986] [2022-07-13 15:38:50,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084025986] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:38:50,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:38:50,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-07-13 15:38:50,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113458610] [2022-07-13 15:38:50,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:38:50,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-13 15:38:50,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:38:50,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-13 15:38:50,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2022-07-13 15:38:50,182 INFO L87 Difference]: Start difference. First operand 203 states and 236 transitions. Second operand has 39 states, 39 states have (on average 3.5641025641025643) internal successors, (139), 39 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 15:38:50,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:38:50,642 INFO L93 Difference]: Finished difference Result 266 states and 299 transitions. [2022-07-13 15:38:50,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-13 15:38:50,642 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.5641025641025643) internal successors, (139), 39 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2022-07-13 15:38:50,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:38:50,643 INFO L225 Difference]: With dead ends: 266 [2022-07-13 15:38:50,643 INFO L226 Difference]: Without dead ends: 201 [2022-07-13 15:38:50,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2022-07-13 15:38:50,644 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 111 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 15:38:50,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 119 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 15:38:50,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-07-13 15:38:50,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2022-07-13 15:38:50,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 200 states have (on average 1.165) internal successors, (233), 200 states have internal predecessors, (233), 0 states have call successors, (0), 0 states 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 15:38:50,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 233 transitions. [2022-07-13 15:38:50,650 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 233 transitions. Word has length 139 [2022-07-13 15:38:50,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:38:50,650 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 233 transitions. [2022-07-13 15:38:50,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.5641025641025643) internal successors, (139), 39 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 15:38:50,650 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 233 transitions. [2022-07-13 15:38:50,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-13 15:38:50,651 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:38:50,651 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:38:50,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 15:38:50,652 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:38:50,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:38:50,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1672960723, now seen corresponding path program 1 times [2022-07-13 15:38:50,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:38:50,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296715226] [2022-07-13 15:38:50,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:38:50,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:38:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:38:51,265 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 15:38:51,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:38:51,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296715226] [2022-07-13 15:38:51,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296715226] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:38:51,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:38:51,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-07-13 15:38:51,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135686796] [2022-07-13 15:38:51,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:38:51,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-13 15:38:51,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:38:51,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-13 15:38:51,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2022-07-13 15:38:51,268 INFO L87 Difference]: Start difference. First operand 201 states and 233 transitions. Second operand has 42 states, 42 states have (on average 3.3095238095238093) internal successors, (139), 42 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 15:38:51,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:38:51,574 INFO L93 Difference]: Finished difference Result 258 states and 290 transitions. [2022-07-13 15:38:51,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-13 15:38:51,574 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.3095238095238093) internal successors, (139), 42 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2022-07-13 15:38:51,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:38:51,575 INFO L225 Difference]: With dead ends: 258 [2022-07-13 15:38:51,575 INFO L226 Difference]: Without dead ends: 195 [2022-07-13 15:38:51,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2022-07-13 15:38:51,576 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 125 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 15:38:51,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 101 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 15:38:51,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-07-13 15:38:51,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2022-07-13 15:38:51,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 194 states have (on average 1.1546391752577319) internal successors, (224), 194 states have internal predecessors, (224), 0 states have call successors, (0), 0 states 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 15:38:51,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 224 transitions. [2022-07-13 15:38:51,582 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 224 transitions. Word has length 139 [2022-07-13 15:38:51,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:38:51,582 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 224 transitions. [2022-07-13 15:38:51,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.3095238095238093) internal successors, (139), 42 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 15:38:51,582 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 224 transitions. [2022-07-13 15:38:51,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-13 15:38:51,583 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:38:51,583 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:38:51,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-13 15:38:51,583 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:38:51,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:38:51,584 INFO L85 PathProgramCache]: Analyzing trace with hash -371842202, now seen corresponding path program 1 times [2022-07-13 15:38:51,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:38:51,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295315422] [2022-07-13 15:38:51,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:38:51,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:38:51,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:38:52,292 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 15:38:52,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:38:52,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295315422] [2022-07-13 15:38:52,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295315422] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:38:52,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:38:52,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2022-07-13 15:38:52,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982962526] [2022-07-13 15:38:52,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:38:52,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-13 15:38:52,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:38:52,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-13 15:38:52,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2022-07-13 15:38:52,295 INFO L87 Difference]: Start difference. First operand 195 states and 224 transitions. Second operand has 45 states, 45 states have (on average 3.088888888888889) internal successors, (139), 45 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 15:38:52,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:38:52,591 INFO L93 Difference]: Finished difference Result 246 states and 275 transitions. [2022-07-13 15:38:52,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-13 15:38:52,592 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 3.088888888888889) internal successors, (139), 45 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2022-07-13 15:38:52,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:38:52,593 INFO L225 Difference]: With dead ends: 246 [2022-07-13 15:38:52,593 INFO L226 Difference]: Without dead ends: 189 [2022-07-13 15:38:52,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2022-07-13 15:38:52,594 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 181 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 15:38:52,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 83 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 15:38:52,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-07-13 15:38:52,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2022-07-13 15:38:52,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 1.1436170212765957) internal successors, (215), 188 states have internal predecessors, (215), 0 states have call successors, (0), 0 states 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 15:38:52,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 215 transitions. [2022-07-13 15:38:52,598 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 215 transitions. Word has length 139 [2022-07-13 15:38:52,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:38:52,599 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 215 transitions. [2022-07-13 15:38:52,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 3.088888888888889) internal successors, (139), 45 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 15:38:52,599 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 215 transitions. [2022-07-13 15:38:52,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-13 15:38:52,600 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:38:52,600 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:38:52,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-13 15:38:52,601 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:38:52,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:38:52,601 INFO L85 PathProgramCache]: Analyzing trace with hash 941521525, now seen corresponding path program 1 times [2022-07-13 15:38:52,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:38:52,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241189445] [2022-07-13 15:38:52,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:38:52,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:38:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:38:53,346 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 15:38:53,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:38:53,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241189445] [2022-07-13 15:38:53,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241189445] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:38:53,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:38:53,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-07-13 15:38:53,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266087609] [2022-07-13 15:38:53,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:38:53,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-07-13 15:38:53,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:38:53,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-07-13 15:38:53,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2022-07-13 15:38:53,349 INFO L87 Difference]: Start difference. First operand 189 states and 215 transitions. Second operand has 47 states, 47 states have (on average 2.9574468085106385) internal successors, (139), 47 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 15:38:53,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:38:53,726 INFO L93 Difference]: Finished difference Result 236 states and 262 transitions. [2022-07-13 15:38:53,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-07-13 15:38:53,727 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.9574468085106385) internal successors, (139), 47 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2022-07-13 15:38:53,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:38:53,728 INFO L225 Difference]: With dead ends: 236 [2022-07-13 15:38:53,728 INFO L226 Difference]: Without dead ends: 185 [2022-07-13 15:38:53,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2022-07-13 15:38:53,729 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 217 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 15:38:53,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 86 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 15:38:53,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-13 15:38:53,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2022-07-13 15:38:53,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.1358695652173914) internal successors, (209), 184 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:38:53,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 209 transitions. [2022-07-13 15:38:53,734 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 209 transitions. Word has length 139 [2022-07-13 15:38:53,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:38:53,734 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 209 transitions. [2022-07-13 15:38:53,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.9574468085106385) internal successors, (139), 47 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 15:38:53,735 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 209 transitions. [2022-07-13 15:38:53,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-13 15:38:53,748 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:38:53,748 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:38:53,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-13 15:38:53,749 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:38:53,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:38:53,749 INFO L85 PathProgramCache]: Analyzing trace with hash 566614415, now seen corresponding path program 1 times [2022-07-13 15:38:53,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:38:53,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090753937] [2022-07-13 15:38:53,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:38:53,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:38:53,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:38:54,628 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 15:38:54,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:38:54,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090753937] [2022-07-13 15:38:54,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090753937] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:38:54,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:38:54,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2022-07-13 15:38:54,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194299750] [2022-07-13 15:38:54,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:38:54,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-13 15:38:54,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:38:54,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-13 15:38:54,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2022-07-13 15:38:54,631 INFO L87 Difference]: Start difference. First operand 185 states and 209 transitions. Second operand has 51 states, 51 states have (on average 2.7254901960784315) internal successors, (139), 51 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 15:38:55,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:38:55,011 INFO L93 Difference]: Finished difference Result 224 states and 248 transitions. [2022-07-13 15:38:55,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-07-13 15:38:55,011 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.7254901960784315) internal successors, (139), 51 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2022-07-13 15:38:55,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:38:55,012 INFO L225 Difference]: With dead ends: 224 [2022-07-13 15:38:55,012 INFO L226 Difference]: Without dead ends: 177 [2022-07-13 15:38:55,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2022-07-13 15:38:55,014 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 137 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 15:38:55,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 80 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 15:38:55,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-07-13 15:38:55,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2022-07-13 15:38:55,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 176 states have (on average 1.1193181818181819) internal successors, (197), 176 states have internal predecessors, (197), 0 states have call successors, (0), 0 states 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 15:38:55,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 197 transitions. [2022-07-13 15:38:55,019 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 197 transitions. Word has length 139 [2022-07-13 15:38:55,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:38:55,019 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 197 transitions. [2022-07-13 15:38:55,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.7254901960784315) internal successors, (139), 51 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 15:38:55,019 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 197 transitions. [2022-07-13 15:38:55,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-13 15:38:55,020 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:38:55,020 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:38:55,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-13 15:38:55,021 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:38:55,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:38:55,021 INFO L85 PathProgramCache]: Analyzing trace with hash 325265535, now seen corresponding path program 1 times [2022-07-13 15:38:55,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:38:55,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015689295] [2022-07-13 15:38:55,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:38:55,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:38:55,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:38:56,063 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 15:38:56,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:38:56,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015689295] [2022-07-13 15:38:56,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015689295] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:38:56,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:38:56,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2022-07-13 15:38:56,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497117926] [2022-07-13 15:38:56,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:38:56,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-13 15:38:56,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:38:56,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-13 15:38:56,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1328, Invalid=1428, Unknown=0, NotChecked=0, Total=2756 [2022-07-13 15:38:56,065 INFO L87 Difference]: Start difference. First operand 177 states and 197 transitions. Second operand has 53 states, 53 states have (on average 2.6226415094339623) internal successors, (139), 53 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 15:38:56,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:38:56,417 INFO L93 Difference]: Finished difference Result 212 states and 232 transitions. [2022-07-13 15:38:56,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-07-13 15:38:56,417 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.6226415094339623) internal successors, (139), 53 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2022-07-13 15:38:56,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:38:56,418 INFO L225 Difference]: With dead ends: 212 [2022-07-13 15:38:56,418 INFO L226 Difference]: Without dead ends: 143 [2022-07-13 15:38:56,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1328, Invalid=1428, Unknown=0, NotChecked=0, Total=2756 [2022-07-13 15:38:56,420 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 195 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 15:38:56,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 14 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 15:38:56,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-07-13 15:38:56,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2022-07-13 15:38:56,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.0142857142857142) internal successors, (142), 140 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:38:56,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2022-07-13 15:38:56,425 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 139 [2022-07-13 15:38:56,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:38:56,425 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2022-07-13 15:38:56,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.6226415094339623) internal successors, (139), 53 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 15:38:56,426 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2022-07-13 15:38:56,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-13 15:38:56,426 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:38:56,426 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:38:56,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-13 15:38:56,427 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:38:56,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:38:56,427 INFO L85 PathProgramCache]: Analyzing trace with hash -2012640870, now seen corresponding path program 1 times [2022-07-13 15:38:56,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:38:56,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537480208] [2022-07-13 15:38:56,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:38:56,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:38:56,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:38:58,058 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 15:38:58,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:38:58,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537480208] [2022-07-13 15:38:58,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537480208] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:38:58,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:38:58,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [70] imperfect sequences [] total 70 [2022-07-13 15:38:58,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269839547] [2022-07-13 15:38:58,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:38:58,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-07-13 15:38:58,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:38:58,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-07-13 15:38:58,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2022-07-13 15:38:58,061 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand has 70 states, 70 states have (on average 1.9857142857142858) internal successors, (139), 70 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 15:38:58,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:38:58,438 INFO L93 Difference]: Finished difference Result 182 states and 184 transitions. [2022-07-13 15:38:58,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-07-13 15:38:58,438 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 1.9857142857142858) internal successors, (139), 70 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2022-07-13 15:38:58,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:38:58,439 INFO L225 Difference]: With dead ends: 182 [2022-07-13 15:38:58,439 INFO L226 Difference]: Without dead ends: 143 [2022-07-13 15:38:58,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2022-07-13 15:38:58,441 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 264 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 15:38:58,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 23 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 15:38:58,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-07-13 15:38:58,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2022-07-13 15:38:58,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.0070921985815602) internal successors, (142), 141 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 15:38:58,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2022-07-13 15:38:58,447 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 139 [2022-07-13 15:38:58,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:38:58,447 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2022-07-13 15:38:58,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 1.9857142857142858) internal successors, (139), 70 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 15:38:58,448 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2022-07-13 15:38:58,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-13 15:38:58,448 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:38:58,449 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:38:58,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-13 15:38:58,449 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:38:58,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:38:58,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1420118316, now seen corresponding path program 1 times [2022-07-13 15:38:58,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:38:58,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212783572] [2022-07-13 15:38:58,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:38:58,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:38:58,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:39:00,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:39:00,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:39:00,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212783572] [2022-07-13 15:39:00,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212783572] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:39:00,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828774852] [2022-07-13 15:39:00,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:39:00,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:39:00,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:39:00,045 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 15:39:00,045 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 15:39:00,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:39:00,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 70 conjunts are in the unsatisfiable core [2022-07-13 15:39:00,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:39:00,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:39:00,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:39:02,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:39:02,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828774852] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:39:02,532 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:39:02,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 103 [2022-07-13 15:39:02,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334645917] [2022-07-13 15:39:02,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:39:02,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2022-07-13 15:39:02,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:39:02,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2022-07-13 15:39:02,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2022-07-13 15:39:02,537 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand has 103 states, 103 states have (on average 2.737864077669903) internal successors, (282), 103 states have internal predecessors, (282), 0 states have call successors, (0), 0 states 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 15:39:03,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:39:03,043 INFO L93 Difference]: Finished difference Result 209 states and 240 transitions. [2022-07-13 15:39:03,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-07-13 15:39:03,044 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 103 states have (on average 2.737864077669903) internal successors, (282), 103 states have internal predecessors, (282), 0 states have call successors, (0), 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 141 [2022-07-13 15:39:03,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:39:03,045 INFO L225 Difference]: With dead ends: 209 [2022-07-13 15:39:03,045 INFO L226 Difference]: Without dead ends: 206 [2022-07-13 15:39:03,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 249 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2022-07-13 15:39:03,051 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 311 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 1113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 15:39:03,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 23 Invalid, 1113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 15:39:03,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-07-13 15:39:03,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2022-07-13 15:39:03,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.0048780487804878) internal successors, (206), 205 states have internal predecessors, (206), 0 states have call successors, (0), 0 states 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 15:39:03,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2022-07-13 15:39:03,058 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 141 [2022-07-13 15:39:03,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:39:03,058 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2022-07-13 15:39:03,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 2.737864077669903) internal successors, (282), 103 states have internal predecessors, (282), 0 states have call successors, (0), 0 states 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 15:39:03,059 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2022-07-13 15:39:03,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-07-13 15:39:03,060 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:39:03,061 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:39:03,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-13 15:39:03,279 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,SelfDestructingSolverStorable22 [2022-07-13 15:39:03,279 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:39:03,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:39:03,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1334769172, now seen corresponding path program 2 times [2022-07-13 15:39:03,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:39:03,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806655471] [2022-07-13 15:39:03,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:39:03,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:39:03,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:39:04,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:39:04,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:39:04,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806655471] [2022-07-13 15:39:04,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806655471] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 15:39:04,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872621138] [2022-07-13 15:39:04,740 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 15:39:04,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 15:39:04,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 15:39:04,744 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 15:39:04,745 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 15:39:04,842 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 15:39:04,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 15:39:04,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 105 conjunts are in the unsatisfiable core [2022-07-13 15:39:04,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 15:39:05,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:39:05,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 15:39:06,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:39:06,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872621138] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 15:39:06,175 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 15:39:06,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 55 [2022-07-13 15:39:06,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334641542] [2022-07-13 15:39:06,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 15:39:06,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-07-13 15:39:06,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:39:06,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-07-13 15:39:06,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=2862, Unknown=0, NotChecked=0, Total=2970 [2022-07-13 15:39:06,178 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand has 55 states, 55 states have (on average 3.7636363636363637) internal successors, (207), 55 states have internal predecessors, (207), 0 states have call successors, (0), 0 states 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 15:39:07,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:39:07,161 INFO L93 Difference]: Finished difference Result 212 states and 212 transitions. [2022-07-13 15:39:07,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-07-13 15:39:07,161 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 3.7636363636363637) internal successors, (207), 55 states have internal predecessors, (207), 0 states have call successors, (0), 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 205 [2022-07-13 15:39:07,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:39:07,162 INFO L225 Difference]: With dead ends: 212 [2022-07-13 15:39:07,163 INFO L226 Difference]: Without dead ends: 209 [2022-07-13 15:39:07,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 404 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=113, Invalid=2967, Unknown=0, NotChecked=0, Total=3080 [2022-07-13 15:39:07,164 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 2 mSDsluCounter, 7856 mSDsCounter, 0 mSdLazyCounter, 2758 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8011 SdHoareTripleChecker+Invalid, 2758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-13 15:39:07,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8011 Invalid, 2758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2758 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-13 15:39:07,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-07-13 15:39:07,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 208. [2022-07-13 15:39:07,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 1.0048309178743962) internal successors, (208), 207 states have internal predecessors, (208), 0 states have call successors, (0), 0 states 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 15:39:07,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2022-07-13 15:39:07,173 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 205 [2022-07-13 15:39:07,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:39:07,173 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2022-07-13 15:39:07,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 3.7636363636363637) internal successors, (207), 55 states have internal predecessors, (207), 0 states have call successors, (0), 0 states 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 15:39:07,174 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2022-07-13 15:39:07,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-07-13 15:39:07,175 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 15:39:07,175 INFO L195 NwaCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:39:07,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 15:39:07,391 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,SelfDestructingSolverStorable23 [2022-07-13 15:39:07,391 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 15:39:07,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 15:39:07,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1489572658, now seen corresponding path program 3 times [2022-07-13 15:39:07,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 15:39:07,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930642305] [2022-07-13 15:39:07,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 15:39:07,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 15:39:07,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 15:39:08,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 1156 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 15:39:08,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 15:39:08,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930642305] [2022-07-13 15:39:08,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930642305] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 15:39:08,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 15:39:08,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2022-07-13 15:39:08,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948226708] [2022-07-13 15:39:08,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 15:39:08,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-07-13 15:39:08,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 15:39:08,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-07-13 15:39:08,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2022-07-13 15:39:08,489 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand has 52 states, 52 states have (on average 3.980769230769231) internal successors, (207), 52 states have internal predecessors, (207), 0 states have call successors, (0), 0 states 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 15:39:08,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 15:39:08,776 INFO L93 Difference]: Finished difference Result 208 states and 208 transitions. [2022-07-13 15:39:08,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-07-13 15:39:08,776 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.980769230769231) internal successors, (207), 52 states have internal predecessors, (207), 0 states have call successors, (0), 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 207 [2022-07-13 15:39:08,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 15:39:08,777 INFO L225 Difference]: With dead ends: 208 [2022-07-13 15:39:08,777 INFO L226 Difference]: Without dead ends: 0 [2022-07-13 15:39:08,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2022-07-13 15:39:08,778 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 57 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 15:39:08,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 105 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 15:39:08,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-13 15:39:08,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-13 15:39:08,779 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 15:39:08,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-13 15:39:08,780 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 207 [2022-07-13 15:39:08,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 15:39:08,780 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 15:39:08,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.980769230769231) internal successors, (207), 52 states have internal predecessors, (207), 0 states have call successors, (0), 0 states 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 15:39:08,780 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-13 15:39:08,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-13 15:39:08,783 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 15:39:08,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-13 15:39:08,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-13 15:39:09,362 INFO L895 garLoopResultBuilder]: At program point L927(lines 181 928) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= |ULTIMATE.start_main_~main__x~0#1| 28) (<= 28 |ULTIMATE.start_main_~main__x~0#1|) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-07-13 15:39:09,362 INFO L895 garLoopResultBuilder]: At program point L795(lines 247 796) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= 39 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 39)) [2022-07-13 15:39:09,363 INFO L895 garLoopResultBuilder]: At program point L663(lines 313 664) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__x~0#1| 50) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__x~0#1|) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-07-13 15:39:09,363 INFO L895 garLoopResultBuilder]: At program point L531(lines 379 532) the Hoare annotation is: (and (<= 61 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 61) (<= 61 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 61)) [2022-07-13 15:39:09,363 INFO L899 garLoopResultBuilder]: For program point L367(lines 367 556) no Hoare annotation was computed. [2022-07-13 15:39:09,363 INFO L899 garLoopResultBuilder]: For program point L301(lines 301 688) no Hoare annotation was computed. [2022-07-13 15:39:09,363 INFO L899 garLoopResultBuilder]: For program point L235(lines 235 820) no Hoare annotation was computed. [2022-07-13 15:39:09,363 INFO L899 garLoopResultBuilder]: For program point L169(lines 169 952) no Hoare annotation was computed. [2022-07-13 15:39:09,363 INFO L899 garLoopResultBuilder]: For program point L103(lines 103 1084) no Hoare annotation was computed. [2022-07-13 15:39:09,363 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 1216) no Hoare annotation was computed. [2022-07-13 15:39:09,363 INFO L895 garLoopResultBuilder]: At program point L1227(lines 31 1228) the Hoare annotation is: (and (<= 3 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 3)) [2022-07-13 15:39:09,363 INFO L895 garLoopResultBuilder]: At program point L1095(lines 97 1096) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__x~0#1| 14) (<= 14 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-07-13 15:39:09,363 INFO L895 garLoopResultBuilder]: At program point L963(lines 163 964) the Hoare annotation is: (and (<= 25 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 25) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-07-13 15:39:09,364 INFO L895 garLoopResultBuilder]: At program point L831(lines 229 832) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= |ULTIMATE.start_main_~main__x~0#1| 36) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= 36 |ULTIMATE.start_main_~main__x~0#1|)) [2022-07-13 15:39:09,364 INFO L895 garLoopResultBuilder]: At program point L699(lines 295 700) the Hoare annotation is: (and (<= 47 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 47) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-07-13 15:39:09,364 INFO L895 garLoopResultBuilder]: At program point L567(lines 361 568) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__x~0#1| 58) (<= |ULTIMATE.start_main_~main__y~0#1| 58) (<= 58 |ULTIMATE.start_main_~main__x~0#1|) (<= 58 |ULTIMATE.start_main_~main__y~0#1|)) [2022-07-13 15:39:09,364 INFO L899 garLoopResultBuilder]: For program point L403(lines 403 484) no Hoare annotation was computed. [2022-07-13 15:39:09,364 INFO L899 garLoopResultBuilder]: For program point L337(lines 337 616) no Hoare annotation was computed. [2022-07-13 15:39:09,364 INFO L899 garLoopResultBuilder]: For program point L271(lines 271 748) no Hoare annotation was computed. [2022-07-13 15:39:09,364 INFO L899 garLoopResultBuilder]: For program point L205(lines 205 880) no Hoare annotation was computed. [2022-07-13 15:39:09,364 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 1012) no Hoare annotation was computed. [2022-07-13 15:39:09,365 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 1144) no Hoare annotation was computed. [2022-07-13 15:39:09,365 INFO L895 garLoopResultBuilder]: At program point L1131(lines 79 1132) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__x~0#1| 11) (<= 11 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-07-13 15:39:09,365 INFO L895 garLoopResultBuilder]: At program point L999(lines 145 1000) the Hoare annotation is: (and (<= 22 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 22)) [2022-07-13 15:39:09,365 INFO L895 garLoopResultBuilder]: At program point L867(lines 211 868) the Hoare annotation is: (and (<= 33 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 33) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-07-13 15:39:09,365 INFO L895 garLoopResultBuilder]: At program point L735(lines 277 736) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__x~0#1| 44) (<= 44 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-07-13 15:39:09,365 INFO L895 garLoopResultBuilder]: At program point L603(lines 343 604) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__y~0#1| 55) (<= |ULTIMATE.start_main_~main__x~0#1| 55) (<= 55 |ULTIMATE.start_main_~main__y~0#1|) (<= 55 |ULTIMATE.start_main_~main__x~0#1|)) [2022-07-13 15:39:09,366 INFO L895 garLoopResultBuilder]: At program point L471(lines 409 472) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__x~0#1| 66) (<= |ULTIMATE.start_main_~main__y~0#1| 66) (<= 66 |ULTIMATE.start_main_~main__y~0#1|) (<= 66 |ULTIMATE.start_main_~main__x~0#1|)) [2022-07-13 15:39:09,366 INFO L899 garLoopResultBuilder]: For program point L373(lines 373 544) no Hoare annotation was computed. [2022-07-13 15:39:09,366 INFO L899 garLoopResultBuilder]: For program point L307(lines 307 676) no Hoare annotation was computed. [2022-07-13 15:39:09,366 INFO L899 garLoopResultBuilder]: For program point L241(lines 241 808) no Hoare annotation was computed. [2022-07-13 15:39:09,366 INFO L899 garLoopResultBuilder]: For program point L175(lines 175 940) no Hoare annotation was computed. [2022-07-13 15:39:09,366 INFO L899 garLoopResultBuilder]: For program point L109(lines 109 1072) no Hoare annotation was computed. [2022-07-13 15:39:09,366 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 1204) no Hoare annotation was computed. [2022-07-13 15:39:09,366 INFO L895 garLoopResultBuilder]: At program point L1167(lines 61 1168) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__x~0#1| 8) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= 8 |ULTIMATE.start_main_~main__x~0#1|)) [2022-07-13 15:39:09,367 INFO L895 garLoopResultBuilder]: At program point L1035(lines 127 1036) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__x~0#1| 19) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= 19 |ULTIMATE.start_main_~main__x~0#1|)) [2022-07-13 15:39:09,367 INFO L895 garLoopResultBuilder]: At program point L903(lines 193 904) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= |ULTIMATE.start_main_~main__x~0#1| 30) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= 30 |ULTIMATE.start_main_~main__x~0#1|)) [2022-07-13 15:39:09,367 INFO L895 garLoopResultBuilder]: At program point L771(lines 259 772) the Hoare annotation is: (and (<= 41 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 41) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-07-13 15:39:09,367 INFO L895 garLoopResultBuilder]: At program point L639(lines 325 640) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__x~0#1| 52) (<= 52 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 52) (<= 52 |ULTIMATE.start_main_~main__x~0#1|)) [2022-07-13 15:39:09,367 INFO L895 garLoopResultBuilder]: At program point L507(lines 391 508) the Hoare annotation is: (and (<= 63 |ULTIMATE.start_main_~main__y~0#1|) (<= 63 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 63) (<= |ULTIMATE.start_main_~main__y~0#1| 63)) [2022-07-13 15:39:09,367 INFO L899 garLoopResultBuilder]: For program point L442(lines 442 451) no Hoare annotation was computed. [2022-07-13 15:39:09,368 INFO L899 garLoopResultBuilder]: For program point L409(lines 409 472) no Hoare annotation was computed. [2022-07-13 15:39:09,368 INFO L899 garLoopResultBuilder]: For program point L343(lines 343 604) no Hoare annotation was computed. [2022-07-13 15:39:09,368 INFO L899 garLoopResultBuilder]: For program point L277(lines 277 736) no Hoare annotation was computed. [2022-07-13 15:39:09,368 INFO L899 garLoopResultBuilder]: For program point L211(lines 211 868) no Hoare annotation was computed. [2022-07-13 15:39:09,368 INFO L899 garLoopResultBuilder]: For program point L145(lines 145 1000) no Hoare annotation was computed. [2022-07-13 15:39:09,368 INFO L899 garLoopResultBuilder]: For program point L79(lines 79 1132) no Hoare annotation was computed. [2022-07-13 15:39:09,368 INFO L895 garLoopResultBuilder]: At program point L1203(lines 43 1204) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__x~0#1| 5) (<= 5 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-07-13 15:39:09,369 INFO L895 garLoopResultBuilder]: At program point L1071(lines 109 1072) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 16 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 16) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-07-13 15:39:09,369 INFO L895 garLoopResultBuilder]: At program point L939(lines 175 940) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__x~0#1| 27) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= 27 |ULTIMATE.start_main_~main__x~0#1|)) [2022-07-13 15:39:09,369 INFO L895 garLoopResultBuilder]: At program point L807(lines 241 808) the Hoare annotation is: (and (<= 38 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 38) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-07-13 15:39:09,369 INFO L895 garLoopResultBuilder]: At program point L675(lines 307 676) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 49) (<= 49 |ULTIMATE.start_main_~main__x~0#1|)) [2022-07-13 15:39:09,369 INFO L895 garLoopResultBuilder]: At program point L543(lines 373 544) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__x~0#1| 60) (<= 60 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 60) (<= 60 |ULTIMATE.start_main_~main__x~0#1|)) [2022-07-13 15:39:09,369 INFO L899 garLoopResultBuilder]: For program point L444(line 444) no Hoare annotation was computed. [2022-07-13 15:39:09,369 INFO L899 garLoopResultBuilder]: For program point L379(lines 379 532) no Hoare annotation was computed. [2022-07-13 15:39:09,370 INFO L899 garLoopResultBuilder]: For program point L313(lines 313 664) no Hoare annotation was computed. [2022-07-13 15:39:09,370 INFO L899 garLoopResultBuilder]: For program point L247(lines 247 796) no Hoare annotation was computed. [2022-07-13 15:39:09,370 INFO L899 garLoopResultBuilder]: For program point L181(lines 181 928) no Hoare annotation was computed. [2022-07-13 15:39:09,370 INFO L899 garLoopResultBuilder]: For program point L115(lines 115 1060) no Hoare annotation was computed. [2022-07-13 15:39:09,370 INFO L899 garLoopResultBuilder]: For program point L49(lines 49 1192) no Hoare annotation was computed. [2022-07-13 15:39:09,370 INFO L895 garLoopResultBuilder]: At program point L1239(lines 25 1240) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__x~0#1| 2) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 2 |ULTIMATE.start_main_~main__x~0#1|) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-07-13 15:39:09,370 INFO L895 garLoopResultBuilder]: At program point L1107(lines 91 1108) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 13) (<= 13 |ULTIMATE.start_main_~main__x~0#1|)) [2022-07-13 15:39:09,371 INFO L899 garLoopResultBuilder]: For program point L17(lines 17 1257) no Hoare annotation was computed. [2022-07-13 15:39:09,371 INFO L895 garLoopResultBuilder]: At program point L975(lines 157 976) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 24 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 24) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-07-13 15:39:09,371 INFO L895 garLoopResultBuilder]: At program point L843(lines 223 844) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 35) (<= 35 |ULTIMATE.start_main_~main__x~0#1|)) [2022-07-13 15:39:09,371 INFO L895 garLoopResultBuilder]: At program point L711(lines 289 712) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__x~0#1| 46) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 46 |ULTIMATE.start_main_~main__x~0#1|) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-07-13 15:39:09,371 INFO L895 garLoopResultBuilder]: At program point L579(lines 355 580) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__x~0#1| 57) (<= |ULTIMATE.start_main_~main__y~0#1| 57) (<= 57 |ULTIMATE.start_main_~main__x~0#1|) (<= 57 |ULTIMATE.start_main_~main__y~0#1|)) [2022-07-13 15:39:09,371 INFO L899 garLoopResultBuilder]: For program point L415(lines 415 460) no Hoare annotation was computed. [2022-07-13 15:39:09,371 INFO L899 garLoopResultBuilder]: For program point L349(lines 349 592) no Hoare annotation was computed. [2022-07-13 15:39:09,372 INFO L899 garLoopResultBuilder]: For program point L283(lines 283 724) no Hoare annotation was computed. [2022-07-13 15:39:09,372 INFO L899 garLoopResultBuilder]: For program point L217(lines 217 856) no Hoare annotation was computed. [2022-07-13 15:39:09,372 INFO L899 garLoopResultBuilder]: For program point L151(lines 151 988) no Hoare annotation was computed. [2022-07-13 15:39:09,372 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 1120) no Hoare annotation was computed. [2022-07-13 15:39:09,372 INFO L899 garLoopResultBuilder]: For program point L19(lines 19 1252) no Hoare annotation was computed. [2022-07-13 15:39:09,372 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-13 15:39:09,372 INFO L895 garLoopResultBuilder]: At program point L1143(lines 73 1144) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 10 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 10) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-07-13 15:39:09,373 INFO L895 garLoopResultBuilder]: At program point L1011(lines 139 1012) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 21) (<= 21 |ULTIMATE.start_main_~main__x~0#1|)) [2022-07-13 15:39:09,373 INFO L895 garLoopResultBuilder]: At program point L879(lines 205 880) the Hoare annotation is: (and (<= 32 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 32)) [2022-07-13 15:39:09,373 INFO L895 garLoopResultBuilder]: At program point L747(lines 271 748) the Hoare annotation is: (and (<= 43 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 43)) [2022-07-13 15:39:09,373 INFO L895 garLoopResultBuilder]: At program point L615(lines 337 616) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__y~0#1| 54) (<= |ULTIMATE.start_main_~main__x~0#1| 54) (<= 54 |ULTIMATE.start_main_~main__y~0#1|) (<= 54 |ULTIMATE.start_main_~main__x~0#1|)) [2022-07-13 15:39:09,373 INFO L895 garLoopResultBuilder]: At program point L483(lines 403 484) the Hoare annotation is: (and (<= 65 |ULTIMATE.start_main_~main__y~0#1|) (<= 65 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 65) (<= |ULTIMATE.start_main_~main__x~0#1| 65)) [2022-07-13 15:39:09,373 INFO L899 garLoopResultBuilder]: For program point L385(lines 385 520) no Hoare annotation was computed. [2022-07-13 15:39:09,373 INFO L899 garLoopResultBuilder]: For program point L319(lines 319 652) no Hoare annotation was computed. [2022-07-13 15:39:09,374 INFO L899 garLoopResultBuilder]: For program point L253(lines 253 784) no Hoare annotation was computed. [2022-07-13 15:39:09,374 INFO L899 garLoopResultBuilder]: For program point L187(lines 187 916) no Hoare annotation was computed. [2022-07-13 15:39:09,374 INFO L899 garLoopResultBuilder]: For program point L121(lines 121 1048) no Hoare annotation was computed. [2022-07-13 15:39:09,374 INFO L899 garLoopResultBuilder]: For program point L55(lines 55 1180) no Hoare annotation was computed. [2022-07-13 15:39:09,374 INFO L895 garLoopResultBuilder]: At program point L1179(lines 55 1180) the Hoare annotation is: (and (<= 7 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 7)) [2022-07-13 15:39:09,374 INFO L895 garLoopResultBuilder]: At program point L1047(lines 121 1048) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= |ULTIMATE.start_main_~main__x~0#1| 18) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= 18 |ULTIMATE.start_main_~main__x~0#1|)) [2022-07-13 15:39:09,374 INFO L895 garLoopResultBuilder]: At program point L915(lines 187 916) the Hoare annotation is: (and (<= 29 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 29)) [2022-07-13 15:39:09,374 INFO L895 garLoopResultBuilder]: At program point L783(lines 253 784) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__x~0#1| 40) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 40 |ULTIMATE.start_main_~main__x~0#1|) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-07-13 15:39:09,375 INFO L895 garLoopResultBuilder]: At program point L651(lines 319 652) the Hoare annotation is: (and (<= 51 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 51) (<= 51 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 51)) [2022-07-13 15:39:09,375 INFO L895 garLoopResultBuilder]: At program point L519(lines 385 520) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__y~0#1| 62) (<= 62 |ULTIMATE.start_main_~main__y~0#1|) (<= 62 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 62)) [2022-07-13 15:39:09,375 INFO L899 garLoopResultBuilder]: For program point L355(lines 355 580) no Hoare annotation was computed. [2022-07-13 15:39:09,375 INFO L899 garLoopResultBuilder]: For program point L289(lines 289 712) no Hoare annotation was computed. [2022-07-13 15:39:09,375 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-13 15:39:09,375 INFO L899 garLoopResultBuilder]: For program point L223(lines 223 844) no Hoare annotation was computed. [2022-07-13 15:39:09,375 INFO L899 garLoopResultBuilder]: For program point L157(lines 157 976) no Hoare annotation was computed. [2022-07-13 15:39:09,376 INFO L899 garLoopResultBuilder]: For program point L91(lines 91 1108) no Hoare annotation was computed. [2022-07-13 15:39:09,376 INFO L899 garLoopResultBuilder]: For program point L25(lines 25 1240) no Hoare annotation was computed. [2022-07-13 15:39:09,376 INFO L899 garLoopResultBuilder]: For program point L422(lines 422 433) no Hoare annotation was computed. [2022-07-13 15:39:09,376 INFO L895 garLoopResultBuilder]: At program point L1215(lines 37 1216) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= |ULTIMATE.start_main_~main__x~0#1| 4) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= 4 |ULTIMATE.start_main_~main__x~0#1|)) [2022-07-13 15:39:09,376 INFO L895 garLoopResultBuilder]: At program point L1083(lines 103 1084) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 15 |ULTIMATE.start_main_~main__x~0#1|) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 15)) [2022-07-13 15:39:09,376 INFO L895 garLoopResultBuilder]: At program point L951(lines 169 952) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= |ULTIMATE.start_main_~main__x~0#1| 26) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= 26 |ULTIMATE.start_main_~main__x~0#1|)) [2022-07-13 15:39:09,376 INFO L895 garLoopResultBuilder]: At program point L819(lines 235 820) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 37 |ULTIMATE.start_main_~main__x~0#1|) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 37)) [2022-07-13 15:39:09,377 INFO L895 garLoopResultBuilder]: At program point L687(lines 301 688) the Hoare annotation is: (and (<= 48 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 48)) [2022-07-13 15:39:09,377 INFO L895 garLoopResultBuilder]: At program point L555(lines 367 556) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__x~0#1| 59) (<= 59 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 59) (<= 59 |ULTIMATE.start_main_~main__x~0#1|)) [2022-07-13 15:39:09,377 INFO L899 garLoopResultBuilder]: For program point L391(lines 391 508) no Hoare annotation was computed. [2022-07-13 15:39:09,377 INFO L899 garLoopResultBuilder]: For program point L325(lines 325 640) no Hoare annotation was computed. [2022-07-13 15:39:09,377 INFO L899 garLoopResultBuilder]: For program point L259(lines 259 772) no Hoare annotation was computed. [2022-07-13 15:39:09,377 INFO L899 garLoopResultBuilder]: For program point L193(lines 193 904) no Hoare annotation was computed. [2022-07-13 15:39:09,377 INFO L899 garLoopResultBuilder]: For program point L127(lines 127 1036) no Hoare annotation was computed. [2022-07-13 15:39:09,377 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 1168) no Hoare annotation was computed. [2022-07-13 15:39:09,378 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-13 15:39:09,378 INFO L895 garLoopResultBuilder]: At program point L1251(lines 19 1252) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 1)) [2022-07-13 15:39:09,378 INFO L895 garLoopResultBuilder]: At program point L1119(lines 85 1120) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__x~0#1| 12) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= 12 |ULTIMATE.start_main_~main__x~0#1|)) [2022-07-13 15:39:09,378 INFO L895 garLoopResultBuilder]: At program point L987(lines 151 988) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= 23 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 23)) [2022-07-13 15:39:09,378 INFO L895 garLoopResultBuilder]: At program point L855(lines 217 856) the Hoare annotation is: (and (<= 34 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 34)) [2022-07-13 15:39:09,378 INFO L895 garLoopResultBuilder]: At program point L723(lines 283 724) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__x~0#1| 45) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 45 |ULTIMATE.start_main_~main__x~0#1|) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-07-13 15:39:09,378 INFO L895 garLoopResultBuilder]: At program point L591(lines 349 592) the Hoare annotation is: (and (<= 56 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 56) (<= 56 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 56)) [2022-07-13 15:39:09,379 INFO L895 garLoopResultBuilder]: At program point L459(lines 415 460) the Hoare annotation is: (or (and (<= 78 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 78) (<= 78 |ULTIMATE.start_main_~main__y~0#1|) (< |ULTIMATE.start_main_~main__x~0#1| 79)) (and (<= 91 |ULTIMATE.start_main_~main__x~0#1|) (<= 91 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 91) (< |ULTIMATE.start_main_~main__x~0#1| 92)) (and (<= 84 |ULTIMATE.start_main_~main__y~0#1|) (<= 84 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 84) (< |ULTIMATE.start_main_~main__x~0#1| 85)) (and (<= 80 |ULTIMATE.start_main_~main__x~0#1|) (< |ULTIMATE.start_main_~main__x~0#1| 81) (<= |ULTIMATE.start_main_~main__y~0#1| 80) (<= 80 |ULTIMATE.start_main_~main__y~0#1|)) (and (<= 99 |ULTIMATE.start_main_~main__y~0#1|) (<= 99 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 99) (< |ULTIMATE.start_main_~main__x~0#1| 100)) (and (<= 88 |ULTIMATE.start_main_~main__x~0#1|) (< |ULTIMATE.start_main_~main__x~0#1| 89) (<= 88 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 88)) (and (<= 73 |ULTIMATE.start_main_~main__y~0#1|) (< |ULTIMATE.start_main_~main__x~0#1| 74) (<= |ULTIMATE.start_main_~main__y~0#1| 73) (<= 73 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= 86 |ULTIMATE.start_main_~main__x~0#1|) (< |ULTIMATE.start_main_~main__x~0#1| 87) (<= 86 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 86)) (and (<= 94 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 94) (<= 94 |ULTIMATE.start_main_~main__x~0#1|) (< |ULTIMATE.start_main_~main__x~0#1| 95)) (and (< 99 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 100) (<= 100 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= 72 |ULTIMATE.start_main_~main__y~0#1|) (<= 72 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 72) (< |ULTIMATE.start_main_~main__x~0#1| 73)) (and (< |ULTIMATE.start_main_~main__x~0#1| 97) (<= |ULTIMATE.start_main_~main__y~0#1| 96) (<= 96 |ULTIMATE.start_main_~main__y~0#1|) (<= 96 |ULTIMATE.start_main_~main__x~0#1|)) (and (< |ULTIMATE.start_main_~main__x~0#1| 76) (<= 75 |ULTIMATE.start_main_~main__x~0#1|) (<= 75 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 75)) (and (<= 92 |ULTIMATE.start_main_~main__y~0#1|) (< |ULTIMATE.start_main_~main__x~0#1| 93) (<= 92 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 92)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 90) (< |ULTIMATE.start_main_~main__x~0#1| 91) (<= 90 |ULTIMATE.start_main_~main__y~0#1|) (<= 90 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= 79 |ULTIMATE.start_main_~main__x~0#1|) (<= 79 |ULTIMATE.start_main_~main__y~0#1|) (< |ULTIMATE.start_main_~main__x~0#1| 80) (<= |ULTIMATE.start_main_~main__y~0#1| 79)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 68) (<= 68 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 68) (<= 68 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= 77 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 77) (< |ULTIMATE.start_main_~main__x~0#1| 78) (<= 77 |ULTIMATE.start_main_~main__y~0#1|)) (and (<= 83 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 83) (<= 83 |ULTIMATE.start_main_~main__x~0#1|) (< |ULTIMATE.start_main_~main__x~0#1| 84)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 76) (<= 76 |ULTIMATE.start_main_~main__x~0#1|) (<= 76 |ULTIMATE.start_main_~main__y~0#1|) (< |ULTIMATE.start_main_~main__x~0#1| 77)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 81) (< |ULTIMATE.start_main_~main__x~0#1| 82) (<= 81 |ULTIMATE.start_main_~main__x~0#1|) (<= 81 |ULTIMATE.start_main_~main__y~0#1|)) (and (< |ULTIMATE.start_main_~main__x~0#1| 71) (<= 70 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 70) (<= 70 |ULTIMATE.start_main_~main__y~0#1|)) (and (< |ULTIMATE.start_main_~main__x~0#1| 96) (<= 95 |ULTIMATE.start_main_~main__x~0#1|) (<= 95 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 95)) (and (< |ULTIMATE.start_main_~main__x~0#1| 83) (<= |ULTIMATE.start_main_~main__y~0#1| 82) (<= 82 |ULTIMATE.start_main_~main__y~0#1|) (<= 82 |ULTIMATE.start_main_~main__x~0#1|)) (and (< |ULTIMATE.start_main_~main__x~0#1| 86) (<= 85 |ULTIMATE.start_main_~main__y~0#1|) (<= 85 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 85)) (and (< |ULTIMATE.start_main_~main__x~0#1| 70) (<= 69 |ULTIMATE.start_main_~main__y~0#1|) (<= 69 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 69)) (and (<= 67 |ULTIMATE.start_main_~main__y~0#1|) (<= 67 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 67) (<= |ULTIMATE.start_main_~main__y~0#1| 67)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 89) (<= 89 |ULTIMATE.start_main_~main__y~0#1|) (<= 89 |ULTIMATE.start_main_~main__x~0#1|) (< |ULTIMATE.start_main_~main__x~0#1| 90)) (and (< |ULTIMATE.start_main_~main__x~0#1| 88) (<= 87 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 87) (<= 87 |ULTIMATE.start_main_~main__x~0#1|)) (and (< |ULTIMATE.start_main_~main__x~0#1| 99) (<= 98 |ULTIMATE.start_main_~main__x~0#1|) (<= 98 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 98)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 97) (< |ULTIMATE.start_main_~main__x~0#1| 98) (<= 97 |ULTIMATE.start_main_~main__y~0#1|) (<= 97 |ULTIMATE.start_main_~main__x~0#1|)) (and (<= 71 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 71) (<= 71 |ULTIMATE.start_main_~main__y~0#1|) (< |ULTIMATE.start_main_~main__x~0#1| 72)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 74) (<= 74 |ULTIMATE.start_main_~main__x~0#1|) (<= 74 |ULTIMATE.start_main_~main__y~0#1|) (< |ULTIMATE.start_main_~main__x~0#1| 75)) (and (<= |ULTIMATE.start_main_~main__y~0#1| 93) (< |ULTIMATE.start_main_~main__x~0#1| 94) (<= 93 |ULTIMATE.start_main_~main__x~0#1|) (<= 93 |ULTIMATE.start_main_~main__y~0#1|))) [2022-07-13 15:39:09,379 INFO L899 garLoopResultBuilder]: For program point L361(lines 361 568) no Hoare annotation was computed. [2022-07-13 15:39:09,379 INFO L899 garLoopResultBuilder]: For program point L295(lines 295 700) no Hoare annotation was computed. [2022-07-13 15:39:09,379 INFO L899 garLoopResultBuilder]: For program point L229(lines 229 832) no Hoare annotation was computed. [2022-07-13 15:39:09,379 INFO L899 garLoopResultBuilder]: For program point L163(lines 163 964) no Hoare annotation was computed. [2022-07-13 15:39:09,380 INFO L899 garLoopResultBuilder]: For program point L97(lines 97 1096) no Hoare annotation was computed. [2022-07-13 15:39:09,380 INFO L899 garLoopResultBuilder]: For program point L31(lines 31 1228) no Hoare annotation was computed. [2022-07-13 15:39:09,380 INFO L895 garLoopResultBuilder]: At program point L1155(lines 67 1156) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__x~0#1| 9) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 9 |ULTIMATE.start_main_~main__x~0#1|) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-07-13 15:39:09,380 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-13 15:39:09,380 INFO L895 garLoopResultBuilder]: At program point L1023(lines 133 1024) the Hoare annotation is: (and (<= 20 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= |ULTIMATE.start_main_~main__x~0#1| 20) (<= 50 |ULTIMATE.start_main_~main__y~0#1|)) [2022-07-13 15:39:09,380 INFO L895 garLoopResultBuilder]: At program point L891(lines 199 892) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 31) (<= 31 |ULTIMATE.start_main_~main__x~0#1|)) [2022-07-13 15:39:09,380 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 444) no Hoare annotation was computed. [2022-07-13 15:39:09,381 INFO L895 garLoopResultBuilder]: At program point L759(lines 265 760) the Hoare annotation is: (and (<= 42 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 42)) [2022-07-13 15:39:09,381 INFO L895 garLoopResultBuilder]: At program point L627(lines 331 628) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__y~0#1| 53) (<= 53 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 53) (<= 53 |ULTIMATE.start_main_~main__y~0#1|)) [2022-07-13 15:39:09,381 INFO L895 garLoopResultBuilder]: At program point L495(lines 397 496) the Hoare annotation is: (and (<= 64 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 64) (<= 64 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 64)) [2022-07-13 15:39:09,381 INFO L899 garLoopResultBuilder]: For program point L397(lines 397 496) no Hoare annotation was computed. [2022-07-13 15:39:09,381 INFO L899 garLoopResultBuilder]: For program point L331(lines 331 628) no Hoare annotation was computed. [2022-07-13 15:39:09,381 INFO L899 garLoopResultBuilder]: For program point L265(lines 265 760) no Hoare annotation was computed. [2022-07-13 15:39:09,381 INFO L902 garLoopResultBuilder]: At program point L1256(lines 13 1258) the Hoare annotation is: true [2022-07-13 15:39:09,382 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 892) no Hoare annotation was computed. [2022-07-13 15:39:09,382 INFO L899 garLoopResultBuilder]: For program point L133(lines 133 1024) no Hoare annotation was computed. [2022-07-13 15:39:09,382 INFO L899 garLoopResultBuilder]: For program point L67(lines 67 1156) no Hoare annotation was computed. [2022-07-13 15:39:09,382 INFO L895 garLoopResultBuilder]: At program point L1191(lines 49 1192) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 6) (<= 6 |ULTIMATE.start_main_~main__x~0#1|)) [2022-07-13 15:39:09,382 INFO L895 garLoopResultBuilder]: At program point L1059(lines 115 1060) the Hoare annotation is: (and (<= 17 |ULTIMATE.start_main_~main__x~0#1|) (<= |ULTIMATE.start_main_~main__y~0#1| 50) (<= 50 |ULTIMATE.start_main_~main__y~0#1|) (<= |ULTIMATE.start_main_~main__x~0#1| 17)) [2022-07-13 15:39:09,385 INFO L356 BasicCegarLoop]: Path program histogram: [3, 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 15:39:09,387 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 15:39:09,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 03:39:09 BoogieIcfgContainer [2022-07-13 15:39:09,419 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 15:39:09,419 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 15:39:09,420 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 15:39:09,420 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 15:39:09,420 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:38:40" (3/4) ... [2022-07-13 15:39:09,422 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-13 15:39:09,436 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-07-13 15:39:09,437 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-13 15:39:09,437 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-13 15:39:09,438 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-13 15:39:09,505 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 15:39:09,505 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 15:39:09,506 INFO L158 Benchmark]: Toolchain (without parser) took 30153.42ms. Allocated memory was 88.1MB in the beginning and 167.8MB in the end (delta: 79.7MB). Free memory was 45.4MB in the beginning and 77.1MB in the end (delta: -31.7MB). Peak memory consumption was 47.4MB. Max. memory is 16.1GB. [2022-07-13 15:39:09,506 INFO L158 Benchmark]: CDTParser took 1.05ms. Allocated memory is still 88.1MB. Free memory is still 62.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 15:39:09,506 INFO L158 Benchmark]: CACSL2BoogieTranslator took 500.96ms. Allocated memory was 88.1MB in the beginning and 115.3MB in the end (delta: 27.3MB). Free memory was 45.2MB in the beginning and 76.2MB in the end (delta: -31.0MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. [2022-07-13 15:39:09,507 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.33ms. Allocated memory is still 115.3MB. Free memory was 76.2MB in the beginning and 73.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 15:39:09,507 INFO L158 Benchmark]: Boogie Preprocessor took 56.15ms. Allocated memory is still 115.3MB. Free memory was 73.3MB in the beginning and 71.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 15:39:09,507 INFO L158 Benchmark]: RCFGBuilder took 704.03ms. Allocated memory is still 115.3MB. Free memory was 71.2MB in the beginning and 76.2MB in the end (delta: -4.9MB). Peak memory consumption was 33.7MB. Max. memory is 16.1GB. [2022-07-13 15:39:09,507 INFO L158 Benchmark]: TraceAbstraction took 28733.78ms. Allocated memory was 115.3MB in the beginning and 167.8MB in the end (delta: 52.4MB). Free memory was 75.4MB in the beginning and 85.4MB in the end (delta: -10.1MB). Peak memory consumption was 86.9MB. Max. memory is 16.1GB. [2022-07-13 15:39:09,508 INFO L158 Benchmark]: Witness Printer took 86.04ms. Allocated memory is still 167.8MB. Free memory was 85.4MB in the beginning and 77.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 15:39:09,509 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.05ms. Allocated memory is still 88.1MB. Free memory is still 62.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 500.96ms. Allocated memory was 88.1MB in the beginning and 115.3MB in the end (delta: 27.3MB). Free memory was 45.2MB in the beginning and 76.2MB in the end (delta: -31.0MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.33ms. Allocated memory is still 115.3MB. Free memory was 76.2MB in the beginning and 73.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.15ms. Allocated memory is still 115.3MB. Free memory was 73.3MB in the beginning and 71.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 704.03ms. Allocated memory is still 115.3MB. Free memory was 71.2MB in the beginning and 76.2MB in the end (delta: -4.9MB). Peak memory consumption was 33.7MB. Max. memory is 16.1GB. * TraceAbstraction took 28733.78ms. Allocated memory was 115.3MB in the beginning and 167.8MB in the end (delta: 52.4MB). Free memory was 75.4MB in the beginning and 85.4MB in the end (delta: -10.1MB). Peak memory consumption was 86.9MB. Max. memory is 16.1GB. * Witness Printer took 86.04ms. Allocated memory is still 167.8MB. Free memory was 85.4MB in the beginning and 77.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 444]: 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, 144 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.7s, OverallIterations: 25, TraceHistogramMax: 34, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 9.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2360 SdHoareTripleChecker+Valid, 8.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2360 mSDsluCounter, 11081 SdHoareTripleChecker+Invalid, 6.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8078 mSDsCounter, 2516 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16439 IncrementalHoareTripleChecker+Invalid, 18955 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2516 mSolverCounterUnsat, 3003 mSDtfsCounter, 16439 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1493 GetRequests, 699 SyntacticMatches, 6 SemanticMatches, 788 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 13.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=273occurred in iteration=2, InterpolantAutomatonStates: 835, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 25 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 68 LocationsWithAnnotation, 68 PreInvPairs, 169 NumberOfFragments, 1299 HoareAnnotationTreeSize, 68 FomulaSimplifications, 305 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 68 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 17.0s InterpolantComputationTime, 3957 NumberOfCodeBlocks, 3957 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 4274 ConstructedInterpolants, 0 QuantifiedInterpolants, 11249 SizeOfPredicates, 2 NumberOfNonLiveVariables, 890 ConjunctsInSsa, 175 ConjunctsInUnsatCore, 29 InterpolantComputations, 23 PerfectInterpolantSequences, 1156/4426 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: 61]: Loop Invariant Derived loop invariant: ((main__x <= 8 && main__y <= 50) && 50 <= main__y) && 8 <= main__x - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && main__x <= 31) && 31 <= main__x - InvariantResult [Line: 247]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && 39 <= main__x) && main__x <= 39 - InvariantResult [Line: 223]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && main__x <= 35) && 35 <= main__x - InvariantResult [Line: 241]: Loop Invariant Derived loop invariant: ((38 <= main__x && main__x <= 38) && main__y <= 50) && 50 <= main__y - InvariantResult [Line: 337]: Loop Invariant Derived loop invariant: ((main__y <= 54 && main__x <= 54) && 54 <= main__y) && 54 <= main__x - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 16 <= main__x) && main__x <= 16) && 50 <= main__y - InvariantResult [Line: 415]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((78 <= main__x && main__y <= 78) && 78 <= main__y) && main__x < 79) || (((91 <= main__x && 91 <= main__y) && main__y <= 91) && main__x < 92)) || (((84 <= main__y && 84 <= main__x) && main__y <= 84) && main__x < 85)) || (((80 <= main__x && main__x < 81) && main__y <= 80) && 80 <= main__y)) || (((99 <= main__y && 99 <= main__x) && main__y <= 99) && main__x < 100)) || (((88 <= main__x && main__x < 89) && 88 <= main__y) && main__y <= 88)) || (((73 <= main__y && main__x < 74) && main__y <= 73) && 73 <= main__x)) || (((86 <= main__x && main__x < 87) && 86 <= main__y) && main__y <= 86)) || (((94 <= main__y && main__y <= 94) && 94 <= main__x) && main__x < 95)) || ((99 < main__y && main__y <= 100) && 100 <= main__x)) || (((72 <= main__y && 72 <= main__x) && main__y <= 72) && main__x < 73)) || (((main__x < 97 && main__y <= 96) && 96 <= main__y) && 96 <= main__x)) || (((main__x < 76 && 75 <= main__x) && 75 <= main__y) && main__y <= 75)) || (((92 <= main__y && main__x < 93) && 92 <= main__x) && main__y <= 92)) || (((main__y <= 90 && main__x < 91) && 90 <= main__y) && 90 <= main__x)) || (((79 <= main__x && 79 <= main__y) && main__x < 80) && main__y <= 79)) || (((main__y <= 68 && 68 <= main__y) && main__x <= 68) && 68 <= main__x)) || (((77 <= main__x && main__y <= 77) && main__x < 78) && 77 <= main__y)) || (((83 <= main__y && main__y <= 83) && 83 <= main__x) && main__x < 84)) || (((main__y <= 76 && 76 <= main__x) && 76 <= main__y) && main__x < 77)) || (((main__y <= 81 && main__x < 82) && 81 <= main__x) && 81 <= main__y)) || (((main__x < 71 && 70 <= main__x) && main__y <= 70) && 70 <= main__y)) || (((main__x < 96 && 95 <= main__x) && 95 <= main__y) && main__y <= 95)) || (((main__x < 83 && main__y <= 82) && 82 <= main__y) && 82 <= main__x)) || (((main__x < 86 && 85 <= main__y) && 85 <= main__x) && main__y <= 85)) || (((main__x < 70 && 69 <= main__y) && 69 <= main__x) && main__y <= 69)) || (((67 <= main__y && 67 <= main__x) && main__x <= 67) && main__y <= 67)) || (((main__y <= 89 && 89 <= main__y) && 89 <= main__x) && main__x < 90)) || (((main__x < 88 && 87 <= main__y) && main__y <= 87) && 87 <= main__x)) || (((main__x < 99 && 98 <= main__x) && 98 <= main__y) && main__y <= 98)) || (((main__y <= 97 && main__x < 98) && 97 <= main__y) && 97 <= main__x)) || (((71 <= main__x && main__y <= 71) && 71 <= main__y) && main__x < 72)) || (((main__y <= 74 && 74 <= main__x) && 74 <= main__y) && main__x < 75)) || (((main__y <= 93 && main__x < 94) && 93 <= main__x) && 93 <= main__y) - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: ((main__y <= 50 && main__x <= 4) && 50 <= main__y) && 4 <= main__x - InvariantResult [Line: 253]: Loop Invariant Derived loop invariant: ((main__x <= 40 && main__y <= 50) && 40 <= main__x) && 50 <= main__y - InvariantResult [Line: 355]: Loop Invariant Derived loop invariant: ((main__x <= 57 && main__y <= 57) && 57 <= main__x) && 57 <= main__y - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: ((43 <= main__x && main__y <= 50) && 50 <= main__y) && main__x <= 43 - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && main__x <= 13) && 13 <= main__x - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: ((main__y <= 50 && main__x <= 28) && 28 <= main__x) && 50 <= main__y - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: ((34 <= main__x && main__y <= 50) && 50 <= main__y) && main__x <= 34 - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 10 <= main__x) && main__x <= 10) && 50 <= main__y - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && main__x <= 21) && 21 <= main__x - InvariantResult [Line: 313]: Loop Invariant Derived loop invariant: ((main__x <= 50 && main__y <= 50) && 50 <= main__x) && 50 <= main__y - InvariantResult [Line: 385]: Loop Invariant Derived loop invariant: ((main__y <= 62 && 62 <= main__y) && 62 <= main__x) && main__x <= 62 - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: ((main__x <= 5 && 5 <= main__x) && main__y <= 50) && 50 <= main__y - InvariantResult [Line: 205]: Loop Invariant Derived loop invariant: ((32 <= main__x && main__y <= 50) && 50 <= main__y) && main__x <= 32 - InvariantResult [Line: 391]: Loop Invariant Derived loop invariant: ((63 <= main__y && 63 <= main__x) && main__x <= 63) && main__y <= 63 - InvariantResult [Line: 67]: Loop Invariant Derived loop invariant: ((main__x <= 9 && main__y <= 50) && 9 <= main__x) && 50 <= main__y - InvariantResult [Line: 397]: Loop Invariant Derived loop invariant: ((64 <= main__x && main__y <= 64) && 64 <= main__y) && main__x <= 64 - InvariantResult [Line: 229]: Loop Invariant Derived loop invariant: ((main__y <= 50 && main__x <= 36) && 50 <= main__y) && 36 <= main__x - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 15 <= main__x) && 50 <= main__y) && main__x <= 15 - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: ((29 <= main__x && main__y <= 50) && 50 <= main__y) && main__x <= 29 - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: ((main__x <= 12 && main__y <= 50) && 50 <= main__y) && 12 <= main__x - InvariantResult [Line: 409]: Loop Invariant Derived loop invariant: ((main__x <= 66 && main__y <= 66) && 66 <= main__y) && 66 <= main__x - InvariantResult [Line: 151]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && 23 <= main__x) && main__x <= 23 - InvariantResult [Line: 133]: Loop Invariant Derived loop invariant: ((20 <= main__x && main__y <= 50) && main__x <= 20) && 50 <= main__y - InvariantResult [Line: 259]: Loop Invariant Derived loop invariant: ((41 <= main__x && main__x <= 41) && main__y <= 50) && 50 <= main__y - InvariantResult [Line: 163]: Loop Invariant Derived loop invariant: ((25 <= main__x && main__x <= 25) && main__y <= 50) && 50 <= main__y - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: ((main__y <= 50 && main__x <= 30) && 50 <= main__y) && 30 <= main__x - InvariantResult [Line: 169]: Loop Invariant Derived loop invariant: ((main__y <= 50 && main__x <= 26) && 50 <= main__y) && 26 <= main__x - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: ((65 <= main__y && 65 <= main__x) && main__y <= 65) && main__x <= 65 - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: ((42 <= main__x && main__y <= 50) && 50 <= main__y) && main__x <= 42 - InvariantResult [Line: 325]: Loop Invariant Derived loop invariant: ((main__x <= 52 && 52 <= main__y) && main__y <= 52) && 52 <= main__x - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: ((main__x <= 19 && main__y <= 50) && 50 <= main__y) && 19 <= main__x - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 379]: Loop Invariant Derived loop invariant: ((61 <= main__y && main__x <= 61) && 61 <= main__x) && main__y <= 61 - InvariantResult [Line: 211]: Loop Invariant Derived loop invariant: ((33 <= main__x && main__x <= 33) && main__y <= 50) && 50 <= main__y - InvariantResult [Line: 289]: Loop Invariant Derived loop invariant: ((main__x <= 46 && main__y <= 50) && 46 <= main__x) && 50 <= main__y - InvariantResult [Line: 295]: Loop Invariant Derived loop invariant: ((47 <= main__x && main__x <= 47) && main__y <= 50) && 50 <= main__y - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 24 <= main__x) && main__x <= 24) && 50 <= main__y - InvariantResult [Line: 349]: Loop Invariant Derived loop invariant: ((56 <= main__x && main__x <= 56) && 56 <= main__y) && main__y <= 56 - InvariantResult [Line: 361]: Loop Invariant Derived loop invariant: ((main__x <= 58 && main__y <= 58) && 58 <= main__x) && 58 <= main__y - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((7 <= main__x && main__y <= 50) && 50 <= main__y) && main__x <= 7 - InvariantResult [Line: 373]: Loop Invariant Derived loop invariant: ((main__x <= 60 && 60 <= main__y) && main__y <= 60) && 60 <= main__x - InvariantResult [Line: 235]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 37 <= main__x) && 50 <= main__y) && main__x <= 37 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: ((main__x <= 2 && main__y <= 50) && 2 <= main__x) && 50 <= main__y - InvariantResult [Line: 319]: Loop Invariant Derived loop invariant: ((51 <= main__y && main__y <= 51) && 51 <= main__x) && main__x <= 51 - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: ((17 <= main__x && main__y <= 50) && 50 <= main__y) && main__x <= 17 - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: ((22 <= main__x && main__y <= 50) && 50 <= main__y) && main__x <= 22 - InvariantResult [Line: 343]: Loop Invariant Derived loop invariant: ((main__y <= 55 && main__x <= 55) && 55 <= main__y) && 55 <= main__x - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && main__x <= 6) && 6 <= main__x - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: ((3 <= main__x && main__y <= 50) && 50 <= main__y) && main__x <= 3 - InvariantResult [Line: 301]: Loop Invariant Derived loop invariant: ((48 <= main__x && main__y <= 50) && 50 <= main__y) && main__x <= 48 - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: ((main__y <= 53 && 53 <= main__x) && main__x <= 53) && 53 <= main__y - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: ((main__x <= 14 && 14 <= main__x) && main__y <= 50) && 50 <= main__y - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: ((main__x <= 44 && 44 <= main__x) && main__y <= 50) && 50 <= main__y - InvariantResult [Line: 367]: Loop Invariant Derived loop invariant: ((main__x <= 59 && 59 <= main__y) && main__y <= 59) && 59 <= main__x - InvariantResult [Line: 79]: Loop Invariant Derived loop invariant: ((main__x <= 11 && 11 <= main__x) && main__y <= 50) && 50 <= main__y - InvariantResult [Line: 283]: Loop Invariant Derived loop invariant: ((main__x <= 45 && main__y <= 50) && 45 <= main__x) && 50 <= main__y - InvariantResult [Line: 121]: Loop Invariant Derived loop invariant: ((main__y <= 50 && main__x <= 18) && 50 <= main__y) && 18 <= main__x - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: ((1 <= main__x && main__y <= 50) && 50 <= main__y) && main__x <= 1 - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: ((main__y <= 50 && 50 <= main__y) && main__x <= 49) && 49 <= main__x - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: ((main__x <= 27 && main__y <= 50) && 50 <= main__y) && 27 <= main__x RESULT: Ultimate proved your program to be correct! [2022-07-13 15:39:09,576 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