./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl/s3_srvr.blast.14.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/openssl/s3_srvr.blast.14.i.cil-2.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 adf973339365dcd50ea4c1729cfdba4f7375ef39da53eb99572e95c3bcdc3498 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-11 23:55:37,183 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 23:55:37,184 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 23:55:37,218 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 23:55:37,218 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 23:55:37,220 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 23:55:37,225 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 23:55:37,231 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 23:55:37,233 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 23:55:37,239 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 23:55:37,240 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 23:55:37,242 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 23:55:37,243 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 23:55:37,244 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 23:55:37,246 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 23:55:37,247 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 23:55:37,248 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 23:55:37,250 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 23:55:37,254 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 23:55:37,256 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 23:55:37,261 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 23:55:37,262 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 23:55:37,263 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 23:55:37,264 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 23:55:37,264 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 23:55:37,267 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 23:55:37,267 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 23:55:37,267 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 23:55:37,268 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 23:55:37,268 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 23:55:37,269 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 23:55:37,269 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 23:55:37,270 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 23:55:37,271 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 23:55:37,272 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 23:55:37,273 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 23:55:37,273 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 23:55:37,274 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 23:55:37,275 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 23:55:37,275 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 23:55:37,276 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 23:55:37,277 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 23:55:37,279 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-11 23:55:37,312 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 23:55:37,313 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 23:55:37,313 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 23:55:37,313 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 23:55:37,314 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 23:55:37,314 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 23:55:37,315 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 23:55:37,315 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 23:55:37,315 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 23:55:37,316 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 23:55:37,316 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 23:55:37,317 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-11 23:55:37,317 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 23:55:37,317 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 23:55:37,317 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 23:55:37,317 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 23:55:37,318 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 23:55:37,318 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 23:55:37,318 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 23:55:37,318 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 23:55:37,318 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 23:55:37,319 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 23:55:37,319 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 23:55:37,319 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 23:55:37,319 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:55:37,320 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 23:55:37,320 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 23:55:37,320 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 23:55:37,320 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-11 23:55:37,320 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-11 23:55:37,321 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 23:55:37,321 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 23:55:37,321 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 23:55:37,321 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 -> adf973339365dcd50ea4c1729cfdba4f7375ef39da53eb99572e95c3bcdc3498 [2022-07-11 23:55:37,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 23:55:37,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 23:55:37,572 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 23:55:37,574 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 23:55:37,574 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 23:55:37,576 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.14.i.cil-2.c [2022-07-11 23:55:37,654 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9cf62785/332d955fded840888add264405defe09/FLAGa92edf8cf [2022-07-11 23:55:38,155 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 23:55:38,156 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.14.i.cil-2.c [2022-07-11 23:55:38,177 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9cf62785/332d955fded840888add264405defe09/FLAGa92edf8cf [2022-07-11 23:55:38,615 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9cf62785/332d955fded840888add264405defe09 [2022-07-11 23:55:38,618 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 23:55:38,619 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 23:55:38,620 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 23:55:38,620 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 23:55:38,623 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 23:55:38,623 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:55:38" (1/1) ... [2022-07-11 23:55:38,624 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60680b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:55:38, skipping insertion in model container [2022-07-11 23:55:38,625 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:55:38" (1/1) ... [2022-07-11 23:55:38,631 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 23:55:38,677 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:55:39,022 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/openssl/s3_srvr.blast.14.i.cil-2.c[76259,76272] [2022-07-11 23:55:39,031 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:55:39,043 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 23:55:39,148 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/openssl/s3_srvr.blast.14.i.cil-2.c[76259,76272] [2022-07-11 23:55:39,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:55:39,170 INFO L208 MainTranslator]: Completed translation [2022-07-11 23:55:39,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:55:39 WrapperNode [2022-07-11 23:55:39,183 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 23:55:39,185 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 23:55:39,185 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 23:55:39,185 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 23:55:39,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:55:39" (1/1) ... [2022-07-11 23:55:39,220 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:55:39" (1/1) ... [2022-07-11 23:55:39,278 INFO L137 Inliner]: procedures = 31, calls = 223, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 803 [2022-07-11 23:55:39,279 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 23:55:39,280 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 23:55:39,280 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 23:55:39,280 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 23:55:39,287 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:55:39" (1/1) ... [2022-07-11 23:55:39,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:55:39" (1/1) ... [2022-07-11 23:55:39,312 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:55:39" (1/1) ... [2022-07-11 23:55:39,315 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:55:39" (1/1) ... [2022-07-11 23:55:39,364 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:55:39" (1/1) ... [2022-07-11 23:55:39,380 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:55:39" (1/1) ... [2022-07-11 23:55:39,383 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:55:39" (1/1) ... [2022-07-11 23:55:39,392 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 23:55:39,393 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 23:55:39,393 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 23:55:39,393 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 23:55:39,398 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:55:39" (1/1) ... [2022-07-11 23:55:39,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:55:39,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:55:39,429 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-11 23:55:39,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-11 23:55:39,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 23:55:39,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-11 23:55:39,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-11 23:55:39,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-11 23:55:39,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-11 23:55:39,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-11 23:55:39,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-11 23:55:39,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 23:55:39,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 23:55:39,665 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 23:55:39,666 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 23:55:39,685 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:55:42,541 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-07-11 23:55:42,542 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-07-11 23:55:42,542 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 23:55:42,549 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 23:55:42,549 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-11 23:55:42,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:55:42 BoogieIcfgContainer [2022-07-11 23:55:42,551 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 23:55:42,553 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 23:55:42,553 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 23:55:42,556 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 23:55:42,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 11:55:38" (1/3) ... [2022-07-11 23:55:42,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32affdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:55:42, skipping insertion in model container [2022-07-11 23:55:42,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:55:39" (2/3) ... [2022-07-11 23:55:42,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32affdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:55:42, skipping insertion in model container [2022-07-11 23:55:42,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:55:42" (3/3) ... [2022-07-11 23:55:42,559 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.14.i.cil-2.c [2022-07-11 23:55:42,573 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 23:55:42,573 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 23:55:42,620 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 23:55:42,626 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@5b6caa9b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@669d33f4 [2022-07-11 23:55:42,627 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 23:55:42,632 INFO L276 IsEmpty]: Start isEmpty. Operand has 155 states, 153 states have (on average 1.7254901960784315) internal successors, (264), 154 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:42,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-11 23:55:42,642 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:55:42,643 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] [2022-07-11 23:55:42,643 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:55:42,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:55:42,648 INFO L85 PathProgramCache]: Analyzing trace with hash 918516044, now seen corresponding path program 1 times [2022-07-11 23:55:42,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:55:42,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007824746] [2022-07-11 23:55:42,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:55:42,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:55:42,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:55:43,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:55:43,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:55:43,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007824746] [2022-07-11 23:55:43,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007824746] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:55:43,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:55:43,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:55:43,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920745760] [2022-07-11 23:55:43,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:55:43,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:55:43,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:55:43,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:55:43,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:55:43,196 INFO L87 Difference]: Start difference. First operand has 155 states, 153 states have (on average 1.7254901960784315) internal successors, (264), 154 states have internal predecessors, (264), 0 states have call successors, (0), 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 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:44,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:55:44,206 INFO L93 Difference]: Finished difference Result 436 states and 746 transitions. [2022-07-11 23:55:44,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:55:44,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2022-07-11 23:55:44,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:55:44,224 INFO L225 Difference]: With dead ends: 436 [2022-07-11 23:55:44,224 INFO L226 Difference]: Without dead ends: 266 [2022-07-11 23:55:44,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:55:44,231 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 166 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-11 23:55:44,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 471 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-11 23:55:44,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-07-11 23:55:44,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 182. [2022-07-11 23:55:44,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 181 states have (on average 1.6187845303867403) internal successors, (293), 181 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-11 23:55:44,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 293 transitions. [2022-07-11 23:55:44,277 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 293 transitions. Word has length 44 [2022-07-11 23:55:44,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:55:44,278 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 293 transitions. [2022-07-11 23:55:44,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:44,278 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 293 transitions. [2022-07-11 23:55:44,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-11 23:55:44,280 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:55:44,280 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] [2022-07-11 23:55:44,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-11 23:55:44,281 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:55:44,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:55:44,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1831970003, now seen corresponding path program 1 times [2022-07-11 23:55:44,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:55:44,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525346576] [2022-07-11 23:55:44,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:55:44,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:55:44,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:55:44,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:55:44,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:55:44,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525346576] [2022-07-11 23:55:44,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525346576] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:55:44,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:55:44,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:55:44,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741585791] [2022-07-11 23:55:44,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:55:44,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:55:44,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:55:44,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:55:44,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:55:44,423 INFO L87 Difference]: Start difference. First operand 182 states and 293 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:45,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:55:45,150 INFO L93 Difference]: Finished difference Result 382 states and 613 transitions. [2022-07-11 23:55:45,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:55:45,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2022-07-11 23:55:45,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:55:45,153 INFO L225 Difference]: With dead ends: 382 [2022-07-11 23:55:45,153 INFO L226 Difference]: Without dead ends: 210 [2022-07-11 23:55:45,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:55:45,155 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 22 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-11 23:55:45,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 499 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-11 23:55:45,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-07-11 23:55:45,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 193. [2022-07-11 23:55:45,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 1.625) internal successors, (312), 192 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:45,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 312 transitions. [2022-07-11 23:55:45,167 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 312 transitions. Word has length 45 [2022-07-11 23:55:45,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:55:45,168 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 312 transitions. [2022-07-11 23:55:45,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:45,168 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 312 transitions. [2022-07-11 23:55:45,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-11 23:55:45,170 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:55:45,170 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:55:45,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-11 23:55:45,171 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:55:45,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:55:45,171 INFO L85 PathProgramCache]: Analyzing trace with hash 2074377750, now seen corresponding path program 1 times [2022-07-11 23:55:45,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:55:45,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854274117] [2022-07-11 23:55:45,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:55:45,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:55:45,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:55:45,401 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:55:45,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:55:45,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854274117] [2022-07-11 23:55:45,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854274117] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:55:45,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:55:45,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:55:45,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134277210] [2022-07-11 23:55:45,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:55:45,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:55:45,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:55:45,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:55:45,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:55:45,406 INFO L87 Difference]: Start difference. First operand 193 states and 312 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:46,557 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:55:46,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:55:46,979 INFO L93 Difference]: Finished difference Result 527 states and 857 transitions. [2022-07-11 23:55:46,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:55:46,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2022-07-11 23:55:46,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:55:46,981 INFO L225 Difference]: With dead ends: 527 [2022-07-11 23:55:46,981 INFO L226 Difference]: Without dead ends: 355 [2022-07-11 23:55:46,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:55:46,984 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 155 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:55:46,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 668 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-11 23:55:46,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-07-11 23:55:46,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 225. [2022-07-11 23:55:46,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 1.6205357142857142) internal successors, (363), 224 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:46,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 363 transitions. [2022-07-11 23:55:46,998 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 363 transitions. Word has length 58 [2022-07-11 23:55:46,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:55:46,999 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 363 transitions. [2022-07-11 23:55:46,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:46,999 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 363 transitions. [2022-07-11 23:55:47,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-11 23:55:47,007 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:55:47,008 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:55:47,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-11 23:55:47,009 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:55:47,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:55:47,009 INFO L85 PathProgramCache]: Analyzing trace with hash -634430425, now seen corresponding path program 1 times [2022-07-11 23:55:47,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:55:47,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554927242] [2022-07-11 23:55:47,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:55:47,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:55:47,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:55:47,163 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:55:47,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:55:47,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554927242] [2022-07-11 23:55:47,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554927242] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:55:47,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:55:47,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:55:47,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535050931] [2022-07-11 23:55:47,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:55:47,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:55:47,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:55:47,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:55:47,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:55:47,173 INFO L87 Difference]: Start difference. First operand 225 states and 363 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:48,862 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:55:49,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:55:49,260 INFO L93 Difference]: Finished difference Result 535 states and 860 transitions. [2022-07-11 23:55:49,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:55:49,260 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2022-07-11 23:55:49,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:55:49,262 INFO L225 Difference]: With dead ends: 535 [2022-07-11 23:55:49,262 INFO L226 Difference]: Without dead ends: 331 [2022-07-11 23:55:49,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:55:49,264 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 160 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:55:49,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 364 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-11 23:55:49,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-07-11 23:55:49,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 225. [2022-07-11 23:55:49,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 1.6026785714285714) internal successors, (359), 224 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:49,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 359 transitions. [2022-07-11 23:55:49,274 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 359 transitions. Word has length 59 [2022-07-11 23:55:49,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:55:49,274 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 359 transitions. [2022-07-11 23:55:49,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:49,274 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 359 transitions. [2022-07-11 23:55:49,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-11 23:55:49,276 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:55:49,276 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:55:49,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-11 23:55:49,277 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:55:49,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:55:49,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1252473019, now seen corresponding path program 1 times [2022-07-11 23:55:49,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:55:49,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864874982] [2022-07-11 23:55:49,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:55:49,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:55:49,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:55:49,395 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:55:49,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:55:49,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864874982] [2022-07-11 23:55:49,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864874982] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:55:49,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:55:49,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:55:49,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162737952] [2022-07-11 23:55:49,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:55:49,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:55:49,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:55:49,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:55:49,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:55:49,398 INFO L87 Difference]: Start difference. First operand 225 states and 359 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:51,405 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:55:51,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:55:51,774 INFO L93 Difference]: Finished difference Result 445 states and 707 transitions. [2022-07-11 23:55:51,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:55:51,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2022-07-11 23:55:51,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:55:51,776 INFO L225 Difference]: With dead ends: 445 [2022-07-11 23:55:51,777 INFO L226 Difference]: Without dead ends: 241 [2022-07-11 23:55:51,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:55:51,778 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 26 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:55:51,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 503 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 146 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-07-11 23:55:51,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-07-11 23:55:51,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 225. [2022-07-11 23:55:51,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 1.5982142857142858) internal successors, (358), 224 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:51,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 358 transitions. [2022-07-11 23:55:51,786 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 358 transitions. Word has length 59 [2022-07-11 23:55:51,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:55:51,787 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 358 transitions. [2022-07-11 23:55:51,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:51,787 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 358 transitions. [2022-07-11 23:55:51,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-11 23:55:51,788 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:55:51,788 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:55:51,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-11 23:55:51,789 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:55:51,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:55:51,789 INFO L85 PathProgramCache]: Analyzing trace with hash 400356242, now seen corresponding path program 1 times [2022-07-11 23:55:51,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:55:51,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664066190] [2022-07-11 23:55:51,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:55:51,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:55:51,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:55:51,900 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:55:51,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:55:51,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664066190] [2022-07-11 23:55:51,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664066190] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:55:51,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:55:51,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:55:51,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483579151] [2022-07-11 23:55:51,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:55:51,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:55:51,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:55:51,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:55:51,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:55:51,902 INFO L87 Difference]: Start difference. First operand 225 states and 358 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:52,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:55:52,646 INFO L93 Difference]: Finished difference Result 444 states and 705 transitions. [2022-07-11 23:55:52,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:55:52,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2022-07-11 23:55:52,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:55:52,648 INFO L225 Difference]: With dead ends: 444 [2022-07-11 23:55:52,648 INFO L226 Difference]: Without dead ends: 240 [2022-07-11 23:55:52,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:55:52,649 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 19 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-11 23:55:52,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 505 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-11 23:55:52,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-07-11 23:55:52,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 225. [2022-07-11 23:55:52,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 1.59375) internal successors, (357), 224 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:52,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 357 transitions. [2022-07-11 23:55:52,656 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 357 transitions. Word has length 59 [2022-07-11 23:55:52,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:55:52,657 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 357 transitions. [2022-07-11 23:55:52,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:52,657 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 357 transitions. [2022-07-11 23:55:52,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-11 23:55:52,658 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:55:52,658 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:55:52,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-11 23:55:52,658 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:55:52,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:55:52,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1602864046, now seen corresponding path program 1 times [2022-07-11 23:55:52,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:55:52,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538834219] [2022-07-11 23:55:52,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:55:52,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:55:52,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:55:52,781 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:55:52,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:55:52,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538834219] [2022-07-11 23:55:52,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538834219] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:55:52,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:55:52,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:55:52,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981220508] [2022-07-11 23:55:52,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:55:52,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:55:52,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:55:52,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:55:52,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:55:52,784 INFO L87 Difference]: Start difference. First operand 225 states and 357 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:53,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:55:53,965 INFO L93 Difference]: Finished difference Result 535 states and 851 transitions. [2022-07-11 23:55:53,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:55:53,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2022-07-11 23:55:53,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:55:53,968 INFO L225 Difference]: With dead ends: 535 [2022-07-11 23:55:53,968 INFO L226 Difference]: Without dead ends: 331 [2022-07-11 23:55:53,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:55:53,969 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 153 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:55:53,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 364 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-11 23:55:53,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-07-11 23:55:53,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 226. [2022-07-11 23:55:53,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 225 states have (on average 1.5822222222222222) internal successors, (356), 225 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:53,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 356 transitions. [2022-07-11 23:55:53,976 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 356 transitions. Word has length 59 [2022-07-11 23:55:53,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:55:53,977 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 356 transitions. [2022-07-11 23:55:53,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:53,977 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 356 transitions. [2022-07-11 23:55:53,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-11 23:55:53,978 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:55:53,978 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:55:53,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-11 23:55:53,978 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:55:53,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:55:53,979 INFO L85 PathProgramCache]: Analyzing trace with hash -760317761, now seen corresponding path program 1 times [2022-07-11 23:55:53,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:55:53,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504447363] [2022-07-11 23:55:53,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:55:53,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:55:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:55:54,067 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:55:54,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:55:54,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504447363] [2022-07-11 23:55:54,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504447363] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:55:54,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:55:54,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:55:54,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929540039] [2022-07-11 23:55:54,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:55:54,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:55:54,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:55:54,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:55:54,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:55:54,070 INFO L87 Difference]: Start difference. First operand 226 states and 356 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:54,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:55:54,858 INFO L93 Difference]: Finished difference Result 444 states and 701 transitions. [2022-07-11 23:55:54,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:55:54,858 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2022-07-11 23:55:54,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:55:54,860 INFO L225 Difference]: With dead ends: 444 [2022-07-11 23:55:54,860 INFO L226 Difference]: Without dead ends: 239 [2022-07-11 23:55:54,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:55:54,861 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 22 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-11 23:55:54,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 509 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-11 23:55:54,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-07-11 23:55:54,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 226. [2022-07-11 23:55:54,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 225 states have (on average 1.5777777777777777) internal successors, (355), 225 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:54,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 355 transitions. [2022-07-11 23:55:54,871 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 355 transitions. Word has length 60 [2022-07-11 23:55:54,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:55:54,871 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 355 transitions. [2022-07-11 23:55:54,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:54,871 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 355 transitions. [2022-07-11 23:55:54,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-11 23:55:54,872 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:55:54,872 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:55:54,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-11 23:55:54,873 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:55:54,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:55:54,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1762527104, now seen corresponding path program 1 times [2022-07-11 23:55:54,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:55:54,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232497834] [2022-07-11 23:55:54,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:55:54,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:55:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:55:54,980 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:55:54,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:55:54,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232497834] [2022-07-11 23:55:54,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232497834] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:55:54,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:55:54,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:55:54,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575666571] [2022-07-11 23:55:54,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:55:54,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:55:54,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:55:54,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:55:54,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:55:54,983 INFO L87 Difference]: Start difference. First operand 226 states and 355 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:55,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:55:55,728 INFO L93 Difference]: Finished difference Result 444 states and 700 transitions. [2022-07-11 23:55:55,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:55:55,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2022-07-11 23:55:55,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:55:55,730 INFO L225 Difference]: With dead ends: 444 [2022-07-11 23:55:55,730 INFO L226 Difference]: Without dead ends: 239 [2022-07-11 23:55:55,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:55:55,731 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 20 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-11 23:55:55,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 509 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-11 23:55:55,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-07-11 23:55:55,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 226. [2022-07-11 23:55:55,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 225 states have (on average 1.5733333333333333) internal successors, (354), 225 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:55,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 354 transitions. [2022-07-11 23:55:55,737 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 354 transitions. Word has length 61 [2022-07-11 23:55:55,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:55:55,737 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 354 transitions. [2022-07-11 23:55:55,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:55,738 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 354 transitions. [2022-07-11 23:55:55,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-11 23:55:55,738 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:55:55,739 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:55:55,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-11 23:55:55,739 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:55:55,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:55:55,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1501482972, now seen corresponding path program 1 times [2022-07-11 23:55:55,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:55:55,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083876086] [2022-07-11 23:55:55,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:55:55,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:55:55,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:55:55,847 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:55:55,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:55:55,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083876086] [2022-07-11 23:55:55,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083876086] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:55:55,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:55:55,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:55:55,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507094890] [2022-07-11 23:55:55,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:55:55,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:55:55,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:55:55,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:55:55,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:55:55,850 INFO L87 Difference]: Start difference. First operand 226 states and 354 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:57,119 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:55:57,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:55:57,337 INFO L93 Difference]: Finished difference Result 434 states and 686 transitions. [2022-07-11 23:55:57,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:55:57,338 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-07-11 23:55:57,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:55:57,339 INFO L225 Difference]: With dead ends: 434 [2022-07-11 23:55:57,340 INFO L226 Difference]: Without dead ends: 229 [2022-07-11 23:55:57,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:55:57,341 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 11 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:55:57,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 523 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-11 23:55:57,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-07-11 23:55:57,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2022-07-11 23:55:57,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 225 states have (on average 1.568888888888889) internal successors, (353), 225 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:57,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 353 transitions. [2022-07-11 23:55:57,346 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 353 transitions. Word has length 62 [2022-07-11 23:55:57,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:55:57,347 INFO L495 AbstractCegarLoop]: Abstraction has 226 states and 353 transitions. [2022-07-11 23:55:57,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:57,351 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 353 transitions. [2022-07-11 23:55:57,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-11 23:55:57,352 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:55:57,352 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:55:57,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-11 23:55:57,353 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:55:57,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:55:57,354 INFO L85 PathProgramCache]: Analyzing trace with hash -2113356404, now seen corresponding path program 1 times [2022-07-11 23:55:57,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:55:57,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536808327] [2022-07-11 23:55:57,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:55:57,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:55:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:55:57,462 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:55:57,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:55:57,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536808327] [2022-07-11 23:55:57,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536808327] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:55:57,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:55:57,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:55:57,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458213266] [2022-07-11 23:55:57,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:55:57,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:55:57,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:55:57,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:55:57,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:55:57,465 INFO L87 Difference]: Start difference. First operand 226 states and 353 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:59,300 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:55:59,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:55:59,516 INFO L93 Difference]: Finished difference Result 471 states and 741 transitions. [2022-07-11 23:55:59,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:55:59,517 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2022-07-11 23:55:59,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:55:59,518 INFO L225 Difference]: With dead ends: 471 [2022-07-11 23:55:59,518 INFO L226 Difference]: Without dead ends: 266 [2022-07-11 23:55:59,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:55:59,519 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 31 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:55:59,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 527 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-11 23:55:59,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-07-11 23:55:59,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 248. [2022-07-11 23:55:59,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 247 states have (on average 1.5708502024291497) internal successors, (388), 247 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:59,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 388 transitions. [2022-07-11 23:55:59,526 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 388 transitions. Word has length 62 [2022-07-11 23:55:59,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:55:59,526 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 388 transitions. [2022-07-11 23:55:59,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:59,526 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 388 transitions. [2022-07-11 23:55:59,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-11 23:55:59,527 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:55:59,528 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:55:59,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-11 23:55:59,528 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:55:59,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:55:59,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1668974810, now seen corresponding path program 1 times [2022-07-11 23:55:59,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:55:59,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860563342] [2022-07-11 23:55:59,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:55:59,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:55:59,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:55:59,622 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:55:59,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:55:59,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860563342] [2022-07-11 23:55:59,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860563342] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:55:59,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:55:59,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:55:59,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884424382] [2022-07-11 23:55:59,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:55:59,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:55:59,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:55:59,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:55:59,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:55:59,625 INFO L87 Difference]: Start difference. First operand 248 states and 388 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:01,605 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:56:01,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:01,946 INFO L93 Difference]: Finished difference Result 580 states and 915 transitions. [2022-07-11 23:56:01,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:01,947 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-07-11 23:56:01,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:01,949 INFO L225 Difference]: With dead ends: 580 [2022-07-11 23:56:01,949 INFO L226 Difference]: Without dead ends: 353 [2022-07-11 23:56:01,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:01,950 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 158 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:01,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 364 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-11 23:56:01,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-07-11 23:56:01,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 248. [2022-07-11 23:56:01,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 247 states have (on average 1.5546558704453441) internal successors, (384), 247 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:01,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 384 transitions. [2022-07-11 23:56:01,961 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 384 transitions. Word has length 76 [2022-07-11 23:56:01,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:01,961 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 384 transitions. [2022-07-11 23:56:01,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:01,962 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 384 transitions. [2022-07-11 23:56:01,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-11 23:56:01,962 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:01,963 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:01,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-11 23:56:01,963 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:01,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:01,963 INFO L85 PathProgramCache]: Analyzing trace with hash 816858033, now seen corresponding path program 1 times [2022-07-11 23:56:01,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:01,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353610520] [2022-07-11 23:56:01,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:01,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:02,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:02,093 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:56:02,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:02,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353610520] [2022-07-11 23:56:02,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353610520] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:02,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:02,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:02,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604170021] [2022-07-11 23:56:02,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:02,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:02,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:02,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:02,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:02,096 INFO L87 Difference]: Start difference. First operand 248 states and 384 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:03,799 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:56:04,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:04,013 INFO L93 Difference]: Finished difference Result 492 states and 766 transitions. [2022-07-11 23:56:04,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:04,013 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2022-07-11 23:56:04,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:04,014 INFO L225 Difference]: With dead ends: 492 [2022-07-11 23:56:04,015 INFO L226 Difference]: Without dead ends: 265 [2022-07-11 23:56:04,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:04,016 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 33 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:04,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 529 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-11 23:56:04,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-07-11 23:56:04,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 248. [2022-07-11 23:56:04,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 247 states have (on average 1.5506072874493928) internal successors, (383), 247 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:04,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 383 transitions. [2022-07-11 23:56:04,022 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 383 transitions. Word has length 76 [2022-07-11 23:56:04,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:04,023 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 383 transitions. [2022-07-11 23:56:04,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:04,023 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 383 transitions. [2022-07-11 23:56:04,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-11 23:56:04,024 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:04,024 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:04,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-11 23:56:04,025 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:04,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:04,025 INFO L85 PathProgramCache]: Analyzing trace with hash -733664128, now seen corresponding path program 1 times [2022-07-11 23:56:04,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:04,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484333413] [2022-07-11 23:56:04,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:04,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:04,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:04,124 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:56:04,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:04,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484333413] [2022-07-11 23:56:04,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484333413] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:04,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:04,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:04,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677175157] [2022-07-11 23:56:04,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:04,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:04,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:04,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:04,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:04,127 INFO L87 Difference]: Start difference. First operand 248 states and 383 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:06,133 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:56:06,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:06,468 INFO L93 Difference]: Finished difference Result 580 states and 905 transitions. [2022-07-11 23:56:06,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:06,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-07-11 23:56:06,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:06,470 INFO L225 Difference]: With dead ends: 580 [2022-07-11 23:56:06,470 INFO L226 Difference]: Without dead ends: 353 [2022-07-11 23:56:06,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:06,471 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 156 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:06,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 364 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 259 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-11 23:56:06,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-07-11 23:56:06,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 248. [2022-07-11 23:56:06,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 247 states have (on average 1.534412955465587) internal successors, (379), 247 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:06,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 379 transitions. [2022-07-11 23:56:06,478 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 379 transitions. Word has length 77 [2022-07-11 23:56:06,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:06,478 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 379 transitions. [2022-07-11 23:56:06,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:06,479 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 379 transitions. [2022-07-11 23:56:06,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-11 23:56:06,480 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:06,480 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:06,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-11 23:56:06,480 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:06,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:06,481 INFO L85 PathProgramCache]: Analyzing trace with hash -936264481, now seen corresponding path program 1 times [2022-07-11 23:56:06,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:06,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397798984] [2022-07-11 23:56:06,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:06,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:06,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:06,582 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:56:06,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:06,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397798984] [2022-07-11 23:56:06,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397798984] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:06,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:06,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:06,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270586758] [2022-07-11 23:56:06,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:06,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:06,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:06,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:06,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:06,585 INFO L87 Difference]: Start difference. First operand 248 states and 379 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:07,938 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:56:08,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:08,289 INFO L93 Difference]: Finished difference Result 580 states and 897 transitions. [2022-07-11 23:56:08,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:08,290 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2022-07-11 23:56:08,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:08,291 INFO L225 Difference]: With dead ends: 580 [2022-07-11 23:56:08,291 INFO L226 Difference]: Without dead ends: 353 [2022-07-11 23:56:08,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:08,292 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 154 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:08,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 364 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-11 23:56:08,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-07-11 23:56:08,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 248. [2022-07-11 23:56:08,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 247 states have (on average 1.5182186234817814) internal successors, (375), 247 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:08,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 375 transitions. [2022-07-11 23:56:08,300 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 375 transitions. Word has length 78 [2022-07-11 23:56:08,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:08,300 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 375 transitions. [2022-07-11 23:56:08,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:08,300 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 375 transitions. [2022-07-11 23:56:08,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-11 23:56:08,301 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:08,301 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:08,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-11 23:56:08,302 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:08,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:08,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1657145435, now seen corresponding path program 1 times [2022-07-11 23:56:08,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:08,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842083047] [2022-07-11 23:56:08,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:08,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:08,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:08,415 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:56:08,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:08,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842083047] [2022-07-11 23:56:08,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842083047] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:08,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:08,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:08,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193002372] [2022-07-11 23:56:08,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:08,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:08,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:08,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:08,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:08,419 INFO L87 Difference]: Start difference. First operand 248 states and 375 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:10,103 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:56:10,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:10,403 INFO L93 Difference]: Finished difference Result 570 states and 876 transitions. [2022-07-11 23:56:10,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:10,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2022-07-11 23:56:10,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:10,405 INFO L225 Difference]: With dead ends: 570 [2022-07-11 23:56:10,405 INFO L226 Difference]: Without dead ends: 343 [2022-07-11 23:56:10,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:10,406 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 145 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:10,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 384 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-11 23:56:10,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-07-11 23:56:10,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 248. [2022-07-11 23:56:10,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 247 states have (on average 1.5020242914979758) internal successors, (371), 247 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:10,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 371 transitions. [2022-07-11 23:56:10,413 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 371 transitions. Word has length 79 [2022-07-11 23:56:10,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:10,413 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 371 transitions. [2022-07-11 23:56:10,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:10,413 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 371 transitions. [2022-07-11 23:56:10,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-11 23:56:10,414 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:10,414 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:10,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-11 23:56:10,414 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:10,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:10,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1994521312, now seen corresponding path program 1 times [2022-07-11 23:56:10,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:10,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662729823] [2022-07-11 23:56:10,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:10,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:10,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:10,517 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-11 23:56:10,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:10,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662729823] [2022-07-11 23:56:10,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662729823] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:10,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:10,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:10,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736626926] [2022-07-11 23:56:10,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:10,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:10,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:10,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:10,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:10,520 INFO L87 Difference]: Start difference. First operand 248 states and 371 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:12,526 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:56:12,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:12,866 INFO L93 Difference]: Finished difference Result 570 states and 868 transitions. [2022-07-11 23:56:12,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:12,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 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 84 [2022-07-11 23:56:12,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:12,868 INFO L225 Difference]: With dead ends: 570 [2022-07-11 23:56:12,868 INFO L226 Difference]: Without dead ends: 343 [2022-07-11 23:56:12,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:12,869 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 119 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 51 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:12,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 402 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 245 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-11 23:56:12,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-07-11 23:56:12,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 271. [2022-07-11 23:56:12,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 270 states have (on average 1.5407407407407407) internal successors, (416), 270 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:12,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 416 transitions. [2022-07-11 23:56:12,876 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 416 transitions. Word has length 84 [2022-07-11 23:56:12,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:12,876 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 416 transitions. [2022-07-11 23:56:12,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:12,876 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 416 transitions. [2022-07-11 23:56:12,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-11 23:56:12,877 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:12,878 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:12,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-11 23:56:12,878 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:12,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:12,879 INFO L85 PathProgramCache]: Analyzing trace with hash 374028283, now seen corresponding path program 1 times [2022-07-11 23:56:12,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:12,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140321945] [2022-07-11 23:56:12,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:12,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:12,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:12,983 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-11 23:56:12,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:12,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140321945] [2022-07-11 23:56:12,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140321945] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:12,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:12,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:12,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928071675] [2022-07-11 23:56:12,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:12,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:12,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:12,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:12,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:12,985 INFO L87 Difference]: Start difference. First operand 271 states and 416 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:14,585 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:56:14,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:14,865 INFO L93 Difference]: Finished difference Result 609 states and 942 transitions. [2022-07-11 23:56:14,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:14,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 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 112 [2022-07-11 23:56:14,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:14,867 INFO L225 Difference]: With dead ends: 609 [2022-07-11 23:56:14,867 INFO L226 Difference]: Without dead ends: 359 [2022-07-11 23:56:14,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:14,868 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 86 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:14,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 505 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-11 23:56:14,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-07-11 23:56:14,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 305. [2022-07-11 23:56:14,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 304 states have (on average 1.542763157894737) internal successors, (469), 304 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:14,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 469 transitions. [2022-07-11 23:56:14,875 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 469 transitions. Word has length 112 [2022-07-11 23:56:14,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:14,876 INFO L495 AbstractCegarLoop]: Abstraction has 305 states and 469 transitions. [2022-07-11 23:56:14,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:14,876 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 469 transitions. [2022-07-11 23:56:14,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-11 23:56:14,877 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:14,877 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:14,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-11 23:56:14,877 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:14,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:14,878 INFO L85 PathProgramCache]: Analyzing trace with hash -118597891, now seen corresponding path program 1 times [2022-07-11 23:56:14,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:14,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108967823] [2022-07-11 23:56:14,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:14,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:14,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:14,994 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-11 23:56:14,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:14,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108967823] [2022-07-11 23:56:14,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108967823] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:14,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:14,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:14,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028405408] [2022-07-11 23:56:14,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:14,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:14,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:14,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:14,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:14,996 INFO L87 Difference]: Start difference. First operand 305 states and 469 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:17,007 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:56:17,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:17,306 INFO L93 Difference]: Finished difference Result 737 states and 1146 transitions. [2022-07-11 23:56:17,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:17,307 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 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 112 [2022-07-11 23:56:17,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:17,309 INFO L225 Difference]: With dead ends: 737 [2022-07-11 23:56:17,309 INFO L226 Difference]: Without dead ends: 453 [2022-07-11 23:56:17,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:17,310 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 125 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:17,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 394 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 241 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-11 23:56:17,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2022-07-11 23:56:17,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 335. [2022-07-11 23:56:17,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 1.5508982035928143) internal successors, (518), 334 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:17,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 518 transitions. [2022-07-11 23:56:17,319 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 518 transitions. Word has length 112 [2022-07-11 23:56:17,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:17,320 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 518 transitions. [2022-07-11 23:56:17,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:17,320 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 518 transitions. [2022-07-11 23:56:17,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-11 23:56:17,321 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:17,321 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:17,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-11 23:56:17,322 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:17,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:17,322 INFO L85 PathProgramCache]: Analyzing trace with hash -183248622, now seen corresponding path program 1 times [2022-07-11 23:56:17,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:17,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500903492] [2022-07-11 23:56:17,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:17,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:17,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:17,442 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-11 23:56:17,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:17,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500903492] [2022-07-11 23:56:17,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500903492] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:17,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:17,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:17,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360642006] [2022-07-11 23:56:17,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:17,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:17,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:17,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:17,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:17,445 INFO L87 Difference]: Start difference. First operand 335 states and 518 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:18,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:18,018 INFO L93 Difference]: Finished difference Result 761 states and 1181 transitions. [2022-07-11 23:56:18,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:18,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 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 118 [2022-07-11 23:56:18,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:18,020 INFO L225 Difference]: With dead ends: 761 [2022-07-11 23:56:18,020 INFO L226 Difference]: Without dead ends: 447 [2022-07-11 23:56:18,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:18,021 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 121 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:18,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 382 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-11 23:56:18,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2022-07-11 23:56:18,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 372. [2022-07-11 23:56:18,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 371 states have (on average 1.5552560646900269) internal successors, (577), 371 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:18,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 577 transitions. [2022-07-11 23:56:18,030 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 577 transitions. Word has length 118 [2022-07-11 23:56:18,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:18,030 INFO L495 AbstractCegarLoop]: Abstraction has 372 states and 577 transitions. [2022-07-11 23:56:18,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:18,031 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 577 transitions. [2022-07-11 23:56:18,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-11 23:56:18,032 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:18,032 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:18,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-11 23:56:18,033 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:18,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:18,033 INFO L85 PathProgramCache]: Analyzing trace with hash 548980907, now seen corresponding path program 1 times [2022-07-11 23:56:18,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:18,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566727978] [2022-07-11 23:56:18,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:18,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:18,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:18,168 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-11 23:56:18,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:18,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566727978] [2022-07-11 23:56:18,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566727978] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:18,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:18,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:18,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238279146] [2022-07-11 23:56:18,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:18,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:18,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:18,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:18,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:18,172 INFO L87 Difference]: Start difference. First operand 372 states and 577 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:19,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:19,066 INFO L93 Difference]: Finished difference Result 808 states and 1258 transitions. [2022-07-11 23:56:19,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:19,067 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 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 119 [2022-07-11 23:56:19,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:19,068 INFO L225 Difference]: With dead ends: 808 [2022-07-11 23:56:19,069 INFO L226 Difference]: Without dead ends: 457 [2022-07-11 23:56:19,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:19,070 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 75 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:19,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 507 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-11 23:56:19,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2022-07-11 23:56:19,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 412. [2022-07-11 23:56:19,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 1.5571776155717763) internal successors, (640), 411 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:19,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 640 transitions. [2022-07-11 23:56:19,079 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 640 transitions. Word has length 119 [2022-07-11 23:56:19,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:19,079 INFO L495 AbstractCegarLoop]: Abstraction has 412 states and 640 transitions. [2022-07-11 23:56:19,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:19,080 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 640 transitions. [2022-07-11 23:56:19,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-11 23:56:19,081 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:19,081 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:19,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-11 23:56:19,082 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:19,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:19,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1528355991, now seen corresponding path program 1 times [2022-07-11 23:56:19,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:19,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711047423] [2022-07-11 23:56:19,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:19,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:19,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:19,183 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-11 23:56:19,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:19,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711047423] [2022-07-11 23:56:19,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711047423] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:19,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:19,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:19,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606506452] [2022-07-11 23:56:19,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:19,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:19,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:19,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:19,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:19,185 INFO L87 Difference]: Start difference. First operand 412 states and 640 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:19,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:19,722 INFO L93 Difference]: Finished difference Result 840 states and 1309 transitions. [2022-07-11 23:56:19,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:19,723 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2022-07-11 23:56:19,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:19,725 INFO L225 Difference]: With dead ends: 840 [2022-07-11 23:56:19,725 INFO L226 Difference]: Without dead ends: 449 [2022-07-11 23:56:19,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:19,727 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 28 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:19,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 607 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-11 23:56:19,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2022-07-11 23:56:19,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 436. [2022-07-11 23:56:19,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 435 states have (on average 1.5517241379310345) internal successors, (675), 435 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:19,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 675 transitions. [2022-07-11 23:56:19,736 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 675 transitions. Word has length 119 [2022-07-11 23:56:19,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:19,737 INFO L495 AbstractCegarLoop]: Abstraction has 436 states and 675 transitions. [2022-07-11 23:56:19,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:19,737 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 675 transitions. [2022-07-11 23:56:19,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-11 23:56:19,738 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:19,739 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:19,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-11 23:56:19,739 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:19,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:19,740 INFO L85 PathProgramCache]: Analyzing trace with hash -564481906, now seen corresponding path program 1 times [2022-07-11 23:56:19,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:19,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96873417] [2022-07-11 23:56:19,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:19,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:19,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:19,857 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-11 23:56:19,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:19,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96873417] [2022-07-11 23:56:19,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96873417] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:19,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:19,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:19,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515793021] [2022-07-11 23:56:19,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:19,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:19,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:19,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:19,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:19,862 INFO L87 Difference]: Start difference. First operand 436 states and 675 transitions. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:21,413 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:56:21,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:21,725 INFO L93 Difference]: Finished difference Result 889 states and 1379 transitions. [2022-07-11 23:56:21,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:21,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 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 126 [2022-07-11 23:56:21,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:21,727 INFO L225 Difference]: With dead ends: 889 [2022-07-11 23:56:21,727 INFO L226 Difference]: Without dead ends: 474 [2022-07-11 23:56:21,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:21,728 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 61 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:21,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 513 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-11 23:56:21,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-07-11 23:56:21,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 439. [2022-07-11 23:56:21,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 438 states have (on average 1.547945205479452) internal successors, (678), 438 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:21,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 678 transitions. [2022-07-11 23:56:21,737 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 678 transitions. Word has length 126 [2022-07-11 23:56:21,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:21,737 INFO L495 AbstractCegarLoop]: Abstraction has 439 states and 678 transitions. [2022-07-11 23:56:21,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:21,738 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 678 transitions. [2022-07-11 23:56:21,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-11 23:56:21,739 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:21,739 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:21,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-11 23:56:21,740 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:21,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:21,740 INFO L85 PathProgramCache]: Analyzing trace with hash -399938714, now seen corresponding path program 1 times [2022-07-11 23:56:21,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:21,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048524757] [2022-07-11 23:56:21,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:21,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:21,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:21,834 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-11 23:56:21,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:21,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048524757] [2022-07-11 23:56:21,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048524757] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:21,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:21,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:21,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909429487] [2022-07-11 23:56:21,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:21,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:21,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:21,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:21,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:21,837 INFO L87 Difference]: Start difference. First operand 439 states and 678 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:23,494 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:56:23,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:23,753 INFO L93 Difference]: Finished difference Result 891 states and 1380 transitions. [2022-07-11 23:56:23,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:23,753 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 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 133 [2022-07-11 23:56:23,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:23,755 INFO L225 Difference]: With dead ends: 891 [2022-07-11 23:56:23,755 INFO L226 Difference]: Without dead ends: 473 [2022-07-11 23:56:23,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:23,757 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 83 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:23,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 515 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-11 23:56:23,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2022-07-11 23:56:23,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 439. [2022-07-11 23:56:23,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 438 states have (on average 1.5456621004566211) internal successors, (677), 438 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:23,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 677 transitions. [2022-07-11 23:56:23,766 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 677 transitions. Word has length 133 [2022-07-11 23:56:23,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:23,767 INFO L495 AbstractCegarLoop]: Abstraction has 439 states and 677 transitions. [2022-07-11 23:56:23,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:23,767 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 677 transitions. [2022-07-11 23:56:23,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-11 23:56:23,769 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:23,769 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:23,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-11 23:56:23,769 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:23,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:23,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1477124516, now seen corresponding path program 1 times [2022-07-11 23:56:23,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:23,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058488144] [2022-07-11 23:56:23,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:23,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:23,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:23,869 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-11 23:56:23,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:23,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058488144] [2022-07-11 23:56:23,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058488144] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:23,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:23,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:23,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042027610] [2022-07-11 23:56:23,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:23,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:23,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:23,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:23,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:23,872 INFO L87 Difference]: Start difference. First operand 439 states and 677 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:24,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:24,574 INFO L93 Difference]: Finished difference Result 869 states and 1346 transitions. [2022-07-11 23:56:24,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:24,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 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 133 [2022-07-11 23:56:24,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:24,576 INFO L225 Difference]: With dead ends: 869 [2022-07-11 23:56:24,577 INFO L226 Difference]: Without dead ends: 451 [2022-07-11 23:56:24,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:24,578 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 33 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:24,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 607 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-11 23:56:24,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-07-11 23:56:24,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 439. [2022-07-11 23:56:24,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 438 states have (on average 1.54337899543379) internal successors, (676), 438 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:24,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 676 transitions. [2022-07-11 23:56:24,587 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 676 transitions. Word has length 133 [2022-07-11 23:56:24,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:24,587 INFO L495 AbstractCegarLoop]: Abstraction has 439 states and 676 transitions. [2022-07-11 23:56:24,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:24,587 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 676 transitions. [2022-07-11 23:56:24,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-11 23:56:24,589 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:24,589 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:24,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-11 23:56:24,589 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:24,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:24,590 INFO L85 PathProgramCache]: Analyzing trace with hash 653565499, now seen corresponding path program 1 times [2022-07-11 23:56:24,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:24,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419427424] [2022-07-11 23:56:24,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:24,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:24,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:24,709 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-11 23:56:24,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:24,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419427424] [2022-07-11 23:56:24,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419427424] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:24,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:24,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:24,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502128240] [2022-07-11 23:56:24,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:24,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:24,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:24,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:24,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:24,712 INFO L87 Difference]: Start difference. First operand 439 states and 676 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:25,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:25,392 INFO L93 Difference]: Finished difference Result 969 states and 1496 transitions. [2022-07-11 23:56:25,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:25,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 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-11 23:56:25,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:25,395 INFO L225 Difference]: With dead ends: 969 [2022-07-11 23:56:25,395 INFO L226 Difference]: Without dead ends: 551 [2022-07-11 23:56:25,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:25,396 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 128 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:25,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 402 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-11 23:56:25,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2022-07-11 23:56:25,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 469. [2022-07-11 23:56:25,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 468 states have (on average 1.5341880341880343) internal successors, (718), 468 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:25,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 718 transitions. [2022-07-11 23:56:25,406 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 718 transitions. Word has length 139 [2022-07-11 23:56:25,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:25,406 INFO L495 AbstractCegarLoop]: Abstraction has 469 states and 718 transitions. [2022-07-11 23:56:25,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:25,407 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 718 transitions. [2022-07-11 23:56:25,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-11 23:56:25,408 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:25,408 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:25,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-11 23:56:25,409 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:25,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:25,409 INFO L85 PathProgramCache]: Analyzing trace with hash -938161955, now seen corresponding path program 1 times [2022-07-11 23:56:25,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:25,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855113609] [2022-07-11 23:56:25,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:25,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:25,542 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-11 23:56:25,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:25,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855113609] [2022-07-11 23:56:25,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855113609] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:25,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:25,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:25,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632150049] [2022-07-11 23:56:25,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:25,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:25,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:25,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:25,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:25,545 INFO L87 Difference]: Start difference. First operand 469 states and 718 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:26,773 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:56:27,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:27,057 INFO L93 Difference]: Finished difference Result 989 states and 1516 transitions. [2022-07-11 23:56:27,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:27,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 140 [2022-07-11 23:56:27,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:27,059 INFO L225 Difference]: With dead ends: 989 [2022-07-11 23:56:27,059 INFO L226 Difference]: Without dead ends: 541 [2022-07-11 23:56:27,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:27,061 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 127 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:27,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 382 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-11 23:56:27,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2022-07-11 23:56:27,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 469. [2022-07-11 23:56:27,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 468 states have (on average 1.5213675213675213) internal successors, (712), 468 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:27,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 712 transitions. [2022-07-11 23:56:27,071 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 712 transitions. Word has length 140 [2022-07-11 23:56:27,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:27,071 INFO L495 AbstractCegarLoop]: Abstraction has 469 states and 712 transitions. [2022-07-11 23:56:27,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:27,072 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 712 transitions. [2022-07-11 23:56:27,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-11 23:56:27,073 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:27,073 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:27,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-11 23:56:27,074 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:27,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:27,074 INFO L85 PathProgramCache]: Analyzing trace with hash 599251561, now seen corresponding path program 1 times [2022-07-11 23:56:27,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:27,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491749105] [2022-07-11 23:56:27,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:27,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:27,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:27,189 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-11 23:56:27,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:27,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491749105] [2022-07-11 23:56:27,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491749105] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:27,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:27,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:27,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553280025] [2022-07-11 23:56:27,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:27,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:27,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:27,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:27,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:27,192 INFO L87 Difference]: Start difference. First operand 469 states and 712 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:27,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:27,649 INFO L93 Difference]: Finished difference Result 949 states and 1446 transitions. [2022-07-11 23:56:27,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:27,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 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-11 23:56:27,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:27,651 INFO L225 Difference]: With dead ends: 949 [2022-07-11 23:56:27,651 INFO L226 Difference]: Without dead ends: 501 [2022-07-11 23:56:27,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:27,652 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 73 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:27,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 533 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-11 23:56:27,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2022-07-11 23:56:27,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 469. [2022-07-11 23:56:27,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 468 states have (on average 1.5192307692307692) internal successors, (711), 468 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:27,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 711 transitions. [2022-07-11 23:56:27,662 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 711 transitions. Word has length 141 [2022-07-11 23:56:27,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:27,663 INFO L495 AbstractCegarLoop]: Abstraction has 469 states and 711 transitions. [2022-07-11 23:56:27,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:27,663 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 711 transitions. [2022-07-11 23:56:27,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-11 23:56:27,664 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:27,665 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:27,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-11 23:56:27,665 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:27,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:27,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1307151705, now seen corresponding path program 1 times [2022-07-11 23:56:27,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:27,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331855195] [2022-07-11 23:56:27,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:27,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:27,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:27,781 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-11 23:56:27,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:27,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331855195] [2022-07-11 23:56:27,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331855195] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:27,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:27,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:56:27,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482601514] [2022-07-11 23:56:27,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:27,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:56:27,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:27,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:56:27,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:56:27,784 INFO L87 Difference]: Start difference. First operand 469 states and 711 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:27,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:27,845 INFO L93 Difference]: Finished difference Result 1360 states and 2077 transitions. [2022-07-11 23:56:27,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:56:27,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 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-11 23:56:27,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:27,848 INFO L225 Difference]: With dead ends: 1360 [2022-07-11 23:56:27,849 INFO L226 Difference]: Without dead ends: 912 [2022-07-11 23:56:27,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:56:27,850 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 144 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:27,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 435 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:56:27,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2022-07-11 23:56:27,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 910. [2022-07-11 23:56:27,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 909 states have (on average 1.5126512651265127) internal successors, (1375), 909 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:27,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1375 transitions. [2022-07-11 23:56:27,868 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1375 transitions. Word has length 141 [2022-07-11 23:56:27,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:27,868 INFO L495 AbstractCegarLoop]: Abstraction has 910 states and 1375 transitions. [2022-07-11 23:56:27,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:27,869 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1375 transitions. [2022-07-11 23:56:27,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-11 23:56:27,871 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:27,871 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:27,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-11 23:56:27,871 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:27,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:27,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1616008293, now seen corresponding path program 1 times [2022-07-11 23:56:27,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:27,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356803956] [2022-07-11 23:56:27,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:27,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:27,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:28,013 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-07-11 23:56:28,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:28,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356803956] [2022-07-11 23:56:28,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356803956] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:28,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:28,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:28,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35354965] [2022-07-11 23:56:28,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:28,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:28,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:28,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:28,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:28,016 INFO L87 Difference]: Start difference. First operand 910 states and 1375 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:28,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:28,577 INFO L93 Difference]: Finished difference Result 1880 states and 2843 transitions. [2022-07-11 23:56:28,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:28,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 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-11 23:56:28,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:28,581 INFO L225 Difference]: With dead ends: 1880 [2022-07-11 23:56:28,581 INFO L226 Difference]: Without dead ends: 991 [2022-07-11 23:56:28,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:28,582 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 31 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:28,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 607 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-11 23:56:28,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2022-07-11 23:56:28,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 962. [2022-07-11 23:56:28,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 961 states have (on average 1.5119667013527576) internal successors, (1453), 961 states have internal predecessors, (1453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:28,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1453 transitions. [2022-07-11 23:56:28,601 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1453 transitions. Word has length 141 [2022-07-11 23:56:28,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:28,601 INFO L495 AbstractCegarLoop]: Abstraction has 962 states and 1453 transitions. [2022-07-11 23:56:28,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:28,602 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1453 transitions. [2022-07-11 23:56:28,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-07-11 23:56:28,604 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:28,604 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:28,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-11 23:56:28,604 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:28,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:28,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1575140792, now seen corresponding path program 1 times [2022-07-11 23:56:28,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:28,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274369280] [2022-07-11 23:56:28,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:28,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:28,720 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-11 23:56:28,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:28,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274369280] [2022-07-11 23:56:28,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274369280] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:28,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:28,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:28,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463825195] [2022-07-11 23:56:28,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:28,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:28,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:28,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:28,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:28,723 INFO L87 Difference]: Start difference. First operand 962 states and 1453 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:29,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:29,363 INFO L93 Difference]: Finished difference Result 2122 states and 3197 transitions. [2022-07-11 23:56:29,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:29,364 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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 143 [2022-07-11 23:56:29,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:29,368 INFO L225 Difference]: With dead ends: 2122 [2022-07-11 23:56:29,368 INFO L226 Difference]: Without dead ends: 1181 [2022-07-11 23:56:29,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:29,369 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 129 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:29,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 402 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-11 23:56:29,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2022-07-11 23:56:29,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 1018. [2022-07-11 23:56:29,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 1017 states have (on average 1.5014749262536873) internal successors, (1527), 1017 states have internal predecessors, (1527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:29,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1527 transitions. [2022-07-11 23:56:29,390 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1527 transitions. Word has length 143 [2022-07-11 23:56:29,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:29,390 INFO L495 AbstractCegarLoop]: Abstraction has 1018 states and 1527 transitions. [2022-07-11 23:56:29,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:29,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1527 transitions. [2022-07-11 23:56:29,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-11 23:56:29,393 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:29,393 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:29,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-11 23:56:29,393 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:29,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:29,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1093473274, now seen corresponding path program 1 times [2022-07-11 23:56:29,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:29,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580755063] [2022-07-11 23:56:29,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:29,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:29,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:29,505 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-11 23:56:29,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:29,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580755063] [2022-07-11 23:56:29,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580755063] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:29,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:29,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:29,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114873264] [2022-07-11 23:56:29,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:29,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:29,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:29,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:29,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:29,507 INFO L87 Difference]: Start difference. First operand 1018 states and 1527 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:30,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:30,716 INFO L93 Difference]: Finished difference Result 2062 states and 3090 transitions. [2022-07-11 23:56:30,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:30,716 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2022-07-11 23:56:30,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:30,719 INFO L225 Difference]: With dead ends: 2062 [2022-07-11 23:56:30,719 INFO L226 Difference]: Without dead ends: 1065 [2022-07-11 23:56:30,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:30,720 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 57 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:30,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 551 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-11 23:56:30,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2022-07-11 23:56:30,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 1018. [2022-07-11 23:56:30,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 1017 states have (on average 1.4995083579154376) internal successors, (1525), 1017 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:30,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1525 transitions. [2022-07-11 23:56:30,740 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1525 transitions. Word has length 144 [2022-07-11 23:56:30,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:30,740 INFO L495 AbstractCegarLoop]: Abstraction has 1018 states and 1525 transitions. [2022-07-11 23:56:30,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:30,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1525 transitions. [2022-07-11 23:56:30,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-11 23:56:30,743 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:30,743 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:30,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-11 23:56:30,743 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:30,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:30,744 INFO L85 PathProgramCache]: Analyzing trace with hash 471469138, now seen corresponding path program 1 times [2022-07-11 23:56:30,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:30,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849816764] [2022-07-11 23:56:30,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:30,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:30,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:30,861 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-11 23:56:30,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:30,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849816764] [2022-07-11 23:56:30,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849816764] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:30,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:30,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:30,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350543039] [2022-07-11 23:56:30,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:30,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:30,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:30,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:30,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:30,863 INFO L87 Difference]: Start difference. First operand 1018 states and 1525 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:32,414 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:56:32,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:32,695 INFO L93 Difference]: Finished difference Result 2154 states and 3217 transitions. [2022-07-11 23:56:32,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:32,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 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 147 [2022-07-11 23:56:32,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:32,698 INFO L225 Difference]: With dead ends: 2154 [2022-07-11 23:56:32,698 INFO L226 Difference]: Without dead ends: 1157 [2022-07-11 23:56:32,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:32,700 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 131 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:32,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 386 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-11 23:56:32,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2022-07-11 23:56:32,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1018. [2022-07-11 23:56:32,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 1017 states have (on average 1.4837758112094395) internal successors, (1509), 1017 states have internal predecessors, (1509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:32,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1509 transitions. [2022-07-11 23:56:32,720 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1509 transitions. Word has length 147 [2022-07-11 23:56:32,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:32,721 INFO L495 AbstractCegarLoop]: Abstraction has 1018 states and 1509 transitions. [2022-07-11 23:56:32,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:32,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1509 transitions. [2022-07-11 23:56:32,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-07-11 23:56:32,723 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:32,723 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:32,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-11 23:56:32,724 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:32,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:32,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1372309044, now seen corresponding path program 1 times [2022-07-11 23:56:32,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:32,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891635360] [2022-07-11 23:56:32,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:32,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:32,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:32,838 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-11 23:56:32,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:32,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891635360] [2022-07-11 23:56:32,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891635360] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:32,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:32,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:32,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910371067] [2022-07-11 23:56:32,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:32,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:32,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:32,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:32,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:32,841 INFO L87 Difference]: Start difference. First operand 1018 states and 1509 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:34,480 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:56:34,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:34,759 INFO L93 Difference]: Finished difference Result 2154 states and 3185 transitions. [2022-07-11 23:56:34,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:34,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 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 148 [2022-07-11 23:56:34,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:34,766 INFO L225 Difference]: With dead ends: 2154 [2022-07-11 23:56:34,766 INFO L226 Difference]: Without dead ends: 1157 [2022-07-11 23:56:34,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:34,768 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 130 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:34,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 382 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-11 23:56:34,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2022-07-11 23:56:34,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1018. [2022-07-11 23:56:34,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 1017 states have (on average 1.4680432645034416) internal successors, (1493), 1017 states have internal predecessors, (1493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:34,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1493 transitions. [2022-07-11 23:56:34,789 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1493 transitions. Word has length 148 [2022-07-11 23:56:34,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:34,789 INFO L495 AbstractCegarLoop]: Abstraction has 1018 states and 1493 transitions. [2022-07-11 23:56:34,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:34,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1493 transitions. [2022-07-11 23:56:34,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-11 23:56:34,792 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:34,792 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:34,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-11 23:56:34,792 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:34,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:34,793 INFO L85 PathProgramCache]: Analyzing trace with hash -489063871, now seen corresponding path program 1 times [2022-07-11 23:56:34,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:34,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988136103] [2022-07-11 23:56:34,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:34,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:34,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:34,923 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-11 23:56:34,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:34,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988136103] [2022-07-11 23:56:34,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988136103] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:34,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:34,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:34,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575136210] [2022-07-11 23:56:34,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:34,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:34,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:34,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:34,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:34,925 INFO L87 Difference]: Start difference. First operand 1018 states and 1493 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:36,312 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:56:36,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:36,619 INFO L93 Difference]: Finished difference Result 2234 states and 3271 transitions. [2022-07-11 23:56:36,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:36,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 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 151 [2022-07-11 23:56:36,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:36,623 INFO L225 Difference]: With dead ends: 2234 [2022-07-11 23:56:36,623 INFO L226 Difference]: Without dead ends: 1237 [2022-07-11 23:56:36,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:36,624 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 121 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:36,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 382 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-11 23:56:36,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2022-07-11 23:56:36,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 1088. [2022-07-11 23:56:36,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 1087 states have (on average 1.4618215271389143) internal successors, (1589), 1087 states have internal predecessors, (1589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:36,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1589 transitions. [2022-07-11 23:56:36,647 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 1589 transitions. Word has length 151 [2022-07-11 23:56:36,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:36,648 INFO L495 AbstractCegarLoop]: Abstraction has 1088 states and 1589 transitions. [2022-07-11 23:56:36,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:36,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 1589 transitions. [2022-07-11 23:56:36,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-11 23:56:36,650 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:36,650 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:36,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-07-11 23:56:36,651 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:36,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:36,651 INFO L85 PathProgramCache]: Analyzing trace with hash 51753423, now seen corresponding path program 1 times [2022-07-11 23:56:36,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:36,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493649466] [2022-07-11 23:56:36,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:36,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:36,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:36,786 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-11 23:56:36,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:36,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493649466] [2022-07-11 23:56:36,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493649466] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:36,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:36,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:36,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55946708] [2022-07-11 23:56:36,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:36,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:36,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:36,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:36,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:36,793 INFO L87 Difference]: Start difference. First operand 1088 states and 1589 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:38,806 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:56:39,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:39,100 INFO L93 Difference]: Finished difference Result 2374 states and 3463 transitions. [2022-07-11 23:56:39,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:39,100 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 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 151 [2022-07-11 23:56:39,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:39,105 INFO L225 Difference]: With dead ends: 2374 [2022-07-11 23:56:39,105 INFO L226 Difference]: Without dead ends: 1307 [2022-07-11 23:56:39,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:39,107 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 123 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 51 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:39,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 392 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 247 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-11 23:56:39,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1307 states. [2022-07-11 23:56:39,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1307 to 1154. [2022-07-11 23:56:39,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 1153 states have (on average 1.4544666088464875) internal successors, (1677), 1153 states have internal predecessors, (1677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:39,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1677 transitions. [2022-07-11 23:56:39,132 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1677 transitions. Word has length 151 [2022-07-11 23:56:39,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:39,132 INFO L495 AbstractCegarLoop]: Abstraction has 1154 states and 1677 transitions. [2022-07-11 23:56:39,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:39,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1677 transitions. [2022-07-11 23:56:39,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-11 23:56:39,135 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:39,135 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:39,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-07-11 23:56:39,135 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:39,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:39,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1042092054, now seen corresponding path program 1 times [2022-07-11 23:56:39,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:39,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950711772] [2022-07-11 23:56:39,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:39,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:39,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:39,261 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-11 23:56:39,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:39,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950711772] [2022-07-11 23:56:39,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950711772] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:39,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:39,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:39,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49113212] [2022-07-11 23:56:39,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:39,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:39,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:39,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:39,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:39,266 INFO L87 Difference]: Start difference. First operand 1154 states and 1677 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:40,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:40,010 INFO L93 Difference]: Finished difference Result 2318 states and 3368 transitions. [2022-07-11 23:56:40,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:40,011 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 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 152 [2022-07-11 23:56:40,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:40,015 INFO L225 Difference]: With dead ends: 2318 [2022-07-11 23:56:40,015 INFO L226 Difference]: Without dead ends: 1185 [2022-07-11 23:56:40,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:40,017 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 39 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:40,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 561 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-11 23:56:40,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2022-07-11 23:56:40,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 1154. [2022-07-11 23:56:40,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 1153 states have (on average 1.4527320034692108) internal successors, (1675), 1153 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:40,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1675 transitions. [2022-07-11 23:56:40,041 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1675 transitions. Word has length 152 [2022-07-11 23:56:40,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:40,041 INFO L495 AbstractCegarLoop]: Abstraction has 1154 states and 1675 transitions. [2022-07-11 23:56:40,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:40,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1675 transitions. [2022-07-11 23:56:40,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-11 23:56:40,044 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:40,044 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:40,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-07-11 23:56:40,045 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:40,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:40,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1628444376, now seen corresponding path program 1 times [2022-07-11 23:56:40,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:40,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766220076] [2022-07-11 23:56:40,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:40,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:40,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:40,145 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-11 23:56:40,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:40,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766220076] [2022-07-11 23:56:40,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766220076] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:40,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:40,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:40,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563347870] [2022-07-11 23:56:40,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:40,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:40,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:40,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:40,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:40,147 INFO L87 Difference]: Start difference. First operand 1154 states and 1675 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:40,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:40,992 INFO L93 Difference]: Finished difference Result 2312 states and 3357 transitions. [2022-07-11 23:56:40,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:40,993 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2022-07-11 23:56:40,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:40,996 INFO L225 Difference]: With dead ends: 2312 [2022-07-11 23:56:40,996 INFO L226 Difference]: Without dead ends: 1179 [2022-07-11 23:56:40,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:40,998 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 33 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:40,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 563 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-11 23:56:40,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2022-07-11 23:56:41,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1154. [2022-07-11 23:56:41,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 1153 states have (on average 1.4509973980919342) internal successors, (1673), 1153 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:41,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1673 transitions. [2022-07-11 23:56:41,022 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1673 transitions. Word has length 152 [2022-07-11 23:56:41,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:41,022 INFO L495 AbstractCegarLoop]: Abstraction has 1154 states and 1673 transitions. [2022-07-11 23:56:41,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:41,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1673 transitions. [2022-07-11 23:56:41,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-07-11 23:56:41,025 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:41,025 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:41,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-07-11 23:56:41,025 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:41,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:41,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1310969376, now seen corresponding path program 1 times [2022-07-11 23:56:41,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:41,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437370346] [2022-07-11 23:56:41,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:41,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:41,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:41,134 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-11 23:56:41,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:41,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437370346] [2022-07-11 23:56:41,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437370346] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:41,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:41,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:41,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217951557] [2022-07-11 23:56:41,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:41,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:41,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:41,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:41,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:41,137 INFO L87 Difference]: Start difference. First operand 1154 states and 1673 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:42,449 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:56:42,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:42,675 INFO L93 Difference]: Finished difference Result 2444 states and 3542 transitions. [2022-07-11 23:56:42,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:42,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2022-07-11 23:56:42,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:42,678 INFO L225 Difference]: With dead ends: 2444 [2022-07-11 23:56:42,678 INFO L226 Difference]: Without dead ends: 1311 [2022-07-11 23:56:42,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:42,680 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 66 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:42,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 579 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-11 23:56:42,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2022-07-11 23:56:42,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 1230. [2022-07-11 23:56:42,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 1229 states have (on average 1.4491456468673718) internal successors, (1781), 1229 states have internal predecessors, (1781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:42,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1781 transitions. [2022-07-11 23:56:42,704 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1781 transitions. Word has length 155 [2022-07-11 23:56:42,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:42,705 INFO L495 AbstractCegarLoop]: Abstraction has 1230 states and 1781 transitions. [2022-07-11 23:56:42,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:42,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1781 transitions. [2022-07-11 23:56:42,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-07-11 23:56:42,707 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:42,708 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:42,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-07-11 23:56:42,708 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:42,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:42,708 INFO L85 PathProgramCache]: Analyzing trace with hash -2067414622, now seen corresponding path program 1 times [2022-07-11 23:56:42,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:42,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190249618] [2022-07-11 23:56:42,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:42,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:42,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:42,803 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-11 23:56:42,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:42,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190249618] [2022-07-11 23:56:42,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190249618] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:42,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:42,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:56:42,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600392713] [2022-07-11 23:56:42,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:42,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:56:42,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:42,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:56:42,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:56:42,805 INFO L87 Difference]: Start difference. First operand 1230 states and 1781 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:42,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:42,846 INFO L93 Difference]: Finished difference Result 2466 states and 3574 transitions. [2022-07-11 23:56:42,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:56:42,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 160 [2022-07-11 23:56:42,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:42,849 INFO L225 Difference]: With dead ends: 2466 [2022-07-11 23:56:42,849 INFO L226 Difference]: Without dead ends: 1257 [2022-07-11 23:56:42,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:56:42,851 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 15 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:42,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 420 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:56:42,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2022-07-11 23:56:42,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1257. [2022-07-11 23:56:42,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1257 states, 1256 states have (on average 1.4458598726114649) internal successors, (1816), 1256 states have internal predecessors, (1816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:42,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 1816 transitions. [2022-07-11 23:56:42,875 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 1816 transitions. Word has length 160 [2022-07-11 23:56:42,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:42,875 INFO L495 AbstractCegarLoop]: Abstraction has 1257 states and 1816 transitions. [2022-07-11 23:56:42,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:42,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1816 transitions. [2022-07-11 23:56:42,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-07-11 23:56:42,877 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:42,878 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:42,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-07-11 23:56:42,878 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:42,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:42,878 INFO L85 PathProgramCache]: Analyzing trace with hash 439682852, now seen corresponding path program 1 times [2022-07-11 23:56:42,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:42,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256248901] [2022-07-11 23:56:42,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:42,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:42,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:42,964 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-07-11 23:56:42,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:42,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256248901] [2022-07-11 23:56:42,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256248901] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:42,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:42,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:56:42,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824394108] [2022-07-11 23:56:42,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:42,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:56:42,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:42,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:56:42,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:56:42,969 INFO L87 Difference]: Start difference. First operand 1257 states and 1816 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:43,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:43,008 INFO L93 Difference]: Finished difference Result 2495 states and 3610 transitions. [2022-07-11 23:56:43,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:56:43,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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 160 [2022-07-11 23:56:43,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:43,028 INFO L225 Difference]: With dead ends: 2495 [2022-07-11 23:56:43,028 INFO L226 Difference]: Without dead ends: 1259 [2022-07-11 23:56:43,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:56:43,030 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 4 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:43,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 399 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:56:43,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2022-07-11 23:56:43,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 1259. [2022-07-11 23:56:43,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1259 states, 1258 states have (on average 1.4451510333863276) internal successors, (1818), 1258 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:43,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 1259 states and 1818 transitions. [2022-07-11 23:56:43,055 INFO L78 Accepts]: Start accepts. Automaton has 1259 states and 1818 transitions. Word has length 160 [2022-07-11 23:56:43,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:43,055 INFO L495 AbstractCegarLoop]: Abstraction has 1259 states and 1818 transitions. [2022-07-11 23:56:43,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:43,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 1818 transitions. [2022-07-11 23:56:43,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-11 23:56:43,057 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:43,058 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:43,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-07-11 23:56:43,059 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:43,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:43,059 INFO L85 PathProgramCache]: Analyzing trace with hash -797461174, now seen corresponding path program 1 times [2022-07-11 23:56:43,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:43,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966598975] [2022-07-11 23:56:43,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:43,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:43,182 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-11 23:56:43,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:43,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966598975] [2022-07-11 23:56:43,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966598975] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:43,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:43,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:43,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169793691] [2022-07-11 23:56:43,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:43,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:43,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:43,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:43,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:43,184 INFO L87 Difference]: Start difference. First operand 1259 states and 1818 transitions. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:43,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:43,940 INFO L93 Difference]: Finished difference Result 2635 states and 3802 transitions. [2022-07-11 23:56:43,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:43,940 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 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 161 [2022-07-11 23:56:43,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:43,944 INFO L225 Difference]: With dead ends: 2635 [2022-07-11 23:56:43,944 INFO L226 Difference]: Without dead ends: 1399 [2022-07-11 23:56:43,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:43,946 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 117 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:43,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 382 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-11 23:56:43,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2022-07-11 23:56:43,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1183. [2022-07-11 23:56:43,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1182 states have (on average 1.4433164128595601) internal successors, (1706), 1182 states have internal predecessors, (1706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:43,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1706 transitions. [2022-07-11 23:56:43,968 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1706 transitions. Word has length 161 [2022-07-11 23:56:43,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:43,969 INFO L495 AbstractCegarLoop]: Abstraction has 1183 states and 1706 transitions. [2022-07-11 23:56:43,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:43,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1706 transitions. [2022-07-11 23:56:43,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-11 23:56:43,971 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:43,971 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:43,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-07-11 23:56:43,972 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:43,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:43,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1165663926, now seen corresponding path program 1 times [2022-07-11 23:56:43,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:43,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400198001] [2022-07-11 23:56:43,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:43,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:44,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:44,105 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-11 23:56:44,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:44,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400198001] [2022-07-11 23:56:44,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400198001] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:44,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:44,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:44,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803301678] [2022-07-11 23:56:44,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:44,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:44,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:44,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:44,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:44,107 INFO L87 Difference]: Start difference. First operand 1183 states and 1706 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:46,118 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:56:46,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:46,378 INFO L93 Difference]: Finished difference Result 2501 states and 3605 transitions. [2022-07-11 23:56:46,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:46,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 163 [2022-07-11 23:56:46,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:46,381 INFO L225 Difference]: With dead ends: 2501 [2022-07-11 23:56:46,381 INFO L226 Difference]: Without dead ends: 1341 [2022-07-11 23:56:46,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:46,383 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 60 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:46,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 581 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 227 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-11 23:56:46,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2022-07-11 23:56:46,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1269. [2022-07-11 23:56:46,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1269 states, 1268 states have (on average 1.4416403785488958) internal successors, (1828), 1268 states have internal predecessors, (1828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:46,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1269 states and 1828 transitions. [2022-07-11 23:56:46,403 INFO L78 Accepts]: Start accepts. Automaton has 1269 states and 1828 transitions. Word has length 163 [2022-07-11 23:56:46,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:46,404 INFO L495 AbstractCegarLoop]: Abstraction has 1269 states and 1828 transitions. [2022-07-11 23:56:46,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:46,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 1828 transitions. [2022-07-11 23:56:46,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-07-11 23:56:46,406 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:46,406 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:46,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-07-11 23:56:46,406 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:46,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:46,406 INFO L85 PathProgramCache]: Analyzing trace with hash -502693233, now seen corresponding path program 1 times [2022-07-11 23:56:46,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:46,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910241368] [2022-07-11 23:56:46,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:46,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:46,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:46,508 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-11 23:56:46,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:46,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910241368] [2022-07-11 23:56:46,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910241368] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:46,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:46,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:56:46,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134569959] [2022-07-11 23:56:46,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:46,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:56:46,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:46,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:56:46,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:56:46,511 INFO L87 Difference]: Start difference. First operand 1269 states and 1828 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:47,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:47,341 INFO L93 Difference]: Finished difference Result 2579 states and 3715 transitions. [2022-07-11 23:56:47,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:56:47,342 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 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 164 [2022-07-11 23:56:47,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:47,344 INFO L225 Difference]: With dead ends: 2579 [2022-07-11 23:56:47,344 INFO L226 Difference]: Without dead ends: 1329 [2022-07-11 23:56:47,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:47,345 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 54 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:47,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 583 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-11 23:56:47,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2022-07-11 23:56:47,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1267. [2022-07-11 23:56:47,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1267 states, 1266 states have (on average 1.4407582938388626) internal successors, (1824), 1266 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:47,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1267 states to 1267 states and 1824 transitions. [2022-07-11 23:56:47,365 INFO L78 Accepts]: Start accepts. Automaton has 1267 states and 1824 transitions. Word has length 164 [2022-07-11 23:56:47,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:47,365 INFO L495 AbstractCegarLoop]: Abstraction has 1267 states and 1824 transitions. [2022-07-11 23:56:47,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:47,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 1824 transitions. [2022-07-11 23:56:47,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-11 23:56:47,367 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:47,367 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:47,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-07-11 23:56:47,367 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:47,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:47,367 INFO L85 PathProgramCache]: Analyzing trace with hash -667829280, now seen corresponding path program 1 times [2022-07-11 23:56:47,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:47,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410612551] [2022-07-11 23:56:47,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:47,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:47,735 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2022-07-11 23:56:47,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:47,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410612551] [2022-07-11 23:56:47,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410612551] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:56:47,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:56:47,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-11 23:56:47,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793529471] [2022-07-11 23:56:47,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:56:47,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 23:56:47,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:56:47,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 23:56:47,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:56:47,738 INFO L87 Difference]: Start difference. First operand 1267 states and 1824 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:49,823 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:56:50,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:50,106 INFO L93 Difference]: Finished difference Result 2531 states and 3644 transitions. [2022-07-11 23:56:50,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-11 23:56:50,106 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 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 169 [2022-07-11 23:56:50,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:50,108 INFO L225 Difference]: With dead ends: 2531 [2022-07-11 23:56:50,108 INFO L226 Difference]: Without dead ends: 1267 [2022-07-11 23:56:50,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:56:50,110 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 7 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:56:50,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 711 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-11 23:56:50,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2022-07-11 23:56:50,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1267. [2022-07-11 23:56:50,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1267 states, 1266 states have (on average 1.4399684044233807) internal successors, (1823), 1266 states have internal predecessors, (1823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:50,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1267 states to 1267 states and 1823 transitions. [2022-07-11 23:56:50,135 INFO L78 Accepts]: Start accepts. Automaton has 1267 states and 1823 transitions. Word has length 169 [2022-07-11 23:56:50,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:56:50,135 INFO L495 AbstractCegarLoop]: Abstraction has 1267 states and 1823 transitions. [2022-07-11 23:56:50,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:50,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 1823 transitions. [2022-07-11 23:56:50,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-11 23:56:50,138 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:56:50,138 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:56:50,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-07-11 23:56:50,138 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:56:50,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:56:50,139 INFO L85 PathProgramCache]: Analyzing trace with hash -2075555230, now seen corresponding path program 1 times [2022-07-11 23:56:50,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:56:50,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446413827] [2022-07-11 23:56:50,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:50,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:56:50,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:50,875 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 146 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-11 23:56:50,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:56:50,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446413827] [2022-07-11 23:56:50,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446413827] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:56:50,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97900612] [2022-07-11 23:56:50,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:56:50,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:56:50,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:56:50,883 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:56:50,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-11 23:56:52,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:56:52,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 1083 conjuncts, 167 conjunts are in the unsatisfiable core [2022-07-11 23:56:52,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:56:52,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:56:52,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:56:52,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:56:53,063 INFO L356 Elim1Store]: treesize reduction 1040, result has 8.0 percent of original size [2022-07-11 23:56:53,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 10 case distinctions, treesize of input 181610 treesize of output 38647 [2022-07-11 23:57:04,994 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 101 [2022-07-11 23:57:04,996 WARN L230 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-07-11 23:57:04,997 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-11 23:57:05,019 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-11 23:57:05,198 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,SelfDestructingSolverStorable45 [2022-07-11 23:57:05,198 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:269) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.push(UndoableWrapperScript.java:54) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.pushContext(SimplifyDDA.java:736) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:389) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:648) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:198) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:353) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) ... 54 more Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 72 more [2022-07-11 23:57:05,204 INFO L158 Benchmark]: Toolchain (without parser) took 86585.09ms. Allocated memory was 83.9MB in the beginning and 744.5MB in the end (delta: 660.6MB). Free memory was 47.7MB in the beginning and 392.7MB in the end (delta: -344.9MB). Peak memory consumption was 568.0MB. Max. memory is 16.1GB. [2022-07-11 23:57:05,204 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 83.9MB. Free memory was 56.4MB in the beginning and 56.4MB in the end (delta: 23.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-11 23:57:05,204 INFO L158 Benchmark]: CACSL2BoogieTranslator took 563.80ms. Allocated memory was 83.9MB in the beginning and 104.9MB in the end (delta: 21.0MB). Free memory was 47.5MB in the beginning and 60.3MB in the end (delta: -12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-11 23:57:05,205 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.37ms. Allocated memory is still 104.9MB. Free memory was 60.3MB in the beginning and 55.3MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-11 23:57:05,205 INFO L158 Benchmark]: Boogie Preprocessor took 112.46ms. Allocated memory is still 104.9MB. Free memory was 55.3MB in the beginning and 47.8MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-11 23:57:05,205 INFO L158 Benchmark]: RCFGBuilder took 3158.70ms. Allocated memory is still 104.9MB. Free memory was 47.8MB in the beginning and 49.8MB in the end (delta: -2.0MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. [2022-07-11 23:57:05,205 INFO L158 Benchmark]: TraceAbstraction took 82650.66ms. Allocated memory was 104.9MB in the beginning and 744.5MB in the end (delta: 639.6MB). Free memory was 49.0MB in the beginning and 392.7MB in the end (delta: -343.6MB). Peak memory consumption was 547.5MB. Max. memory is 16.1GB. [2022-07-11 23:57:05,209 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 83.9MB. Free memory was 56.4MB in the beginning and 56.4MB in the end (delta: 23.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 563.80ms. Allocated memory was 83.9MB in the beginning and 104.9MB in the end (delta: 21.0MB). Free memory was 47.5MB in the beginning and 60.3MB in the end (delta: -12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.37ms. Allocated memory is still 104.9MB. Free memory was 60.3MB in the beginning and 55.3MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 112.46ms. Allocated memory is still 104.9MB. Free memory was 55.3MB in the beginning and 47.8MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 3158.70ms. Allocated memory is still 104.9MB. Free memory was 47.8MB in the beginning and 49.8MB in the end (delta: -2.0MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. * TraceAbstraction took 82650.66ms. Allocated memory was 104.9MB in the beginning and 744.5MB in the end (delta: 639.6MB). Free memory was 49.0MB in the beginning and 392.7MB in the end (delta: -343.6MB). Peak memory consumption was 547.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/openssl/s3_srvr.blast.14.i.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 adf973339365dcd50ea4c1729cfdba4f7375ef39da53eb99572e95c3bcdc3498 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-11 23:57:06,976 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 23:57:06,979 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 23:57:07,025 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 23:57:07,026 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 23:57:07,027 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 23:57:07,031 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 23:57:07,035 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 23:57:07,036 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 23:57:07,041 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 23:57:07,042 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 23:57:07,046 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 23:57:07,047 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 23:57:07,049 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 23:57:07,050 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 23:57:07,053 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 23:57:07,054 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 23:57:07,055 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 23:57:07,057 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 23:57:07,063 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 23:57:07,064 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 23:57:07,065 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 23:57:07,067 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 23:57:07,068 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 23:57:07,069 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 23:57:07,076 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 23:57:07,076 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 23:57:07,077 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 23:57:07,078 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 23:57:07,078 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 23:57:07,079 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 23:57:07,079 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 23:57:07,081 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 23:57:07,081 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 23:57:07,083 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 23:57:07,083 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 23:57:07,084 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 23:57:07,084 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 23:57:07,084 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 23:57:07,085 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 23:57:07,085 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 23:57:07,087 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 23:57:07,092 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-11 23:57:07,124 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 23:57:07,125 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 23:57:07,125 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 23:57:07,126 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 23:57:07,126 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 23:57:07,126 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 23:57:07,127 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 23:57:07,127 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 23:57:07,128 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 23:57:07,128 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 23:57:07,129 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 23:57:07,129 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 23:57:07,129 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 23:57:07,129 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 23:57:07,129 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 23:57:07,130 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 23:57:07,130 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-11 23:57:07,130 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-11 23:57:07,130 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-11 23:57:07,130 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 23:57:07,131 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 23:57:07,131 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 23:57:07,131 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 23:57:07,131 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 23:57:07,131 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 23:57:07,131 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 23:57:07,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:57:07,132 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 23:57:07,132 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 23:57:07,132 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 23:57:07,133 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-11 23:57:07,133 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-11 23:57:07,133 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 23:57:07,133 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 23:57:07,133 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 23:57:07,134 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-11 23:57:07,134 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> adf973339365dcd50ea4c1729cfdba4f7375ef39da53eb99572e95c3bcdc3498 [2022-07-11 23:57:07,465 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 23:57:07,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 23:57:07,490 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 23:57:07,491 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 23:57:07,492 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 23:57:07,494 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.14.i.cil-2.c [2022-07-11 23:57:07,546 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5807f39fb/54cf5c791838409095c0511f8c8fe811/FLAG186681cb6 [2022-07-11 23:57:08,196 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 23:57:08,197 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.14.i.cil-2.c [2022-07-11 23:57:08,221 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5807f39fb/54cf5c791838409095c0511f8c8fe811/FLAG186681cb6 [2022-07-11 23:57:08,527 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5807f39fb/54cf5c791838409095c0511f8c8fe811 [2022-07-11 23:57:08,529 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 23:57:08,530 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 23:57:08,531 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 23:57:08,531 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 23:57:08,534 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 23:57:08,535 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:57:08" (1/1) ... [2022-07-11 23:57:08,536 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bff9700 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:57:08, skipping insertion in model container [2022-07-11 23:57:08,537 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:57:08" (1/1) ... [2022-07-11 23:57:08,543 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 23:57:08,608 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:57:09,021 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/openssl/s3_srvr.blast.14.i.cil-2.c[76259,76272] [2022-07-11 23:57:09,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:57:09,062 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-11 23:57:09,073 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:57:09,176 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/openssl/s3_srvr.blast.14.i.cil-2.c[76259,76272] [2022-07-11 23:57:09,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:57:09,183 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 23:57:09,280 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/openssl/s3_srvr.blast.14.i.cil-2.c[76259,76272] [2022-07-11 23:57:09,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:57:09,305 INFO L208 MainTranslator]: Completed translation [2022-07-11 23:57:09,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:57:09 WrapperNode [2022-07-11 23:57:09,306 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 23:57:09,307 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 23:57:09,307 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 23:57:09,307 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 23:57:09,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:57:09" (1/1) ... [2022-07-11 23:57:09,346 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:57:09" (1/1) ... [2022-07-11 23:57:09,404 INFO L137 Inliner]: procedures = 35, calls = 223, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 773 [2022-07-11 23:57:09,411 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 23:57:09,413 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 23:57:09,413 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 23:57:09,413 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 23:57:09,420 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:57:09" (1/1) ... [2022-07-11 23:57:09,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:57:09" (1/1) ... [2022-07-11 23:57:09,427 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:57:09" (1/1) ... [2022-07-11 23:57:09,428 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:57:09" (1/1) ... [2022-07-11 23:57:09,453 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:57:09" (1/1) ... [2022-07-11 23:57:09,459 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:57:09" (1/1) ... [2022-07-11 23:57:09,462 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:57:09" (1/1) ... [2022-07-11 23:57:09,467 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 23:57:09,468 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 23:57:09,468 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 23:57:09,468 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 23:57:09,469 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:57:09" (1/1) ... [2022-07-11 23:57:09,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:57:09,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:57:09,509 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-11 23:57:09,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-11 23:57:09,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 23:57:09,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-11 23:57:09,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-11 23:57:09,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-11 23:57:09,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-11 23:57:09,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-11 23:57:09,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 23:57:09,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 23:57:09,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-11 23:57:09,719 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 23:57:09,720 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 23:57:09,745 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:57:18,145 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-07-11 23:57:18,145 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-07-11 23:57:18,145 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 23:57:18,151 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 23:57:18,152 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-11 23:57:18,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:57:18 BoogieIcfgContainer [2022-07-11 23:57:18,154 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 23:57:18,156 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 23:57:18,156 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 23:57:18,158 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 23:57:18,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 11:57:08" (1/3) ... [2022-07-11 23:57:18,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47f471f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:57:18, skipping insertion in model container [2022-07-11 23:57:18,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:57:09" (2/3) ... [2022-07-11 23:57:18,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47f471f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:57:18, skipping insertion in model container [2022-07-11 23:57:18,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:57:18" (3/3) ... [2022-07-11 23:57:18,161 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.14.i.cil-2.c [2022-07-11 23:57:18,174 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 23:57:18,175 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 23:57:18,220 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 23:57:18,226 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@68c1a75, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@27a14461 [2022-07-11 23:57:18,226 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 23:57:18,233 INFO L276 IsEmpty]: Start isEmpty. Operand has 155 states, 153 states have (on average 1.7254901960784315) internal successors, (264), 154 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:18,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-11 23:57:18,242 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:57:18,243 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] [2022-07-11 23:57:18,244 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:57:18,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:57:18,249 INFO L85 PathProgramCache]: Analyzing trace with hash 918516044, now seen corresponding path program 1 times [2022-07-11 23:57:18,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:57:18,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1213998866] [2022-07-11 23:57:18,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:57:18,262 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:57:18,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:57:18,267 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:57:18,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-11 23:57:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:57:19,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-11 23:57:19,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:57:19,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-11 23:57:19,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-11 23:57:20,017 INFO L356 Elim1Store]: treesize reduction 1496, result has 4.7 percent of original size [2022-07-11 23:57:20,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 78 treesize of output 85 [2022-07-11 23:57:20,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:20,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:20,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:20,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:20,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:20,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:20,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:20,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:20,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:20,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:20,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:20,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:20,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:20,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:20,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:20,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:20,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:20,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:20,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:20,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:20,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:20,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:20,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:20,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:20,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:20,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:20,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:20,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:20,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:20,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:20,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:20,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:20,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:20,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:20,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:20,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:20,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 36 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 85 [2022-07-11 23:57:20,340 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-11 23:57:20,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 49 [2022-07-11 23:57:20,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:20,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:20,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:20,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:20,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:20,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:20,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:20,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:20,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:20,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:20,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 49 [2022-07-11 23:57:20,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-11 23:57:20,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-11 23:57:20,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:57:20,449 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:57:20,450 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:57:20,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1213998866] [2022-07-11 23:57:20,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1213998866] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:57:20,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:57:20,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-11 23:57:20,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382915510] [2022-07-11 23:57:20,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:57:20,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 23:57:20,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:57:20,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 23:57:20,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:57:20,484 INFO L87 Difference]: Start difference. First operand has 155 states, 153 states have (on average 1.7254901960784315) internal successors, (264), 154 states have internal predecessors, (264), 0 states have call successors, (0), 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 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:22,518 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:57:24,528 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:57:26,845 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:57:35,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:57:35,416 INFO L93 Difference]: Finished difference Result 311 states and 527 transitions. [2022-07-11 23:57:35,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-11 23:57:35,426 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2022-07-11 23:57:35,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:57:35,436 INFO L225 Difference]: With dead ends: 311 [2022-07-11 23:57:35,437 INFO L226 Difference]: Without dead ends: 142 [2022-07-11 23:57:35,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:57:35,443 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 10 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.8s IncrementalHoareTripleChecker+Time [2022-07-11 23:57:35,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 865 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 176 Invalid, 2 Unknown, 0 Unchecked, 14.8s Time] [2022-07-11 23:57:35,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-07-11 23:57:35,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2022-07-11 23:57:35,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.553191489361702) internal successors, (219), 141 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:35,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 219 transitions. [2022-07-11 23:57:35,488 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 219 transitions. Word has length 44 [2022-07-11 23:57:35,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:57:35,489 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 219 transitions. [2022-07-11 23:57:35,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:35,489 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 219 transitions. [2022-07-11 23:57:35,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-11 23:57:35,491 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:57:35,491 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] [2022-07-11 23:57:35,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-11 23:57:35,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:57:35,696 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:57:35,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:57:35,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1166662538, now seen corresponding path program 1 times [2022-07-11 23:57:35,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:57:35,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [320161497] [2022-07-11 23:57:35,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:57:35,703 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:57:35,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:57:35,705 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:57:35,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-11 23:57:36,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:57:36,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-11 23:57:36,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:57:36,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:36,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:36,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:36,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:36,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:57:36,541 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:57:36,933 INFO L356 Elim1Store]: treesize reduction 1124, result has 5.4 percent of original size [2022-07-11 23:57:36,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 72 treesize of output 74 [2022-07-11 23:57:37,396 INFO L356 Elim1Store]: treesize reduction 825, result has 7.2 percent of original size [2022-07-11 23:57:37,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 13 case distinctions, treesize of input 66 treesize of output 86 [2022-07-11 23:57:37,755 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-11 23:57:37,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 23 [2022-07-11 23:57:37,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:57:37,778 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:57:37,778 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:57:37,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [320161497] [2022-07-11 23:57:37,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [320161497] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:57:37,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:57:37,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:57:37,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717971274] [2022-07-11 23:57:37,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:57:37,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:57:37,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:57:37,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:57:37,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:57:37,780 INFO L87 Difference]: Start difference. First operand 142 states and 219 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:39,806 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:57:42,333 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:57:43,490 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:57:47,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:57:47,350 INFO L93 Difference]: Finished difference Result 302 states and 466 transitions. [2022-07-11 23:57:47,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:57:47,352 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2022-07-11 23:57:47,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:57:47,353 INFO L225 Difference]: With dead ends: 302 [2022-07-11 23:57:47,353 INFO L226 Difference]: Without dead ends: 170 [2022-07-11 23:57:47,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:57:47,355 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 22 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:57:47,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 497 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 149 Invalid, 1 Unknown, 0 Unchecked, 9.5s Time] [2022-07-11 23:57:47,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-07-11 23:57:47,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 153. [2022-07-11 23:57:47,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 1.5657894736842106) internal successors, (238), 152 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:47,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 238 transitions. [2022-07-11 23:57:47,365 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 238 transitions. Word has length 44 [2022-07-11 23:57:47,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:57:47,366 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 238 transitions. [2022-07-11 23:57:47,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:47,366 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 238 transitions. [2022-07-11 23:57:47,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-11 23:57:47,368 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:57:47,368 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:57:47,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-11 23:57:47,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:57:47,576 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:57:47,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:57:47,576 INFO L85 PathProgramCache]: Analyzing trace with hash -616728635, now seen corresponding path program 1 times [2022-07-11 23:57:47,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:57:47,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1804165380] [2022-07-11 23:57:47,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:57:47,578 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:57:47,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:57:47,579 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:57:47,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-11 23:57:48,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:57:48,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-11 23:57:48,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:57:48,881 INFO L356 Elim1Store]: treesize reduction 1104, result has 5.5 percent of original size [2022-07-11 23:57:48,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 69 treesize of output 73 [2022-07-11 23:57:49,020 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-11 23:57:49,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 49 [2022-07-11 23:57:49,065 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-11 23:57:49,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-11 23:57:49,090 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:57:49,091 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:57:49,091 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:57:49,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1804165380] [2022-07-11 23:57:49,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1804165380] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:57:49,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:57:49,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:57:49,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181216122] [2022-07-11 23:57:49,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:57:49,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:57:49,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:57:49,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:57:49,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:57:49,093 INFO L87 Difference]: Start difference. First operand 153 states and 238 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:51,114 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:57:54,188 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:57:55,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:57:55,670 INFO L93 Difference]: Finished difference Result 296 states and 458 transitions. [2022-07-11 23:57:55,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:57:55,672 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2022-07-11 23:57:55,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:57:55,673 INFO L225 Difference]: With dead ends: 296 [2022-07-11 23:57:55,673 INFO L226 Difference]: Without dead ends: 164 [2022-07-11 23:57:55,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:57:55,675 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 17 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:57:55,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 526 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 111 Invalid, 1 Unknown, 20 Unchecked, 6.5s Time] [2022-07-11 23:57:55,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-07-11 23:57:55,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 153. [2022-07-11 23:57:55,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 1.5592105263157894) internal successors, (237), 152 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:55,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 237 transitions. [2022-07-11 23:57:55,691 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 237 transitions. Word has length 57 [2022-07-11 23:57:55,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:57:55,692 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 237 transitions. [2022-07-11 23:57:55,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:55,694 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 237 transitions. [2022-07-11 23:57:55,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-11 23:57:55,698 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:57:55,698 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:57:55,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-11 23:57:55,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:57:55,899 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:57:55,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:57:55,900 INFO L85 PathProgramCache]: Analyzing trace with hash 2106199760, now seen corresponding path program 1 times [2022-07-11 23:57:55,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:57:55,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1616708093] [2022-07-11 23:57:55,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:57:55,901 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:57:55,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:57:55,905 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:57:55,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-11 23:57:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:57:56,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-11 23:57:56,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:57:57,263 INFO L356 Elim1Store]: treesize reduction 1105, result has 5.5 percent of original size [2022-07-11 23:57:57,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 69 treesize of output 73 [2022-07-11 23:57:57,449 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-11 23:57:57,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 49 [2022-07-11 23:57:57,484 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-11 23:57:57,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-11 23:57:57,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:57:57,508 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:57:57,508 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:57:57,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1616708093] [2022-07-11 23:57:57,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1616708093] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:57:57,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:57:57,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:57:57,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408179435] [2022-07-11 23:57:57,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:57:57,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:57:57,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:57:57,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:57:57,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:57:57,510 INFO L87 Difference]: Start difference. First operand 153 states and 237 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:57:59,532 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:58:00,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:58:00,824 INFO L93 Difference]: Finished difference Result 297 states and 461 transitions. [2022-07-11 23:58:00,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:58:00,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2022-07-11 23:58:00,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:58:00,827 INFO L225 Difference]: With dead ends: 297 [2022-07-11 23:58:00,827 INFO L226 Difference]: Without dead ends: 165 [2022-07-11 23:58:00,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:58:00,828 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 18 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 21 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:58:00,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 524 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 87 Invalid, 1 Unknown, 15 Unchecked, 3.3s Time] [2022-07-11 23:58:00,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-07-11 23:58:00,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2022-07-11 23:58:00,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.5426829268292683) internal successors, (253), 164 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:00,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 253 transitions. [2022-07-11 23:58:00,850 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 253 transitions. Word has length 58 [2022-07-11 23:58:00,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:58:00,850 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 253 transitions. [2022-07-11 23:58:00,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:00,851 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 253 transitions. [2022-07-11 23:58:00,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-11 23:58:00,852 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:58:00,852 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:58:00,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-07-11 23:58:01,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:58:01,083 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:58:01,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:58:01,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1058688956, now seen corresponding path program 1 times [2022-07-11 23:58:01,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:58:01,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [840174514] [2022-07-11 23:58:01,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:58:01,086 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:58:01,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:58:01,087 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:58:01,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-11 23:58:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:58:02,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-11 23:58:02,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:58:02,503 INFO L356 Elim1Store]: treesize reduction 1105, result has 5.5 percent of original size [2022-07-11 23:58:02,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 69 treesize of output 73 [2022-07-11 23:58:02,638 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-11 23:58:02,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 49 [2022-07-11 23:58:02,670 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-11 23:58:02,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-11 23:58:02,692 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:58:02,693 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:58:02,693 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:58:02,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [840174514] [2022-07-11 23:58:02,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [840174514] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:58:02,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:58:02,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:58:02,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217695935] [2022-07-11 23:58:02,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:58:02,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:58:02,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:58:02,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:58:02,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:58:02,695 INFO L87 Difference]: Start difference. First operand 165 states and 253 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:04,712 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:58:06,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:58:06,618 INFO L93 Difference]: Finished difference Result 310 states and 478 transitions. [2022-07-11 23:58:06,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:58:06,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2022-07-11 23:58:06,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:58:06,622 INFO L225 Difference]: With dead ends: 310 [2022-07-11 23:58:06,622 INFO L226 Difference]: Without dead ends: 166 [2022-07-11 23:58:06,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:58:06,624 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 18 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 21 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-07-11 23:58:06,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 549 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 88 Invalid, 1 Unknown, 16 Unchecked, 3.9s Time] [2022-07-11 23:58:06,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-07-11 23:58:06,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2022-07-11 23:58:06,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 1.5333333333333334) internal successors, (253), 165 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:06,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 253 transitions. [2022-07-11 23:58:06,630 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 253 transitions. Word has length 58 [2022-07-11 23:58:06,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:58:06,631 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 253 transitions. [2022-07-11 23:58:06,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:06,631 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 253 transitions. [2022-07-11 23:58:06,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-11 23:58:06,632 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:58:06,632 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:58:06,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-11 23:58:06,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:58:06,844 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:58:06,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:58:06,844 INFO L85 PathProgramCache]: Analyzing trace with hash -77177339, now seen corresponding path program 1 times [2022-07-11 23:58:06,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:58:06,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1139760340] [2022-07-11 23:58:06,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:58:06,845 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:58:06,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:58:06,846 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:58:06,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-11 23:58:07,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:58:07,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-11 23:58:07,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:58:08,145 INFO L356 Elim1Store]: treesize reduction 1104, result has 5.5 percent of original size [2022-07-11 23:58:08,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 69 treesize of output 73 [2022-07-11 23:58:08,278 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-11 23:58:08,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 49 [2022-07-11 23:58:08,335 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-11 23:58:08,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-11 23:58:08,358 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:58:08,358 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:58:08,358 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:58:08,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1139760340] [2022-07-11 23:58:08,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1139760340] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:58:08,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:58:08,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:58:08,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920892562] [2022-07-11 23:58:08,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:58:08,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:58:08,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:58:08,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:58:08,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:58:08,360 INFO L87 Difference]: Start difference. First operand 166 states and 253 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:10,376 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:58:14,277 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:58:15,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:58:15,933 INFO L93 Difference]: Finished difference Result 323 states and 492 transitions. [2022-07-11 23:58:15,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:58:15,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2022-07-11 23:58:15,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:58:15,936 INFO L225 Difference]: With dead ends: 323 [2022-07-11 23:58:15,936 INFO L226 Difference]: Without dead ends: 178 [2022-07-11 23:58:15,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:58:15,937 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 16 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:58:15,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 523 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 114 Invalid, 1 Unknown, 23 Unchecked, 7.5s Time] [2022-07-11 23:58:15,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-11 23:58:15,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 166. [2022-07-11 23:58:15,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 1.5272727272727273) internal successors, (252), 165 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:15,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 252 transitions. [2022-07-11 23:58:15,943 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 252 transitions. Word has length 58 [2022-07-11 23:58:15,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:58:15,944 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 252 transitions. [2022-07-11 23:58:15,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:15,944 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 252 transitions. [2022-07-11 23:58:15,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-11 23:58:15,945 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:58:15,945 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:58:15,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-07-11 23:58:16,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:58:16,156 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:58:16,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:58:16,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1243675973, now seen corresponding path program 1 times [2022-07-11 23:58:16,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:58:16,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [335028157] [2022-07-11 23:58:16,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:58:16,157 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:58:16,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:58:16,158 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:58:16,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-11 23:58:17,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:58:17,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 688 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-11 23:58:17,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:58:17,441 INFO L356 Elim1Store]: treesize reduction 1104, result has 5.5 percent of original size [2022-07-11 23:58:17,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 69 treesize of output 73 [2022-07-11 23:58:17,594 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-11 23:58:17,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 49 [2022-07-11 23:58:17,652 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-11 23:58:17,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-11 23:58:17,686 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:58:17,688 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:58:17,688 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:58:17,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [335028157] [2022-07-11 23:58:17,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [335028157] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:58:17,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:58:17,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:58:17,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727988335] [2022-07-11 23:58:17,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:58:17,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:58:17,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:58:17,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:58:17,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:58:17,690 INFO L87 Difference]: Start difference. First operand 166 states and 252 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:19,709 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:58:23,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:58:23,675 INFO L93 Difference]: Finished difference Result 321 states and 489 transitions. [2022-07-11 23:58:23,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:58:23,677 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2022-07-11 23:58:23,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:58:23,678 INFO L225 Difference]: With dead ends: 321 [2022-07-11 23:58:23,678 INFO L226 Difference]: Without dead ends: 176 [2022-07-11 23:58:23,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:58:23,679 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 15 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-07-11 23:58:23,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 513 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 111 Invalid, 1 Unknown, 20 Unchecked, 5.9s Time] [2022-07-11 23:58:23,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-07-11 23:58:23,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 166. [2022-07-11 23:58:23,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 1.5212121212121212) internal successors, (251), 165 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:23,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 251 transitions. [2022-07-11 23:58:23,685 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 251 transitions. Word has length 58 [2022-07-11 23:58:23,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:58:23,685 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 251 transitions. [2022-07-11 23:58:23,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:23,685 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 251 transitions. [2022-07-11 23:58:23,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-11 23:58:23,686 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:58:23,687 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:58:23,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-11 23:58:23,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:58:23,887 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:58:23,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:58:23,888 INFO L85 PathProgramCache]: Analyzing trace with hash 967076732, now seen corresponding path program 1 times [2022-07-11 23:58:23,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:58:23,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1312163519] [2022-07-11 23:58:23,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:58:23,888 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:58:23,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:58:23,890 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:58:23,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-11 23:58:24,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:58:24,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-11 23:58:24,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:58:25,273 INFO L356 Elim1Store]: treesize reduction 1105, result has 5.5 percent of original size [2022-07-11 23:58:25,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 69 treesize of output 73 [2022-07-11 23:58:25,392 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-11 23:58:25,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 49 [2022-07-11 23:58:25,427 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-11 23:58:25,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-11 23:58:25,445 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:58:25,446 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:58:25,446 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:58:25,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1312163519] [2022-07-11 23:58:25,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1312163519] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:58:25,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:58:25,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:58:25,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511189401] [2022-07-11 23:58:25,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:58:25,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:58:25,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:58:25,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:58:25,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:58:25,448 INFO L87 Difference]: Start difference. First operand 166 states and 251 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:27,467 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:58:29,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:58:29,030 INFO L93 Difference]: Finished difference Result 312 states and 477 transitions. [2022-07-11 23:58:29,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:58:29,032 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2022-07-11 23:58:29,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:58:29,032 INFO L225 Difference]: With dead ends: 312 [2022-07-11 23:58:29,032 INFO L226 Difference]: Without dead ends: 167 [2022-07-11 23:58:29,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:58:29,033 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 18 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 21 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:58:29,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 520 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 89 Invalid, 1 Unknown, 17 Unchecked, 3.5s Time] [2022-07-11 23:58:29,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-11 23:58:29,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2022-07-11 23:58:29,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 166 states have (on average 1.5120481927710843) internal successors, (251), 166 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:29,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 251 transitions. [2022-07-11 23:58:29,038 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 251 transitions. Word has length 59 [2022-07-11 23:58:29,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:58:29,038 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 251 transitions. [2022-07-11 23:58:29,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:29,038 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 251 transitions. [2022-07-11 23:58:29,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-11 23:58:29,039 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:58:29,039 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:58:29,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-11 23:58:29,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:58:29,240 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:58:29,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:58:29,240 INFO L85 PathProgramCache]: Analyzing trace with hash 800295895, now seen corresponding path program 1 times [2022-07-11 23:58:29,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:58:29,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1903633421] [2022-07-11 23:58:29,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:58:29,241 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:58:29,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:58:29,242 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:58:29,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-11 23:58:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:58:30,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 709 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-11 23:58:30,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:58:30,656 INFO L356 Elim1Store]: treesize reduction 1105, result has 5.5 percent of original size [2022-07-11 23:58:30,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 69 treesize of output 73 [2022-07-11 23:58:30,806 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-11 23:58:30,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 49 [2022-07-11 23:58:30,846 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-11 23:58:30,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-11 23:58:30,882 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:58:30,883 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:58:30,883 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:58:30,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1903633421] [2022-07-11 23:58:30,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1903633421] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:58:30,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:58:30,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:58:30,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510128660] [2022-07-11 23:58:30,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:58:30,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:58:30,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:58:30,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:58:30,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:58:30,884 INFO L87 Difference]: Start difference. First operand 167 states and 251 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:32,906 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:58:34,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:58:34,533 INFO L93 Difference]: Finished difference Result 314 states and 478 transitions. [2022-07-11 23:58:34,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:58:34,535 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2022-07-11 23:58:34,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:58:34,536 INFO L225 Difference]: With dead ends: 314 [2022-07-11 23:58:34,536 INFO L226 Difference]: Without dead ends: 168 [2022-07-11 23:58:34,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:58:34,537 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 18 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 21 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-07-11 23:58:34,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 525 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 90 Invalid, 1 Unknown, 18 Unchecked, 3.6s Time] [2022-07-11 23:58:34,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-11 23:58:34,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2022-07-11 23:58:34,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.5029940119760479) internal successors, (251), 167 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:34,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 251 transitions. [2022-07-11 23:58:34,541 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 251 transitions. Word has length 60 [2022-07-11 23:58:34,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:58:34,542 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 251 transitions. [2022-07-11 23:58:34,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:34,542 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 251 transitions. [2022-07-11 23:58:34,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-11 23:58:34,542 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:58:34,542 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:58:34,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-11 23:58:34,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:58:34,752 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:58:34,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:58:34,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1696711945, now seen corresponding path program 1 times [2022-07-11 23:58:34,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:58:34,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2021991075] [2022-07-11 23:58:34,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:58:34,753 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:58:34,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:58:34,754 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:58:34,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-11 23:58:35,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:58:35,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-11 23:58:35,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:58:36,113 INFO L356 Elim1Store]: treesize reduction 1105, result has 5.5 percent of original size [2022-07-11 23:58:36,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 69 treesize of output 73 [2022-07-11 23:58:36,230 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-11 23:58:36,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 49 [2022-07-11 23:58:36,270 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-11 23:58:36,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-11 23:58:36,291 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:58:36,292 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:58:36,292 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:58:36,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2021991075] [2022-07-11 23:58:36,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2021991075] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:58:36,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:58:36,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:58:36,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285459642] [2022-07-11 23:58:36,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:58:36,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:58:36,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:58:36,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:58:36,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:58:36,294 INFO L87 Difference]: Start difference. First operand 168 states and 251 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:38,310 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:58:39,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:58:39,684 INFO L93 Difference]: Finished difference Result 316 states and 479 transitions. [2022-07-11 23:58:39,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:58:39,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2022-07-11 23:58:39,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:58:39,687 INFO L225 Difference]: With dead ends: 316 [2022-07-11 23:58:39,687 INFO L226 Difference]: Without dead ends: 169 [2022-07-11 23:58:39,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:58:39,688 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 18 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 21 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:58:39,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 516 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 91 Invalid, 1 Unknown, 19 Unchecked, 3.4s Time] [2022-07-11 23:58:39,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-07-11 23:58:39,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2022-07-11 23:58:39,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 1.494047619047619) internal successors, (251), 168 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:39,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 251 transitions. [2022-07-11 23:58:39,693 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 251 transitions. Word has length 61 [2022-07-11 23:58:39,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:58:39,693 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 251 transitions. [2022-07-11 23:58:39,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:39,693 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 251 transitions. [2022-07-11 23:58:39,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-11 23:58:39,694 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:58:39,694 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:58:39,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-11 23:58:39,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:58:39,895 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:58:39,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:58:39,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1023713137, now seen corresponding path program 1 times [2022-07-11 23:58:39,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:58:39,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1310277139] [2022-07-11 23:58:39,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:58:39,896 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:58:39,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:58:39,897 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:58:39,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-11 23:58:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:58:41,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-11 23:58:41,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:58:41,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:41,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:41,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:41,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:41,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:58:41,024 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:58:41,453 INFO L356 Elim1Store]: treesize reduction 1109, result has 5.5 percent of original size [2022-07-11 23:58:41,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 52 treesize of output 73 [2022-07-11 23:58:41,851 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-11 23:58:41,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 22 [2022-07-11 23:58:41,875 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:58:41,875 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:58:41,876 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:58:41,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1310277139] [2022-07-11 23:58:41,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1310277139] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:58:41,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:58:41,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:58:41,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045353918] [2022-07-11 23:58:41,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:58:41,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:58:41,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:58:41,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:58:41,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:58:41,877 INFO L87 Difference]: Start difference. First operand 169 states and 251 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:43,898 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:58:47,133 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:58:50,052 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:58:51,552 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:58:52,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:58:52,120 INFO L93 Difference]: Finished difference Result 349 states and 525 transitions. [2022-07-11 23:58:52,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:58:52,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2022-07-11 23:58:52,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:58:52,124 INFO L225 Difference]: With dead ends: 349 [2022-07-11 23:58:52,124 INFO L226 Difference]: Without dead ends: 201 [2022-07-11 23:58:52,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:58:52,125 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 22 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:58:52,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 535 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 150 Invalid, 1 Unknown, 0 Unchecked, 10.2s Time] [2022-07-11 23:58:52,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-07-11 23:58:52,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 191. [2022-07-11 23:58:52,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 190 states have (on average 1.4947368421052631) internal successors, (284), 190 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-11 23:58:52,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 284 transitions. [2022-07-11 23:58:52,131 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 284 transitions. Word has length 61 [2022-07-11 23:58:52,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:58:52,131 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 284 transitions. [2022-07-11 23:58:52,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:52,131 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 284 transitions. [2022-07-11 23:58:52,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-11 23:58:52,132 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:58:52,132 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:58:52,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-07-11 23:58:52,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:58:52,358 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:58:52,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:58:52,358 INFO L85 PathProgramCache]: Analyzing trace with hash 545325792, now seen corresponding path program 1 times [2022-07-11 23:58:52,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:58:52,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [652578087] [2022-07-11 23:58:52,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:58:52,359 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:58:52,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:58:52,361 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:58:52,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-11 23:58:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:58:53,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-11 23:58:53,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:58:53,812 INFO L356 Elim1Store]: treesize reduction 1100, result has 5.5 percent of original size [2022-07-11 23:58:53,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-11 23:58:53,857 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-11 23:58:53,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-11 23:58:53,874 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:58:53,875 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:58:53,875 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:58:53,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [652578087] [2022-07-11 23:58:53,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [652578087] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:58:53,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:58:53,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:58:53,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876868688] [2022-07-11 23:58:53,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:58:53,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:58:53,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:58:53,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:58:53,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:58:53,877 INFO L87 Difference]: Start difference. First operand 191 states and 284 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:58:55,899 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:58:58,182 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:59:02,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:59:02,301 INFO L93 Difference]: Finished difference Result 361 states and 544 transitions. [2022-07-11 23:59:02,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:59:02,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2022-07-11 23:59:02,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:59:02,304 INFO L225 Difference]: With dead ends: 361 [2022-07-11 23:59:02,304 INFO L226 Difference]: Without dead ends: 191 [2022-07-11 23:59:02,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:59:02,305 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 10 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:59:02,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 547 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 1 Unknown, 14 Unchecked, 8.4s Time] [2022-07-11 23:59:02,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-07-11 23:59:02,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2022-07-11 23:59:02,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 190 states have (on average 1.4894736842105263) internal successors, (283), 190 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:59:02,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 283 transitions. [2022-07-11 23:59:02,316 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 283 transitions. Word has length 74 [2022-07-11 23:59:02,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:59:02,316 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 283 transitions. [2022-07-11 23:59:02,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:59:02,316 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 283 transitions. [2022-07-11 23:59:02,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-11 23:59:02,317 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:59:02,317 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:59:02,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-11 23:59:02,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:59:02,518 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:59:02,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:59:02,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1586771530, now seen corresponding path program 1 times [2022-07-11 23:59:02,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:59:02,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1764390322] [2022-07-11 23:59:02,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:59:02,519 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:59:02,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:59:02,520 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:59:02,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-11 23:59:03,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:59:03,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-11 23:59:03,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:59:04,012 INFO L356 Elim1Store]: treesize reduction 1100, result has 5.5 percent of original size [2022-07-11 23:59:04,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-11 23:59:04,075 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-11 23:59:04,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-11 23:59:04,093 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:59:04,093 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:59:04,094 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:59:04,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1764390322] [2022-07-11 23:59:04,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1764390322] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:59:04,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:59:04,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:59:04,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87315875] [2022-07-11 23:59:04,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:59:04,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:59:04,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:59:04,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:59:04,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:59:04,095 INFO L87 Difference]: Start difference. First operand 191 states and 283 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:59:06,116 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:59:07,972 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:59:11,797 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:59:12,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:59:12,116 INFO L93 Difference]: Finished difference Result 363 states and 544 transitions. [2022-07-11 23:59:12,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:59:12,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2022-07-11 23:59:12,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:59:12,119 INFO L225 Difference]: With dead ends: 363 [2022-07-11 23:59:12,119 INFO L226 Difference]: Without dead ends: 193 [2022-07-11 23:59:12,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:59:12,120 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 11 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:59:12,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 543 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 1 Unknown, 18 Unchecked, 8.0s Time] [2022-07-11 23:59:12,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-07-11 23:59:12,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 191. [2022-07-11 23:59:12,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 190 states have (on average 1.4842105263157894) internal successors, (282), 190 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-11 23:59:12,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 282 transitions. [2022-07-11 23:59:12,125 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 282 transitions. Word has length 75 [2022-07-11 23:59:12,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:59:12,126 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 282 transitions. [2022-07-11 23:59:12,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:59:12,126 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 282 transitions. [2022-07-11 23:59:12,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-11 23:59:12,127 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:59:12,127 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:59:12,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-11 23:59:12,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:59:12,348 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:59:12,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:59:12,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1387342454, now seen corresponding path program 1 times [2022-07-11 23:59:12,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:59:12,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [269939831] [2022-07-11 23:59:12,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:59:12,349 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:59:12,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:59:12,350 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:59:12,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-11 23:59:13,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:59:13,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-11 23:59:13,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:59:13,866 INFO L356 Elim1Store]: treesize reduction 1100, result has 5.5 percent of original size [2022-07-11 23:59:13,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 73 [2022-07-11 23:59:13,923 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-11 23:59:13,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 13 [2022-07-11 23:59:13,941 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:59:13,942 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:59:13,942 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:59:13,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [269939831] [2022-07-11 23:59:13,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [269939831] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:59:13,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:59:13,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:59:13,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258487064] [2022-07-11 23:59:13,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:59:13,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:59:13,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:59:13,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:59:13,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:59:13,944 INFO L87 Difference]: Start difference. First operand 191 states and 282 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:59:15,965 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:59:17,941 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:59:21,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:59:21,206 INFO L93 Difference]: Finished difference Result 361 states and 540 transitions. [2022-07-11 23:59:21,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:59:21,208 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2022-07-11 23:59:21,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:59:21,209 INFO L225 Difference]: With dead ends: 361 [2022-07-11 23:59:21,209 INFO L226 Difference]: Without dead ends: 191 [2022-07-11 23:59:21,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:59:21,210 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 10 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:59:21,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 551 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 1 Unknown, 17 Unchecked, 7.2s Time] [2022-07-11 23:59:21,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-07-11 23:59:21,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2022-07-11 23:59:21,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 190 states have (on average 1.4789473684210526) internal successors, (281), 190 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-11 23:59:21,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 281 transitions. [2022-07-11 23:59:21,215 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 281 transitions. Word has length 75 [2022-07-11 23:59:21,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:59:21,215 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 281 transitions. [2022-07-11 23:59:21,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:59:21,216 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 281 transitions. [2022-07-11 23:59:21,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-11 23:59:21,216 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:59:21,216 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:59:21,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-11 23:59:21,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:59:21,432 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:59:21,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:59:21,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1369586491, now seen corresponding path program 1 times [2022-07-11 23:59:21,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:59:21,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1368628733] [2022-07-11 23:59:21,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:59:21,433 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:59:21,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:59:21,434 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:59:21,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-11 23:59:22,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:59:22,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 746 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-11 23:59:22,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:59:22,806 INFO L356 Elim1Store]: treesize reduction 180, result has 14.3 percent of original size [2022-07-11 23:59:22,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 39 [2022-07-11 23:59:22,960 INFO L356 Elim1Store]: treesize reduction 324, result has 10.2 percent of original size [2022-07-11 23:59:22,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 51 [2022-07-11 23:59:23,114 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-11 23:59:23,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 15 [2022-07-11 23:59:23,161 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-11 23:59:23,161 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:59:23,161 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:59:23,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1368628733] [2022-07-11 23:59:23,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1368628733] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:59:23,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:59:23,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:59:23,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480930905] [2022-07-11 23:59:23,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:59:23,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:59:23,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:59:23,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:59:23,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:59:23,163 INFO L87 Difference]: Start difference. First operand 191 states and 281 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:59:25,186 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:59:30,129 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:59:32,784 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:59:33,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:59:33,231 INFO L93 Difference]: Finished difference Result 443 states and 666 transitions. [2022-07-11 23:59:33,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:59:33,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 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 83 [2022-07-11 23:59:33,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:59:33,234 INFO L225 Difference]: With dead ends: 443 [2022-07-11 23:59:33,234 INFO L226 Difference]: Without dead ends: 273 [2022-07-11 23:59:33,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:59:33,235 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 70 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:59:33,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 505 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 163 Invalid, 1 Unknown, 68 Unchecked, 10.0s Time] [2022-07-11 23:59:33,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-07-11 23:59:33,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 231. [2022-07-11 23:59:33,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 1.517391304347826) internal successors, (349), 230 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:59:33,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 349 transitions. [2022-07-11 23:59:33,242 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 349 transitions. Word has length 83 [2022-07-11 23:59:33,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:59:33,242 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 349 transitions. [2022-07-11 23:59:33,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:59:33,243 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 349 transitions. [2022-07-11 23:59:33,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-11 23:59:33,243 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:59:33,244 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:59:33,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-11 23:59:33,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-11 23:59:33,464 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:59:33,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:59:33,464 INFO L85 PathProgramCache]: Analyzing trace with hash -2220807, now seen corresponding path program 1 times [2022-07-11 23:59:33,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-11 23:59:33,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [423649903] [2022-07-11 23:59:33,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:59:33,465 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-11 23:59:33,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-11 23:59:33,466 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-11 23:59:33,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-11 23:59:34,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:59:34,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 746 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-11 23:59:34,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:59:34,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:59:34,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:59:34,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:59:34,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:59:34,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:59:34,648 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:59:34,761 INFO L356 Elim1Store]: treesize reduction 190, result has 12.8 percent of original size [2022-07-11 23:59:34,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 38 [2022-07-11 23:59:35,155 INFO L356 Elim1Store]: treesize reduction 825, result has 7.2 percent of original size [2022-07-11 23:59:35,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 13 case distinctions, treesize of input 66 treesize of output 86 [2022-07-11 23:59:35,538 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-11 23:59:35,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 23 [2022-07-11 23:59:35,560 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-11 23:59:35,560 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:59:35,560 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-11 23:59:35,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [423649903] [2022-07-11 23:59:35,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [423649903] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:59:35,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:59:35,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:59:35,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725535481] [2022-07-11 23:59:35,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:59:35,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:59:35,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-11 23:59:35,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:59:35,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:59:35,561 INFO L87 Difference]: Start difference. First operand 231 states and 349 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:59:37,579 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:59:41,428 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:59:42,668 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []