./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5317dae 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/forester-heap/sll-rb-cnstr_1-1.i -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 6070ac475d5b3c3d5905eb0c203232134efabc1c427fcfbbf8cf82789693617b --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 00:58:46,209 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 00:58:46,212 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 00:58:46,250 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 00:58:46,251 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 00:58:46,254 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 00:58:46,256 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 00:58:46,260 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 00:58:46,262 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 00:58:46,266 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 00:58:46,268 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 00:58:46,269 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 00:58:46,270 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 00:58:46,272 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 00:58:46,273 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 00:58:46,274 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 00:58:46,275 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 00:58:46,276 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 00:58:46,277 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 00:58:46,282 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 00:58:46,283 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 00:58:46,284 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 00:58:46,285 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 00:58:46,286 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 00:58:46,294 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 00:58:46,295 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 00:58:46,295 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 00:58:46,297 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 00:58:46,297 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 00:58:46,298 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 00:58:46,298 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 00:58:46,299 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 00:58:46,300 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 00:58:46,301 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 00:58:46,301 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 00:58:46,301 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 00:58:46,302 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 00:58:46,302 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 00:58:46,302 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 00:58:46,304 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 00:58:46,305 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 00:58:46,305 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-16 00:58:46,333 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 00:58:46,333 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 00:58:46,334 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 00:58:46,334 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 00:58:46,335 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 00:58:46,335 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 00:58:46,336 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 00:58:46,336 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 00:58:46,336 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 00:58:46,336 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 00:58:46,337 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 00:58:46,337 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 00:58:46,338 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 00:58:46,338 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 00:58:46,338 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-16 00:58:46,338 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 00:58:46,338 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-16 00:58:46,339 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 00:58:46,339 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 00:58:46,339 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 00:58:46,339 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-16 00:58:46,340 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 00:58:46,340 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 00:58:46,340 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 00:58:46,340 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 00:58:46,340 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 00:58:46,341 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 00:58:46,341 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-16 00:58:46,341 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 00:58:46,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 00:58:46,342 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 00:58:46,342 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-16 00:58:46,342 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 00:58:46,342 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 00:58:46,343 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 00:58:46,343 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 6070ac475d5b3c3d5905eb0c203232134efabc1c427fcfbbf8cf82789693617b [2023-02-16 00:58:46,576 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 00:58:46,601 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 00:58:46,604 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 00:58:46,605 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 00:58:46,605 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 00:58:46,606 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i [2023-02-16 00:58:47,758 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 00:58:47,990 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 00:58:47,990 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i [2023-02-16 00:58:48,000 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f0f324e9/d7a840e22abb43cc90b9cfacfb193303/FLAG5ab4fbd9b [2023-02-16 00:58:48,013 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f0f324e9/d7a840e22abb43cc90b9cfacfb193303 [2023-02-16 00:58:48,015 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 00:58:48,016 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 00:58:48,017 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 00:58:48,017 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 00:58:48,020 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 00:58:48,021 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 12:58:48" (1/1) ... [2023-02-16 00:58:48,022 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11b69ccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:58:48, skipping insertion in model container [2023-02-16 00:58:48,022 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 12:58:48" (1/1) ... [2023-02-16 00:58:48,028 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 00:58:48,082 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 00:58:48,263 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i[22480,22493] [2023-02-16 00:58:48,267 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i[22552,22565] [2023-02-16 00:58:48,268 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i[22704,22717] [2023-02-16 00:58:48,269 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i[22778,22791] [2023-02-16 00:58:48,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 00:58:48,284 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 00:58:48,324 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i[22480,22493] [2023-02-16 00:58:48,325 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i[22552,22565] [2023-02-16 00:58:48,326 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i[22704,22717] [2023-02-16 00:58:48,326 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i[22778,22791] [2023-02-16 00:58:48,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 00:58:48,349 INFO L208 MainTranslator]: Completed translation [2023-02-16 00:58:48,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:58:48 WrapperNode [2023-02-16 00:58:48,350 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 00:58:48,351 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 00:58:48,351 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 00:58:48,351 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 00:58:48,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:58:48" (1/1) ... [2023-02-16 00:58:48,368 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:58:48" (1/1) ... [2023-02-16 00:58:48,385 INFO L138 Inliner]: procedures = 119, calls = 32, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 116 [2023-02-16 00:58:48,386 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 00:58:48,386 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 00:58:48,386 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 00:58:48,387 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 00:58:48,394 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:58:48" (1/1) ... [2023-02-16 00:58:48,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:58:48" (1/1) ... [2023-02-16 00:58:48,397 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:58:48" (1/1) ... [2023-02-16 00:58:48,405 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:58:48" (1/1) ... [2023-02-16 00:58:48,415 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:58:48" (1/1) ... [2023-02-16 00:58:48,420 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:58:48" (1/1) ... [2023-02-16 00:58:48,423 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:58:48" (1/1) ... [2023-02-16 00:58:48,430 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:58:48" (1/1) ... [2023-02-16 00:58:48,433 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 00:58:48,438 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 00:58:48,438 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 00:58:48,439 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 00:58:48,439 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:58:48" (1/1) ... [2023-02-16 00:58:48,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 00:58:48,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:58:48,468 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) [2023-02-16 00:58:48,474 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 [2023-02-16 00:58:48,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-16 00:58:48,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-16 00:58:48,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-16 00:58:48,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 00:58:48,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-16 00:58:48,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-16 00:58:48,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-16 00:58:48,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 00:58:48,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 00:58:48,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 00:58:48,651 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 00:58:48,665 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 00:58:48,847 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 00:58:48,852 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 00:58:48,852 INFO L300 CfgBuilder]: Removed 11 assume(true) statements. [2023-02-16 00:58:48,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:58:48 BoogieIcfgContainer [2023-02-16 00:58:48,854 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 00:58:48,856 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 00:58:48,856 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 00:58:48,859 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 00:58:48,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 12:58:48" (1/3) ... [2023-02-16 00:58:48,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42399268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 12:58:48, skipping insertion in model container [2023-02-16 00:58:48,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:58:48" (2/3) ... [2023-02-16 00:58:48,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42399268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 12:58:48, skipping insertion in model container [2023-02-16 00:58:48,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:58:48" (3/3) ... [2023-02-16 00:58:48,866 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1-1.i [2023-02-16 00:58:48,883 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 00:58:48,883 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-02-16 00:58:48,918 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 00:58:48,923 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@33b72361, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 00:58:48,924 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-02-16 00:58:48,927 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 32 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:58:48,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-16 00:58:48,931 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:58:48,932 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-16 00:58:48,932 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-02-16 00:58:48,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:58:48,937 INFO L85 PathProgramCache]: Analyzing trace with hash 889968582, now seen corresponding path program 1 times [2023-02-16 00:58:48,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:58:48,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054543020] [2023-02-16 00:58:48,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:58:48,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:58:49,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:58:49,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:58:49,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:58:49,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054543020] [2023-02-16 00:58:49,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054543020] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:58:49,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:58:49,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 00:58:49,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651340572] [2023-02-16 00:58:49,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:58:49,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-16 00:58:49,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:58:49,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-16 00:58:49,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 00:58:49,180 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 32 states have internal predecessors, (53), 0 states have call successors, (0), 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 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:58:49,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:58:49,203 INFO L93 Difference]: Finished difference Result 61 states and 98 transitions. [2023-02-16 00:58:49,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-16 00:58:49,205 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2023-02-16 00:58:49,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:58:49,210 INFO L225 Difference]: With dead ends: 61 [2023-02-16 00:58:49,211 INFO L226 Difference]: Without dead ends: 27 [2023-02-16 00:58:49,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 00:58:49,219 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:58:49,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 00:58:49,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-02-16 00:58:49,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-02-16 00:58:49,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:58:49,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2023-02-16 00:58:49,253 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 6 [2023-02-16 00:58:49,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:58:49,253 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2023-02-16 00:58:49,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:58:49,254 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2023-02-16 00:58:49,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-16 00:58:49,254 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:58:49,254 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:58:49,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 00:58:49,255 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-02-16 00:58:49,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:58:49,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1806853233, now seen corresponding path program 1 times [2023-02-16 00:58:49,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:58:49,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474653191] [2023-02-16 00:58:49,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:58:49,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:58:49,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:58:49,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:58:49,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:58:49,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474653191] [2023-02-16 00:58:49,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474653191] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:58:49,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:58:49,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 00:58:49,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063736535] [2023-02-16 00:58:49,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:58:49,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 00:58:49,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:58:49,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 00:58:49,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 00:58:49,384 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:58:49,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:58:49,429 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2023-02-16 00:58:49,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 00:58:49,430 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2023-02-16 00:58:49,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:58:49,430 INFO L225 Difference]: With dead ends: 30 [2023-02-16 00:58:49,430 INFO L226 Difference]: Without dead ends: 28 [2023-02-16 00:58:49,431 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 [2023-02-16 00:58:49,432 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 40 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:58:49,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 28 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 00:58:49,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-02-16 00:58:49,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2023-02-16 00:58:49,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:58:49,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2023-02-16 00:58:49,438 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 7 [2023-02-16 00:58:49,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:58:49,438 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2023-02-16 00:58:49,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:58:49,439 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2023-02-16 00:58:49,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-16 00:58:49,439 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:58:49,439 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:58:49,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-16 00:58:49,440 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-02-16 00:58:49,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:58:49,440 INFO L85 PathProgramCache]: Analyzing trace with hash -856511048, now seen corresponding path program 1 times [2023-02-16 00:58:49,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:58:49,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351839551] [2023-02-16 00:58:49,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:58:49,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:58:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:58:49,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:58:49,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:58:49,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351839551] [2023-02-16 00:58:49,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351839551] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:58:49,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:58:49,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 00:58:49,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156113295] [2023-02-16 00:58:49,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:58:49,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 00:58:49,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:58:49,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 00:58:49,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 00:58:49,760 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:58:49,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:58:49,905 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2023-02-16 00:58:49,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 00:58:49,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2023-02-16 00:58:49,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:58:49,907 INFO L225 Difference]: With dead ends: 50 [2023-02-16 00:58:49,909 INFO L226 Difference]: Without dead ends: 48 [2023-02-16 00:58:49,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-16 00:58:49,910 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 32 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:58:49,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 53 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:58:49,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-02-16 00:58:49,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 32. [2023-02-16 00:58:49,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:58:49,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2023-02-16 00:58:49,925 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 10 [2023-02-16 00:58:49,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:58:49,926 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2023-02-16 00:58:49,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:58:49,926 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2023-02-16 00:58:49,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-16 00:58:49,926 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:58:49,927 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:58:49,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-16 00:58:49,927 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-02-16 00:58:49,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:58:49,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1594081566, now seen corresponding path program 1 times [2023-02-16 00:58:49,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:58:49,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660729882] [2023-02-16 00:58:49,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:58:49,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:58:49,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:58:50,457 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:58:50,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:58:50,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660729882] [2023-02-16 00:58:50,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660729882] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:58:50,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916254074] [2023-02-16 00:58:50,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:58:50,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:58:50,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:58:50,464 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) [2023-02-16 00:58:50,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-16 00:58:50,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:58:50,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 32 conjunts are in the unsatisfiable core [2023-02-16 00:58:50,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:58:50,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-02-16 00:58:50,649 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 00:58:50,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:58:50,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2023-02-16 00:58:50,728 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 00:58:50,731 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 16 treesize of output 22 [2023-02-16 00:58:50,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 3 [2023-02-16 00:58:50,760 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 00:58:50,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-16 00:58:50,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:58:50,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:58:50,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2023-02-16 00:58:50,859 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-02-16 00:58:50,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-02-16 00:58:50,898 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2023-02-16 00:58:50,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:58:50,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:58:51,034 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:58:51,038 INFO L321 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-02-16 00:58:51,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 1 [2023-02-16 00:58:51,039 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:58:51,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916254074] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:58:51,039 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:58:51,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-02-16 00:58:51,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202881173] [2023-02-16 00:58:51,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:58:51,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-16 00:58:51,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:58:51,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-16 00:58:51,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2023-02-16 00:58:51,042 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:58:51,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:58:51,246 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2023-02-16 00:58:51,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 00:58:51,247 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-16 00:58:51,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:58:51,250 INFO L225 Difference]: With dead ends: 38 [2023-02-16 00:58:51,250 INFO L226 Difference]: Without dead ends: 36 [2023-02-16 00:58:51,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2023-02-16 00:58:51,251 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 63 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:58:51,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 57 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:58:51,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-02-16 00:58:51,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 23. [2023-02-16 00:58:51,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:58:51,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2023-02-16 00:58:51,257 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 13 [2023-02-16 00:58:51,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:58:51,257 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2023-02-16 00:58:51,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:58:51,258 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2023-02-16 00:58:51,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-16 00:58:51,258 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:58:51,259 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:58:51,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-16 00:58:51,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:58:51,465 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-02-16 00:58:51,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:58:51,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1689639521, now seen corresponding path program 1 times [2023-02-16 00:58:51,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:58:51,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114450116] [2023-02-16 00:58:51,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:58:51,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:58:51,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:58:51,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:58:51,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:58:51,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114450116] [2023-02-16 00:58:51,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114450116] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:58:51,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:58:51,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 00:58:51,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185110685] [2023-02-16 00:58:51,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:58:51,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 00:58:51,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:58:51,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 00:58:51,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 00:58:51,545 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:58:51,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:58:51,614 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2023-02-16 00:58:51,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 00:58:51,614 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2023-02-16 00:58:51,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:58:51,615 INFO L225 Difference]: With dead ends: 38 [2023-02-16 00:58:51,615 INFO L226 Difference]: Without dead ends: 26 [2023-02-16 00:58:51,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-16 00:58:51,616 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:58:51,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 52 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 00:58:51,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-02-16 00:58:51,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2023-02-16 00:58:51,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:58:51,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2023-02-16 00:58:51,629 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 14 [2023-02-16 00:58:51,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:58:51,629 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2023-02-16 00:58:51,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:58:51,630 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2023-02-16 00:58:51,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-16 00:58:51,630 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:58:51,630 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:58:51,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-16 00:58:51,631 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-02-16 00:58:51,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:58:51,632 INFO L85 PathProgramCache]: Analyzing trace with hash 2084817261, now seen corresponding path program 1 times [2023-02-16 00:58:51,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:58:51,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22113315] [2023-02-16 00:58:51,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:58:51,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:58:51,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:58:51,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:58:51,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:58:51,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22113315] [2023-02-16 00:58:51,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22113315] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:58:51,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456749118] [2023-02-16 00:58:51,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:58:51,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:58:51,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:58:51,744 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:58:51,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-16 00:58:51,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:58:51,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-16 00:58:51,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:58:51,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:58:51,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-02-16 00:58:51,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:58:51,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-02-16 00:58:51,895 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2023-02-16 00:58:51,898 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2023-02-16 00:58:51,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:58:51,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:58:51,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:58:51,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456749118] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:58:51,951 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:58:51,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2023-02-16 00:58:51,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501540015] [2023-02-16 00:58:51,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:58:51,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 00:58:51,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:58:51,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 00:58:51,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-16 00:58:51,961 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:58:52,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:58:52,053 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2023-02-16 00:58:52,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 00:58:52,054 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 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 17 [2023-02-16 00:58:52,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:58:52,054 INFO L225 Difference]: With dead ends: 49 [2023-02-16 00:58:52,054 INFO L226 Difference]: Without dead ends: 27 [2023-02-16 00:58:52,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-02-16 00:58:52,055 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 14 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:58:52,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 90 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:58:52,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-02-16 00:58:52,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-02-16 00:58:52,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:58:52,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2023-02-16 00:58:52,061 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 17 [2023-02-16 00:58:52,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:58:52,061 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2023-02-16 00:58:52,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:58:52,062 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2023-02-16 00:58:52,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-16 00:58:52,062 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:58:52,062 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:58:52,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-16 00:58:52,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-02-16 00:58:52,268 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-02-16 00:58:52,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:58:52,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1088473273, now seen corresponding path program 1 times [2023-02-16 00:58:52,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:58:52,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314255198] [2023-02-16 00:58:52,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:58:52,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:58:52,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:58:52,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:58:52,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:58:52,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314255198] [2023-02-16 00:58:52,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314255198] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:58:52,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482996982] [2023-02-16 00:58:52,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:58:52,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:58:52,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:58:52,744 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:58:52,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-16 00:58:52,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:58:52,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 60 conjunts are in the unsatisfiable core [2023-02-16 00:58:52,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:58:52,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-02-16 00:58:52,880 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2023-02-16 00:58:52,890 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 00:58:52,890 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-16 00:58:52,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2023-02-16 00:58:52,920 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 00:58:52,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-16 00:58:52,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2023-02-16 00:58:52,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 00:58:52,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:58:52,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:58:52,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 48 [2023-02-16 00:58:52,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2023-02-16 00:58:52,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:58:53,009 INFO L321 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-02-16 00:58:53,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 54 [2023-02-16 00:58:53,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 15 [2023-02-16 00:58:53,036 INFO L321 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-02-16 00:58:53,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 46 [2023-02-16 00:58:53,198 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-02-16 00:58:53,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 53 [2023-02-16 00:58:53,247 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 00:58:53,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 23 [2023-02-16 00:58:53,252 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:58:53,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:58:53,285 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:58:53,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 44 [2023-02-16 00:58:53,291 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:58:53,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 47 [2023-02-16 00:58:53,357 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:58:53,358 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 65 [2023-02-16 00:58:53,364 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:58:53,367 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 49 [2023-02-16 00:58:53,420 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:58:53,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 734 treesize of output 649 [2023-02-16 00:58:53,449 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:58:53,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 679 treesize of output 575 [2023-02-16 00:58:53,469 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:58:53,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 443 treesize of output 405 [2023-02-16 00:58:53,494 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:58:53,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1098 treesize of output 1033 [2023-02-16 00:58:53,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1018 treesize of output 946 [2023-02-16 00:58:53,536 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:58:53,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 952 treesize of output 922 [2023-02-16 00:59:12,575 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:59:12,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482996982] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:59:12,576 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:59:12,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2023-02-16 00:59:12,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264743163] [2023-02-16 00:59:12,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:59:12,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-16 00:59:12,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:59:12,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-16 00:59:12,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=173, Unknown=1, NotChecked=0, Total=210 [2023-02-16 00:59:12,579 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:59:13,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:59:13,554 INFO L93 Difference]: Finished difference Result 121 states and 139 transitions. [2023-02-16 00:59:13,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-16 00:59:13,557 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 0 states have call successors, (0), 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 20 [2023-02-16 00:59:13,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:59:13,558 INFO L225 Difference]: With dead ends: 121 [2023-02-16 00:59:13,558 INFO L226 Difference]: Without dead ends: 119 [2023-02-16 00:59:13,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=125, Invalid=630, Unknown=1, NotChecked=0, Total=756 [2023-02-16 00:59:13,559 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 135 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 20 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-16 00:59:13,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 215 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 210 Invalid, 12 Unknown, 0 Unchecked, 0.7s Time] [2023-02-16 00:59:13,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-02-16 00:59:13,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 45. [2023-02-16 00:59:13,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 44 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:59:13,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2023-02-16 00:59:13,568 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 20 [2023-02-16 00:59:13,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:59:13,568 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2023-02-16 00:59:13,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:59:13,569 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2023-02-16 00:59:13,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-16 00:59:13,569 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:59:13,569 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:59:13,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-16 00:59:13,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:59:13,775 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-02-16 00:59:13,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:59:13,776 INFO L85 PathProgramCache]: Analyzing trace with hash -67404919, now seen corresponding path program 1 times [2023-02-16 00:59:13,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:59:13,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547416868] [2023-02-16 00:59:13,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:59:13,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:59:13,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:59:14,342 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:59:14,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:59:14,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547416868] [2023-02-16 00:59:14,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547416868] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:59:14,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472993721] [2023-02-16 00:59:14,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:59:14,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:59:14,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:59:14,345 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:59:14,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-16 00:59:14,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:59:14,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 42 conjunts are in the unsatisfiable core [2023-02-16 00:59:14,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:59:14,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-02-16 00:59:14,466 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2023-02-16 00:59:14,475 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 00:59:14,476 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-16 00:59:14,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2023-02-16 00:59:14,495 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 00:59:14,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-16 00:59:14,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2023-02-16 00:59:14,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 00:59:14,526 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 00:59:14,526 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 47 [2023-02-16 00:59:14,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-16 00:59:14,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-02-16 00:59:14,682 INFO L350 Elim1Store]: Elim1 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 29 treesize of output 17 [2023-02-16 00:59:14,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 00:59:14,718 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:59:14,719 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:59:14,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2023-02-16 00:59:14,736 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:59:14,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:59:14,796 INFO L350 Elim1Store]: Elim1 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 74 treesize of output 54 [2023-02-16 00:59:14,805 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_421 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_421) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) |c_ULTIMATE.start_main_~end~0#1.offset|)) (forall ((v_ArrVal_420 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_420) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) |c_ULTIMATE.start_main_~end~0#1.base|))) is different from false [2023-02-16 00:59:14,812 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:59:14,812 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2023-02-16 00:59:14,816 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:59:14,817 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 42 [2023-02-16 00:59:14,823 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:59:14,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 47 [2023-02-16 00:59:14,832 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:59:14,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 53 [2023-02-16 00:59:14,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 37 treesize of output 35 [2023-02-16 00:59:14,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 35 treesize of output 33 [2023-02-16 00:59:14,907 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:59:14,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472993721] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:59:14,907 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:59:14,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 20 [2023-02-16 00:59:14,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210471483] [2023-02-16 00:59:14,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:59:14,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-16 00:59:14,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:59:14,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-16 00:59:14,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=293, Unknown=1, NotChecked=34, Total=380 [2023-02-16 00:59:14,909 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 20 states, 20 states have (on average 2.45) internal successors, (49), 20 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:59:15,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:59:15,455 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2023-02-16 00:59:15,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-16 00:59:15,456 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.45) internal successors, (49), 20 states have internal predecessors, (49), 0 states have call successors, (0), 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 20 [2023-02-16 00:59:15,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:59:15,456 INFO L225 Difference]: With dead ends: 84 [2023-02-16 00:59:15,456 INFO L226 Difference]: Without dead ends: 72 [2023-02-16 00:59:15,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=568, Unknown=1, NotChecked=50, Total=756 [2023-02-16 00:59:15,457 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 47 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 00:59:15,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 267 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 302 Invalid, 0 Unknown, 28 Unchecked, 0.3s Time] [2023-02-16 00:59:15,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-02-16 00:59:15,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 54. [2023-02-16 00:59:15,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 53 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) [2023-02-16 00:59:15,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2023-02-16 00:59:15,468 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 20 [2023-02-16 00:59:15,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:59:15,469 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2023-02-16 00:59:15,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.45) internal successors, (49), 20 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:59:15,469 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2023-02-16 00:59:15,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-16 00:59:15,470 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:59:15,470 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] [2023-02-16 00:59:15,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-16 00:59:15,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:59:15,676 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-02-16 00:59:15,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:59:15,676 INFO L85 PathProgramCache]: Analyzing trace with hash 299800945, now seen corresponding path program 1 times [2023-02-16 00:59:15,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:59:15,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140970872] [2023-02-16 00:59:15,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:59:15,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:59:15,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:59:16,245 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:59:16,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:59:16,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140970872] [2023-02-16 00:59:16,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140970872] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:59:16,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710386242] [2023-02-16 00:59:16,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:59:16,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:59:16,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:59:16,248 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:59:16,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-16 00:59:16,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:59:16,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 58 conjunts are in the unsatisfiable core [2023-02-16 00:59:16,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:59:16,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-02-16 00:59:16,367 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2023-02-16 00:59:16,376 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 00:59:16,377 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-16 00:59:16,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2023-02-16 00:59:16,388 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2023-02-16 00:59:16,399 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 00:59:16,399 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-16 00:59:16,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2023-02-16 00:59:16,421 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 00:59:16,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-16 00:59:16,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:59:16,485 INFO L321 Elim1Store]: treesize reduction 31, result has 31.1 percent of original size [2023-02-16 00:59:16,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 51 [2023-02-16 00:59:16,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:59:16,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:59:16,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2023-02-16 00:59:16,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 11 [2023-02-16 00:59:16,501 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 17 [2023-02-16 00:59:16,515 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-02-16 00:59:16,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-02-16 00:59:16,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-02-16 00:59:16,718 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:59:16,726 INFO L321 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2023-02-16 00:59:16,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 46 [2023-02-16 00:59:16,734 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-16 00:59:16,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 22 [2023-02-16 00:59:16,743 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 00:59:16,745 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:59:16,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:59:16,855 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:59:16,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 95 [2023-02-16 00:59:16,860 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:59:16,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 88 [2023-02-16 00:59:16,864 INFO L350 Elim1Store]: Elim1 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 251 treesize of output 173 [2023-02-16 00:59:16,959 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:59:16,959 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 140 [2023-02-16 00:59:16,966 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:59:16,966 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 116 [2023-02-16 00:59:17,029 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:59:17,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 1187 treesize of output 994 [2023-02-16 00:59:17,812 INFO L321 Elim1Store]: treesize reduction 294, result has 60.5 percent of original size [2023-02-16 00:59:17,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 12 new quantified variables, introduced 55 case distinctions, treesize of input 7458 treesize of output 7167 [2023-02-16 00:59:17,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6470 treesize of output 5998 [2023-02-16 00:59:17,909 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:59:17,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 6018 treesize of output 5540 [2023-02-16 00:59:18,024 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:59:18,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 5530 treesize of output 4912 [2023-02-16 00:59:18,078 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:59:18,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4824 treesize of output 4122 [2023-02-16 00:59:18,162 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:59:18,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4154 treesize of output 4154 [2023-02-16 00:59:18,266 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:59:18,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 4356 treesize of output 4224 [2023-02-16 00:59:18,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 411 treesize of output 373 [2023-02-16 00:59:18,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 383 treesize of output 357