./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 22:21:14,970 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 22:21:15,055 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 22:21:15,059 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 22:21:15,061 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 22:21:15,079 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 22:21:15,080 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 22:21:15,081 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 22:21:15,081 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 22:21:15,081 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 22:21:15,081 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 22:21:15,081 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 22:21:15,081 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 22:21:15,082 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 22:21:15,082 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 22:21:15,082 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 22:21:15,082 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 22:21:15,083 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 22:21:15,083 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 22:21:15,083 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 22:21:15,083 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 22:21:15,083 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 22:21:15,084 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 22:21:15,084 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 22:21:15,084 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 22:21:15,084 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 22:21:15,084 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 22:21:15,084 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 22:21:15,084 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 22:21:15,084 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 22:21:15,084 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 22:21:15,084 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 22:21:15,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 22:21:15,084 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 22:21:15,085 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 22:21:15,085 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 22:21:15,085 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 22:21:15,085 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 22:21:15,085 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 22:21:15,085 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 22:21:15,085 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 22:21:15,085 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 22:21:15,085 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 3b13662719be51a1d3330a7f40f7706daa8c7b2d4044bc92f854095c09c7c129 [2024-11-06 22:21:15,313 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 22:21:15,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 22:21:15,321 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 22:21:15,321 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 22:21:15,321 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 22:21:15,322 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2024-11-06 22:21:16,389 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 22:21:16,640 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 22:21:16,641 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i [2024-11-06 22:21:16,650 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/908a30d2e/a57e1e70f2ea46c899f196142167a17b/FLAG8e7ee4fe6 [2024-11-06 22:21:16,958 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/908a30d2e/a57e1e70f2ea46c899f196142167a17b [2024-11-06 22:21:16,961 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 22:21:16,962 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 22:21:16,963 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 22:21:16,963 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 22:21:16,966 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 22:21:16,966 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:21:16" (1/1) ... [2024-11-06 22:21:16,967 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e665399 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:16, skipping insertion in model container [2024-11-06 22:21:16,967 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:21:16" (1/1) ... [2024-11-06 22:21:16,997 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 22:21:17,276 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i[33822,33835] [2024-11-06 22:21:17,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 22:21:17,311 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 22:21:17,337 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-2.i[33822,33835] [2024-11-06 22:21:17,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 22:21:17,387 INFO L204 MainTranslator]: Completed translation [2024-11-06 22:21:17,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:17 WrapperNode [2024-11-06 22:21:17,388 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 22:21:17,389 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 22:21:17,389 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 22:21:17,389 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 22:21:17,393 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:17" (1/1) ... [2024-11-06 22:21:17,404 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:17" (1/1) ... [2024-11-06 22:21:17,417 INFO L138 Inliner]: procedures = 232, calls = 75, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 118 [2024-11-06 22:21:17,417 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 22:21:17,418 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 22:21:17,418 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 22:21:17,418 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 22:21:17,423 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:17" (1/1) ... [2024-11-06 22:21:17,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:17" (1/1) ... [2024-11-06 22:21:17,427 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:17" (1/1) ... [2024-11-06 22:21:17,441 INFO L175 MemorySlicer]: Split 37 memory accesses to 2 slices as follows [2, 35]. 95 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 10 writes are split as follows [0, 10]. [2024-11-06 22:21:17,441 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:17" (1/1) ... [2024-11-06 22:21:17,441 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:17" (1/1) ... [2024-11-06 22:21:17,450 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:17" (1/1) ... [2024-11-06 22:21:17,453 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:17" (1/1) ... [2024-11-06 22:21:17,455 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:17" (1/1) ... [2024-11-06 22:21:17,455 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:17" (1/1) ... [2024-11-06 22:21:17,457 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 22:21:17,458 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 22:21:17,458 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 22:21:17,458 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 22:21:17,459 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:17" (1/1) ... [2024-11-06 22:21:17,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 22:21:17,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:21:17,483 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-06 22:21:17,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-06 22:21:17,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-06 22:21:17,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-06 22:21:17,501 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2024-11-06 22:21:17,501 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2024-11-06 22:21:17,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-06 22:21:17,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-06 22:21:17,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-06 22:21:17,502 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2024-11-06 22:21:17,502 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2024-11-06 22:21:17,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-06 22:21:17,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-06 22:21:17,502 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2024-11-06 22:21:17,502 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2024-11-06 22:21:17,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-06 22:21:17,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-06 22:21:17,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-06 22:21:17,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 22:21:17,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-06 22:21:17,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-06 22:21:17,503 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2024-11-06 22:21:17,503 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2024-11-06 22:21:17,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 22:21:17,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-06 22:21:17,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 22:21:17,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 22:21:17,603 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 22:21:17,604 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 22:21:17,882 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2024-11-06 22:21:17,882 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 22:21:17,894 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 22:21:17,896 INFO L316 CfgBuilder]: Removed 41 assume(true) statements. [2024-11-06 22:21:17,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:21:17 BoogieIcfgContainer [2024-11-06 22:21:17,896 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 22:21:17,898 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 22:21:17,898 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 22:21:17,901 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 22:21:17,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:21:16" (1/3) ... [2024-11-06 22:21:17,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@576e9894 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:21:17, skipping insertion in model container [2024-11-06 22:21:17,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:21:17" (2/3) ... [2024-11-06 22:21:17,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@576e9894 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:21:17, skipping insertion in model container [2024-11-06 22:21:17,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:21:17" (3/3) ... [2024-11-06 22:21:17,903 INFO L112 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-2.i [2024-11-06 22:21:17,913 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 22:21:17,914 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 22:21:17,953 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 22:21:17,963 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@589a3f9b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 22:21:17,964 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 22:21:17,967 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 89 states have (on average 1.7415730337078652) internal successors, (155), 108 states have internal predecessors, (155), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-06 22:21:17,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-06 22:21:17,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:21:17,971 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:21:17,972 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:21:17,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:21:17,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1761516263, now seen corresponding path program 1 times [2024-11-06 22:21:17,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:21:17,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283850521] [2024-11-06 22:21:17,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:21:17,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:21:18,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:21:18,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:21:18,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:21:18,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283850521] [2024-11-06 22:21:18,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283850521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:21:18,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:21:18,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 22:21:18,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166617633] [2024-11-06 22:21:18,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:21:18,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-06 22:21:18,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:21:18,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-06 22:21:18,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-06 22:21:18,076 INFO L87 Difference]: Start difference. First operand has 118 states, 89 states have (on average 1.7415730337078652) internal successors, (155), 108 states have internal predecessors, (155), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:21:18,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:21:18,107 INFO L93 Difference]: Finished difference Result 230 states and 397 transitions. [2024-11-06 22:21:18,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-06 22:21:18,108 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-06 22:21:18,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:21:18,113 INFO L225 Difference]: With dead ends: 230 [2024-11-06 22:21:18,113 INFO L226 Difference]: Without dead ends: 107 [2024-11-06 22:21:18,115 INFO L431 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 [2024-11-06 22:21:18,117 INFO L432 NwaCegarLoop]: 136 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, 136 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 [2024-11-06 22:21:18,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 22:21:18,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-06 22:21:18,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-06 22:21:18,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 97 states have internal predecessors, (102), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-06 22:21:18,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 128 transitions. [2024-11-06 22:21:18,144 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 128 transitions. Word has length 9 [2024-11-06 22:21:18,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:21:18,144 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 128 transitions. [2024-11-06 22:21:18,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 22:21:18,145 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 128 transitions. [2024-11-06 22:21:18,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-06 22:21:18,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:21:18,146 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:21:18,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 22:21:18,146 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:21:18,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:21:18,147 INFO L85 PathProgramCache]: Analyzing trace with hash 849043181, now seen corresponding path program 1 times [2024-11-06 22:21:18,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:21:18,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600321273] [2024-11-06 22:21:18,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:21:18,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:21:18,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:21:18,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-06 22:21:18,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:21:18,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:21:18,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:21:18,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600321273] [2024-11-06 22:21:18,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600321273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:21:18,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:21:18,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 22:21:18,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581832025] [2024-11-06 22:21:18,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:21:18,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 22:21:18,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:21:18,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 22:21:18,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 22:21:18,462 INFO L87 Difference]: Start difference. First operand 107 states and 128 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 22:21:18,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:21:18,763 INFO L93 Difference]: Finished difference Result 109 states and 129 transitions. [2024-11-06 22:21:18,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 22:21:18,764 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-11-06 22:21:18,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:21:18,778 INFO L225 Difference]: With dead ends: 109 [2024-11-06 22:21:18,778 INFO L226 Difference]: Without dead ends: 106 [2024-11-06 22:21:18,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-06 22:21:18,779 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 242 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 22:21:18,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 125 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 22:21:18,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-06 22:21:18,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-06 22:21:18,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 82 states have (on average 1.2317073170731707) internal successors, (101), 96 states have internal predecessors, (101), 20 states have call successors, (20), 4 states have call predecessors, (20), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-06 22:21:18,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 126 transitions. [2024-11-06 22:21:18,795 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 126 transitions. Word has length 21 [2024-11-06 22:21:18,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:21:18,798 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 126 transitions. [2024-11-06 22:21:18,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 22:21:18,798 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 126 transitions. [2024-11-06 22:21:18,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-06 22:21:18,798 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:21:18,798 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:21:18,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 22:21:18,799 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:21:18,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:21:18,799 INFO L85 PathProgramCache]: Analyzing trace with hash 502050183, now seen corresponding path program 1 times [2024-11-06 22:21:18,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:21:18,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060784672] [2024-11-06 22:21:18,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:21:18,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:21:18,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:21:19,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-06 22:21:19,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:21:19,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:21:19,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:21:19,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060784672] [2024-11-06 22:21:19,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060784672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:21:19,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:21:19,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-06 22:21:19,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133469393] [2024-11-06 22:21:19,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:21:19,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-06 22:21:19,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:21:19,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-06 22:21:19,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-06 22:21:19,325 INFO L87 Difference]: Start difference. First operand 106 states and 126 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 22:21:20,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:21:20,123 INFO L93 Difference]: Finished difference Result 198 states and 235 transitions. [2024-11-06 22:21:20,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-06 22:21:20,124 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-11-06 22:21:20,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:21:20,127 INFO L225 Difference]: With dead ends: 198 [2024-11-06 22:21:20,127 INFO L226 Difference]: Without dead ends: 192 [2024-11-06 22:21:20,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-11-06 22:21:20,127 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 482 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 22:21:20,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 185 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 22:21:20,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-06 22:21:20,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 172. [2024-11-06 22:21:20,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 144 states have (on average 1.2430555555555556) internal successors, (179), 158 states have internal predecessors, (179), 23 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-06 22:21:20,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 209 transitions. [2024-11-06 22:21:20,158 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 209 transitions. Word has length 24 [2024-11-06 22:21:20,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:21:20,158 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 209 transitions. [2024-11-06 22:21:20,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 22:21:20,158 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 209 transitions. [2024-11-06 22:21:20,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-06 22:21:20,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:21:20,159 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:21:20,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 22:21:20,159 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:21:20,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:21:20,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1234303898, now seen corresponding path program 1 times [2024-11-06 22:21:20,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:21:20,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509179856] [2024-11-06 22:21:20,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:21:20,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:21:20,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:21:20,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-06 22:21:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:21:20,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:21:20,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:21:20,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509179856] [2024-11-06 22:21:20,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509179856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:21:20,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:21:20,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-06 22:21:20,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421491856] [2024-11-06 22:21:20,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:21:20,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-06 22:21:20,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:21:20,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-06 22:21:20,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-06 22:21:20,976 INFO L87 Difference]: Start difference. First operand 172 states and 209 transitions. Second operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 22:21:21,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:21:21,844 INFO L93 Difference]: Finished difference Result 274 states and 329 transitions. [2024-11-06 22:21:21,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-06 22:21:21,844 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-11-06 22:21:21,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:21:21,846 INFO L225 Difference]: With dead ends: 274 [2024-11-06 22:21:21,846 INFO L226 Difference]: Without dead ends: 271 [2024-11-06 22:21:21,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-11-06 22:21:21,847 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 310 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 1200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 22:21:21,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 285 Invalid, 1200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1161 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 22:21:21,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-11-06 22:21:21,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 253. [2024-11-06 22:21:21,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 218 states have (on average 1.238532110091743) internal successors, (270), 233 states have internal predecessors, (270), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-06 22:21:21,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 309 transitions. [2024-11-06 22:21:21,876 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 309 transitions. Word has length 27 [2024-11-06 22:21:21,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:21:21,877 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 309 transitions. [2024-11-06 22:21:21,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 22:21:21,877 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 309 transitions. [2024-11-06 22:21:21,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-06 22:21:21,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:21:21,877 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:21:21,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 22:21:21,878 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:21:21,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:21:21,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1680148119, now seen corresponding path program 1 times [2024-11-06 22:21:21,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:21:21,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26986572] [2024-11-06 22:21:21,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:21:21,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:21:21,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:21:22,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-06 22:21:22,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:21:22,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:21:22,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:21:22,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26986572] [2024-11-06 22:21:22,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26986572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:21:22,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:21:22,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-06 22:21:22,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051202065] [2024-11-06 22:21:22,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:21:22,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-06 22:21:22,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:21:22,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-06 22:21:22,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-06 22:21:22,484 INFO L87 Difference]: Start difference. First operand 253 states and 309 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 9 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 22:21:23,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:21:23,252 INFO L93 Difference]: Finished difference Result 273 states and 327 transitions. [2024-11-06 22:21:23,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-06 22:21:23,252 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 9 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2024-11-06 22:21:23,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:21:23,253 INFO L225 Difference]: With dead ends: 273 [2024-11-06 22:21:23,253 INFO L226 Difference]: Without dead ends: 270 [2024-11-06 22:21:23,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2024-11-06 22:21:23,254 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 352 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 1064 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 22:21:23,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 261 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1064 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 22:21:23,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-11-06 22:21:23,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 253. [2024-11-06 22:21:23,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 218 states have (on average 1.2339449541284404) internal successors, (269), 233 states have internal predecessors, (269), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-06 22:21:23,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 308 transitions. [2024-11-06 22:21:23,269 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 308 transitions. Word has length 30 [2024-11-06 22:21:23,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:21:23,269 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 308 transitions. [2024-11-06 22:21:23,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 9 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 22:21:23,270 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 308 transitions. [2024-11-06 22:21:23,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-06 22:21:23,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:21:23,270 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:21:23,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 22:21:23,270 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:21:23,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:21:23,271 INFO L85 PathProgramCache]: Analyzing trace with hash -493122043, now seen corresponding path program 1 times [2024-11-06 22:21:23,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:21:23,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549273541] [2024-11-06 22:21:23,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:21:23,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:21:23,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:21:23,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-06 22:21:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:21:24,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:21:24,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:21:24,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549273541] [2024-11-06 22:21:24,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549273541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:21:24,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:21:24,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-06 22:21:24,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061074815] [2024-11-06 22:21:24,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:21:24,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-06 22:21:24,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:21:24,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-06 22:21:24,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-06 22:21:24,150 INFO L87 Difference]: Start difference. First operand 253 states and 308 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 22:21:24,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:21:24,960 INFO L93 Difference]: Finished difference Result 272 states and 325 transitions. [2024-11-06 22:21:24,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-06 22:21:24,960 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2024-11-06 22:21:24,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:21:24,962 INFO L225 Difference]: With dead ends: 272 [2024-11-06 22:21:24,962 INFO L226 Difference]: Without dead ends: 269 [2024-11-06 22:21:24,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2024-11-06 22:21:24,964 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 341 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 22:21:24,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 239 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 934 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 22:21:24,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-06 22:21:24,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 253. [2024-11-06 22:21:24,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 218 states have (on average 1.2293577981651376) internal successors, (268), 233 states have internal predecessors, (268), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-06 22:21:25,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 307 transitions. [2024-11-06 22:21:25,000 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 307 transitions. Word has length 33 [2024-11-06 22:21:25,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:21:25,001 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 307 transitions. [2024-11-06 22:21:25,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 22:21:25,001 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 307 transitions. [2024-11-06 22:21:25,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-06 22:21:25,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:21:25,002 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:21:25,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 22:21:25,002 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:21:25,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:21:25,002 INFO L85 PathProgramCache]: Analyzing trace with hash -2033122620, now seen corresponding path program 1 times [2024-11-06 22:21:25,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:21:25,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815148509] [2024-11-06 22:21:25,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:21:25,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:21:25,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:21:25,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-06 22:21:25,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:21:25,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:21:25,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:21:25,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815148509] [2024-11-06 22:21:25,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815148509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:21:25,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:21:25,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-06 22:21:25,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699578883] [2024-11-06 22:21:25,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:21:25,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-06 22:21:25,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:21:25,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-06 22:21:25,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-06 22:21:25,789 INFO L87 Difference]: Start difference. First operand 253 states and 307 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 22:21:26,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:21:26,547 INFO L93 Difference]: Finished difference Result 271 states and 323 transitions. [2024-11-06 22:21:26,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-06 22:21:26,554 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2024-11-06 22:21:26,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:21:26,555 INFO L225 Difference]: With dead ends: 271 [2024-11-06 22:21:26,555 INFO L226 Difference]: Without dead ends: 268 [2024-11-06 22:21:26,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2024-11-06 22:21:26,556 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 333 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 22:21:26,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 261 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1056 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 22:21:26,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-06 22:21:26,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 253. [2024-11-06 22:21:26,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 218 states have (on average 1.224770642201835) internal successors, (267), 233 states have internal predecessors, (267), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-06 22:21:26,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 306 transitions. [2024-11-06 22:21:26,576 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 306 transitions. Word has length 36 [2024-11-06 22:21:26,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:21:26,576 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 306 transitions. [2024-11-06 22:21:26,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 22:21:26,576 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 306 transitions. [2024-11-06 22:21:26,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-06 22:21:26,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:21:26,577 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:21:26,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 22:21:26,577 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:21:26,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:21:26,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1335339115, now seen corresponding path program 1 times [2024-11-06 22:21:26,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:21:26,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099495397] [2024-11-06 22:21:26,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:21:26,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:21:26,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:21:26,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-06 22:21:26,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:21:27,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:21:27,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:21:27,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099495397] [2024-11-06 22:21:27,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099495397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:21:27,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:21:27,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-06 22:21:27,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862465104] [2024-11-06 22:21:27,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:21:27,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-06 22:21:27,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:21:27,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-06 22:21:27,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-06 22:21:27,039 INFO L87 Difference]: Start difference. First operand 253 states and 306 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 22:21:27,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:21:27,759 INFO L93 Difference]: Finished difference Result 270 states and 321 transitions. [2024-11-06 22:21:27,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-06 22:21:27,759 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2024-11-06 22:21:27,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:21:27,761 INFO L225 Difference]: With dead ends: 270 [2024-11-06 22:21:27,761 INFO L226 Difference]: Without dead ends: 267 [2024-11-06 22:21:27,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2024-11-06 22:21:27,762 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 409 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 22:21:27,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 229 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 937 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 22:21:27,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-11-06 22:21:27,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 253. [2024-11-06 22:21:27,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 218 states have (on average 1.2201834862385321) internal successors, (266), 233 states have internal predecessors, (266), 28 states have call successors, (28), 8 states have call predecessors, (28), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-06 22:21:27,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 305 transitions. [2024-11-06 22:21:27,781 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 305 transitions. Word has length 39 [2024-11-06 22:21:27,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:21:27,784 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 305 transitions. [2024-11-06 22:21:27,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 8 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 22:21:27,784 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 305 transitions. [2024-11-06 22:21:27,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-06 22:21:27,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:21:27,788 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:21:27,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 22:21:27,788 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:21:27,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:21:27,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1154705564, now seen corresponding path program 1 times [2024-11-06 22:21:27,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:21:27,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547086655] [2024-11-06 22:21:27,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:21:27,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:21:27,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:21:28,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-06 22:21:28,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:21:28,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-06 22:21:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:21:28,731 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-06 22:21:28,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:21:28,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547086655] [2024-11-06 22:21:28,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547086655] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:21:28,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20981597] [2024-11-06 22:21:28,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:21:28,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:21:28,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:21:28,734 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 22:21:28,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-06 22:21:28,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:21:28,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 110 conjuncts are in the unsatisfiable core [2024-11-06 22:21:28,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:21:29,049 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-06 22:21:29,050 INFO L378 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 19 treesize of output 16 [2024-11-06 22:21:29,076 INFO L378 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 16 treesize of output 11 [2024-11-06 22:21:29,082 INFO L378 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 16 treesize of output 11 [2024-11-06 22:21:29,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 53 treesize of output 50 [2024-11-06 22:21:29,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 48 [2024-11-06 22:21:29,290 INFO L378 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 0 case distinctions, treesize of input 66 treesize of output 54 [2024-11-06 22:21:29,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2024-11-06 22:21:29,386 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-06 22:21:29,386 INFO L378 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 131 treesize of output 108 [2024-11-06 22:21:29,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2024-11-06 22:21:29,463 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-06 22:21:29,463 INFO L378 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 [2024-11-06 22:21:29,504 INFO L378 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 28 treesize of output 19 [2024-11-06 22:21:29,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:21:29,712 INFO L349 Elim1Store]: treesize reduction 156, result has 19.2 percent of original size [2024-11-06 22:21:29,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 206 treesize of output 333 [2024-11-06 22:21:29,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:21:29,745 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-06 22:21:29,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 294 treesize of output 252 [2024-11-06 22:21:29,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:21:29,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:21:29,780 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:21:29,794 INFO L349 Elim1Store]: treesize reduction 41, result has 22.6 percent of original size [2024-11-06 22:21:29,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 161 treesize of output 137 [2024-11-06 22:21:29,806 INFO L378 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 42 treesize of output 35 [2024-11-06 22:21:29,854 INFO L378 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 17 treesize of output 21 [2024-11-06 22:21:29,938 INFO L349 Elim1Store]: treesize reduction 43, result has 2.3 percent of original size [2024-11-06 22:21:29,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 71 [2024-11-06 22:21:29,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2024-11-06 22:21:30,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:21:30,136 INFO L349 Elim1Store]: treesize reduction 20, result has 47.4 percent of original size [2024-11-06 22:21:30,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 333 treesize of output 254 [2024-11-06 22:21:30,198 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:21:30,199 INFO L378 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 17 treesize of output 11 [2024-11-06 22:21:30,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:21:30,267 INFO L378 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 17 treesize of output 11 [2024-11-06 22:21:30,277 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 22:21:30,277 INFO L378 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 17 treesize of output 11 [2024-11-06 22:21:30,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-06 22:21:30,505 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:21:30,505 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 22:21:30,761 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_629 (Array Int Int)) (|v_list_add___list_add_~new#1.offset_32| Int) (|v_list_add___list_add_~prev#1.offset_31| Int)) (or (< |c_~#gl_list~0.offset| |v_list_add___list_add_~prev#1.offset_31|) (not (= (select (select (store (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_634))) (store .cse0 |c_~#gl_list~0.base| (store (select (store .cse0 |c_ULTIMATE.start_gl_insert_~node~1#1.base| (store (store (select .cse0 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) |v_list_add___list_add_~new#1.offset_32| .cse1) (+ |v_list_add___list_add_~new#1.offset_32| 4) |c_~#gl_list~0.base|)) |c_~#gl_list~0.base|) |v_list_add___list_add_~prev#1.offset_31| |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_629) |c_~#gl_list~0.base|) (+ |c_~#gl_list~0.offset| 4)) |c_~#gl_list~0.base|)))) is different from false [2024-11-06 22:21:30,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20981597] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:21:30,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 22:21:30,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 28 [2024-11-06 22:21:30,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620238503] [2024-11-06 22:21:30,764 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 22:21:30,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-06 22:21:30,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:21:30,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-06 22:21:30,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1007, Unknown=9, NotChecked=64, Total=1190 [2024-11-06 22:21:30,765 INFO L87 Difference]: Start difference. First operand 253 states and 305 transitions. Second operand has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 19 states have internal predecessors, (62), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-06 22:21:34,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:21:34,233 INFO L93 Difference]: Finished difference Result 291 states and 340 transitions. [2024-11-06 22:21:34,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-06 22:21:34,233 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 19 states have internal predecessors, (62), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 40 [2024-11-06 22:21:34,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:21:34,235 INFO L225 Difference]: With dead ends: 291 [2024-11-06 22:21:34,236 INFO L226 Difference]: Without dead ends: 288 [2024-11-06 22:21:34,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=330, Invalid=2210, Unknown=14, NotChecked=98, Total=2652 [2024-11-06 22:21:34,237 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 1081 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 3851 mSolverCounterSat, 205 mSolverCounterUnsat, 39 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1084 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 4095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 3851 IncrementalHoareTripleChecker+Invalid, 39 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-06 22:21:34,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1084 Valid, 796 Invalid, 4095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 3851 Invalid, 39 Unknown, 0 Unchecked, 2.4s Time] [2024-11-06 22:21:34,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-11-06 22:21:34,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 257. [2024-11-06 22:21:34,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 221 states have (on average 1.2126696832579185) internal successors, (268), 236 states have internal predecessors, (268), 28 states have call successors, (28), 9 states have call predecessors, (28), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-06 22:21:34,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 307 transitions. [2024-11-06 22:21:34,264 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 307 transitions. Word has length 40 [2024-11-06 22:21:34,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:21:34,265 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 307 transitions. [2024-11-06 22:21:34,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 19 states have internal predecessors, (62), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-06 22:21:34,265 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 307 transitions. [2024-11-06 22:21:34,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-06 22:21:34,266 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:21:34,267 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:21:34,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-06 22:21:34,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:21:34,467 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:21:34,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:21:34,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1293265745, now seen corresponding path program 1 times [2024-11-06 22:21:34,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:21:34,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888545389] [2024-11-06 22:21:34,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:21:34,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:21:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:21:34,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-06 22:21:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:21:35,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 22:21:35,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:21:35,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888545389] [2024-11-06 22:21:35,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888545389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 22:21:35,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 22:21:35,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-06 22:21:35,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545715305] [2024-11-06 22:21:35,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 22:21:35,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-06 22:21:35,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 22:21:35,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-06 22:21:35,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2024-11-06 22:21:35,050 INFO L87 Difference]: Start difference. First operand 257 states and 307 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 22:21:35,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 22:21:35,904 INFO L93 Difference]: Finished difference Result 273 states and 321 transitions. [2024-11-06 22:21:35,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-06 22:21:35,904 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2024-11-06 22:21:35,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 22:21:35,905 INFO L225 Difference]: With dead ends: 273 [2024-11-06 22:21:35,905 INFO L226 Difference]: Without dead ends: 270 [2024-11-06 22:21:35,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2024-11-06 22:21:35,906 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 364 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 22:21:35,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 285 Invalid, 1191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1161 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 22:21:35,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-11-06 22:21:35,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 257. [2024-11-06 22:21:35,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 221 states have (on average 1.2081447963800904) internal successors, (267), 236 states have internal predecessors, (267), 28 states have call successors, (28), 9 states have call predecessors, (28), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-06 22:21:35,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 306 transitions. [2024-11-06 22:21:35,938 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 306 transitions. Word has length 42 [2024-11-06 22:21:35,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 22:21:35,938 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 306 transitions. [2024-11-06 22:21:35,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 22:21:35,938 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 306 transitions. [2024-11-06 22:21:35,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-06 22:21:35,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 22:21:35,939 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 22:21:35,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 22:21:35,940 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 22:21:35,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 22:21:35,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1188127317, now seen corresponding path program 1 times [2024-11-06 22:21:35,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 22:21:35,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737219001] [2024-11-06 22:21:35,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:21:35,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 22:21:35,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:21:36,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-06 22:21:36,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:21:36,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-06 22:21:36,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:21:36,904 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-06 22:21:36,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 22:21:36,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737219001] [2024-11-06 22:21:36,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737219001] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 22:21:36,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912465965] [2024-11-06 22:21:36,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 22:21:36,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 22:21:36,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 22:21:36,907 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 22:21:36,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-06 22:21:37,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 22:21:37,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 120 conjuncts are in the unsatisfiable core [2024-11-06 22:21:37,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 22:21:37,097 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-06 22:21:37,097 INFO L378 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 19 treesize of output 16 [2024-11-06 22:21:37,155 INFO L378 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 16 treesize of output 11 [2024-11-06 22:21:37,160 INFO L378 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 16 treesize of output 11 [2024-11-06 22:21:37,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:21:37,295 INFO L378 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 22 treesize of output 14 [2024-11-06 22:21:37,297 INFO L378 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-06 22:21:37,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 41 treesize of output 46 [2024-11-06 22:21:37,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 [2024-11-06 22:21:37,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:21:37,356 INFO L378 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 29 treesize of output 14 [2024-11-06 22:21:37,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2024-11-06 22:21:37,365 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-06 22:21:37,366 INFO L378 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 25 treesize of output 26 [2024-11-06 22:21:37,421 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-06 22:21:37,421 INFO L378 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 [2024-11-06 22:21:37,456 INFO L378 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 17 treesize of output 12 [2024-11-06 22:21:37,460 INFO L378 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 16 treesize of output 11 [2024-11-06 22:21:50,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:21:50,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:21:50,891 INFO L349 Elim1Store]: treesize reduction 168, result has 29.1 percent of original size [2024-11-06 22:21:50,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 261 treesize of output 459 [2024-11-06 22:21:50,902 INFO L378 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 298 treesize of output 198 [2024-11-06 22:21:51,041 INFO L349 Elim1Store]: treesize reduction 48, result has 12.7 percent of original size [2024-11-06 22:21:51,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 68 [2024-11-06 22:21:51,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:21:51,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:21:51,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 59 treesize of output 140 [2024-11-06 22:21:51,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:21:51,296 INFO L378 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2024-11-06 22:21:51,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:21:51,389 INFO L378 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2024-11-06 22:21:53,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:21:53,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:21:53,209 INFO L349 Elim1Store]: treesize reduction 24, result has 25.0 percent of original size [2024-11-06 22:21:53,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 567 treesize of output 539 [2024-11-06 22:21:53,309 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-11-06 22:21:53,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 327 treesize of output 351 [2024-11-06 22:21:53,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:21:53,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 15 [2024-11-06 22:21:53,710 INFO L349 Elim1Store]: treesize reduction 59, result has 1.7 percent of original size [2024-11-06 22:21:53,710 INFO L378 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 5 case distinctions, treesize of input 45 treesize of output 15 [2024-11-06 22:21:53,820 INFO L349 Elim1Store]: treesize reduction 206, result has 15.9 percent of original size [2024-11-06 22:21:53,821 INFO L378 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 564 treesize of output 558 [2024-11-06 22:21:53,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:21:53,959 INFO L349 Elim1Store]: treesize reduction 68, result has 1.4 percent of original size [2024-11-06 22:21:53,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 77 treesize of output 49 [2024-11-06 22:21:54,121 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:21:54,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:21:54,140 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:21:54,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 385 treesize of output 351 [2024-11-06 22:21:54,331 INFO L349 Elim1Store]: treesize reduction 396, result has 14.8 percent of original size [2024-11-06 22:21:54,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 341 treesize of output 436 [2024-11-06 22:21:54,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 15 [2024-11-06 22:21:54,473 INFO L349 Elim1Store]: treesize reduction 68, result has 1.4 percent of original size [2024-11-06 22:21:54,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 69 treesize of output 41 [2024-11-06 22:21:54,565 INFO L349 Elim1Store]: treesize reduction 540, result has 0.2 percent of original size [2024-11-06 22:21:54,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 224 treesize of output 116 [2024-11-06 22:21:54,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 15 [2024-11-06 22:21:54,663 INFO L349 Elim1Store]: treesize reduction 68, result has 1.4 percent of original size [2024-11-06 22:21:54,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 69 treesize of output 41 [2024-11-06 22:21:55,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:21:55,875 INFO L349 Elim1Store]: treesize reduction 20, result has 47.4 percent of original size [2024-11-06 22:21:55,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1535 treesize of output 1301 [2024-11-06 22:21:55,984 INFO L378 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2024-11-06 22:21:56,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2024-11-06 22:21:56,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2024-11-06 22:21:56,364 INFO L378 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 11 treesize of output 3 [2024-11-06 22:21:56,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2024-11-06 22:21:57,386 INFO L349 Elim1Store]: treesize reduction 1831, result has 25.4 percent of original size [2024-11-06 22:21:57,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 29 case distinctions, treesize of input 1203 treesize of output 1794 [2024-11-06 22:22:25,143 INFO L349 Elim1Store]: treesize reduction 370, result has 16.1 percent of original size [2024-11-06 22:22:25,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 208 treesize of output 193 [2024-11-06 22:22:25,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:22:25,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:22:25,433 INFO L349 Elim1Store]: treesize reduction 458, result has 19.6 percent of original size [2024-11-06 22:22:25,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 219 treesize of output 237 [2024-11-06 22:22:25,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:22:25,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:22:25,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:22:25,718 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:22:25,824 INFO L349 Elim1Store]: treesize reduction 264, result has 18.0 percent of original size [2024-11-06 22:22:25,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 175 treesize of output 147 [2024-11-06 22:22:25,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:22:25,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:22:25,874 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:22:25,973 INFO L349 Elim1Store]: treesize reduction 316, result has 21.2 percent of original size [2024-11-06 22:22:25,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 228 treesize of output 227 [2024-11-06 22:22:26,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 22:22:26,722 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:22:26,724 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:22:26,726 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 22:22:26,881 INFO L349 Elim1Store]: treesize reduction 225, result has 41.1 percent of original size [2024-11-06 22:22:26,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 360 treesize of output 429