./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-97.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/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-97.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', 'c9660027c68c4b9a4c9b5d2fcf28f08d02ad5d65bde0be334146e93683fb06d5'] 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/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-97.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 c9660027c68c4b9a4c9b5d2fcf28f08d02ad5d65bde0be334146e93683fb06d5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 11:02:04,648 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 11:02:04,703 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 11:02:04,708 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 11:02:04,709 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 11:02:04,722 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 11:02:04,723 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 11:02:04,723 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 11:02:04,723 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 11:02:04,723 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 11:02:04,723 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 11:02:04,723 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 11:02:04,725 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 11:02:04,725 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 11:02:04,726 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 11:02:04,726 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 11:02:04,726 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 11:02:04,726 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 11:02:04,726 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 11:02:04,726 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 11:02:04,726 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 11:02:04,727 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 11:02:04,727 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 11:02:04,727 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 11:02:04,727 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 11:02:04,727 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 11:02:04,727 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 11:02:04,727 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 11:02:04,727 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 11:02:04,727 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 11:02:04,728 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 11:02:04,728 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 11:02:04,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 11:02:04,728 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 11:02:04,728 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 11:02:04,728 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 11:02:04,728 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 11:02:04,729 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 11:02:04,729 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 11:02:04,729 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 11:02:04,729 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 11:02:04,729 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 11:02:04,729 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 -> c9660027c68c4b9a4c9b5d2fcf28f08d02ad5d65bde0be334146e93683fb06d5 [2024-11-07 11:02:04,958 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 11:02:04,963 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 11:02:04,967 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 11:02:04,968 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 11:02:04,968 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 11:02:04,969 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-97.i [2024-11-07 11:02:06,061 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 11:02:06,271 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 11:02:06,272 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-97.i [2024-11-07 11:02:06,280 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6562b5703/90f94b3602f54909b32b7be62dacb927/FLAG933e82d6f [2024-11-07 11:02:06,624 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6562b5703/90f94b3602f54909b32b7be62dacb927 [2024-11-07 11:02:06,626 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 11:02:06,627 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 11:02:06,628 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 11:02:06,628 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 11:02:06,631 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 11:02:06,631 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:02:06" (1/1) ... [2024-11-07 11:02:06,631 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a9bbe4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:02:06, skipping insertion in model container [2024-11-07 11:02:06,632 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 11:02:06" (1/1) ... [2024-11-07 11:02:06,645 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 11:02:06,730 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/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-97.i[917,930] [2024-11-07 11:02:06,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 11:02:06,781 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 11:02:06,790 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/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-97.i[917,930] [2024-11-07 11:02:06,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 11:02:06,845 INFO L204 MainTranslator]: Completed translation [2024-11-07 11:02:06,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:02:06 WrapperNode [2024-11-07 11:02:06,845 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 11:02:06,846 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 11:02:06,847 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 11:02:06,847 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 11:02:06,852 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:02:06" (1/1) ... [2024-11-07 11:02:06,866 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:02:06" (1/1) ... [2024-11-07 11:02:06,900 INFO L138 Inliner]: procedures = 30, calls = 145, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 447 [2024-11-07 11:02:06,904 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 11:02:06,905 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 11:02:06,905 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 11:02:06,905 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 11:02:06,912 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:02:06" (1/1) ... [2024-11-07 11:02:06,912 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:02:06" (1/1) ... [2024-11-07 11:02:06,918 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:02:06" (1/1) ... [2024-11-07 11:02:06,930 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-07 11:02:06,931 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:02:06" (1/1) ... [2024-11-07 11:02:06,931 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:02:06" (1/1) ... [2024-11-07 11:02:06,947 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:02:06" (1/1) ... [2024-11-07 11:02:06,953 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:02:06" (1/1) ... [2024-11-07 11:02:06,955 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:02:06" (1/1) ... [2024-11-07 11:02:06,956 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:02:06" (1/1) ... [2024-11-07 11:02:06,958 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 11:02:06,959 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 11:02:06,959 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 11:02:06,959 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 11:02:06,960 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:02:06" (1/1) ... [2024-11-07 11:02:06,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 11:02:06,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 11:02:06,983 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-07 11:02:06,989 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-07 11:02:07,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 11:02:07,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-07 11:02:07,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-07 11:02:07,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-07 11:02:07,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-07 11:02:07,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-07 11:02:07,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-07 11:02:07,004 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 11:02:07,004 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 11:02:07,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-07 11:02:07,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 11:02:07,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 11:02:07,090 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 11:02:07,091 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 11:02:07,560 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2024-11-07 11:02:07,560 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 11:02:07,570 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 11:02:07,570 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 11:02:07,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:02:07 BoogieIcfgContainer [2024-11-07 11:02:07,570 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 11:02:07,572 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 11:02:07,573 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 11:02:07,576 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 11:02:07,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 11:02:06" (1/3) ... [2024-11-07 11:02:07,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6882ddd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:02:07, skipping insertion in model container [2024-11-07 11:02:07,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 11:02:06" (2/3) ... [2024-11-07 11:02:07,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6882ddd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 11:02:07, skipping insertion in model container [2024-11-07 11:02:07,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 11:02:07" (3/3) ... [2024-11-07 11:02:07,578 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-97.i [2024-11-07 11:02:07,587 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 11:02:07,588 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 11:02:07,630 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 11:02:07,641 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;@24ca0210, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 11:02:07,642 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 11:02:07,646 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 88 states have (on average 1.3977272727272727) internal successors, (123), 89 states have internal predecessors, (123), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 11:02:07,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 11:02:07,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:02:07,656 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 11:02:07,656 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:02:07,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:02:07,660 INFO L85 PathProgramCache]: Analyzing trace with hash 322779117, now seen corresponding path program 1 times [2024-11-07 11:02:07,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:02:07,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170940995] [2024-11-07 11:02:07,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:02:07,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:02:07,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:07,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:02:07,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:07,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:02:07,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:07,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:02:07,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:07,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:02:07,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:07,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:02:07,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:07,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:02:07,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:07,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:02:07,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:07,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:02:07,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:07,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:02:07,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:07,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:02:07,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:07,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:02:07,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:07,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:02:07,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:07,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:02:07,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:07,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:02:07,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:07,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 11:02:07,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:07,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 11:02:07,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:07,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 11:02:07,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:08,004 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 11:02:08,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:02:08,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170940995] [2024-11-07 11:02:08,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170940995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:02:08,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:02:08,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 11:02:08,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995994548] [2024-11-07 11:02:08,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:02:08,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 11:02:08,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:02:08,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 11:02:08,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 11:02:08,025 INFO L87 Difference]: Start difference. First operand has 108 states, 88 states have (on average 1.3977272727272727) internal successors, (123), 89 states have internal predecessors, (123), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 11:02:08,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:02:08,045 INFO L93 Difference]: Finished difference Result 209 states and 325 transitions. [2024-11-07 11:02:08,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 11:02:08,047 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 134 [2024-11-07 11:02:08,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:02:08,052 INFO L225 Difference]: With dead ends: 209 [2024-11-07 11:02:08,053 INFO L226 Difference]: Without dead ends: 104 [2024-11-07 11:02:08,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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-07 11:02:08,058 INFO L432 NwaCegarLoop]: 150 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, 150 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-07 11:02:08,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 11:02:08,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-07 11:02:08,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-07 11:02:08,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 85 states have (on average 1.3647058823529412) internal successors, (116), 85 states have internal predecessors, (116), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 11:02:08,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 150 transitions. [2024-11-07 11:02:08,093 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 150 transitions. Word has length 134 [2024-11-07 11:02:08,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:02:08,093 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 150 transitions. [2024-11-07 11:02:08,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 11:02:08,094 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 150 transitions. [2024-11-07 11:02:08,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 11:02:08,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:02:08,097 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 11:02:08,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 11:02:08,098 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:02:08,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:02:08,100 INFO L85 PathProgramCache]: Analyzing trace with hash 468796107, now seen corresponding path program 1 times [2024-11-07 11:02:08,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:02:08,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907643593] [2024-11-07 11:02:08,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:02:08,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:02:08,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:08,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:02:08,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:08,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:02:08,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:08,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:02:08,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:08,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:02:08,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:08,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:02:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:08,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:02:08,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:08,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:02:08,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:08,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:02:08,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:08,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:02:08,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:08,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:02:08,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:08,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:02:08,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:08,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:02:08,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:08,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:02:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:08,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:02:08,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:08,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 11:02:08,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:08,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 11:02:08,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:08,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 11:02:08,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:08,547 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 11:02:08,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:02:08,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907643593] [2024-11-07 11:02:08,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907643593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:02:08,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:02:08,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 11:02:08,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440678182] [2024-11-07 11:02:08,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:02:08,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 11:02:08,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:02:08,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 11:02:08,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:02:08,551 INFO L87 Difference]: Start difference. First operand 104 states and 150 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 11:02:08,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:02:08,585 INFO L93 Difference]: Finished difference Result 207 states and 300 transitions. [2024-11-07 11:02:08,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 11:02:08,586 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2024-11-07 11:02:08,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:02:08,587 INFO L225 Difference]: With dead ends: 207 [2024-11-07 11:02:08,587 INFO L226 Difference]: Without dead ends: 106 [2024-11-07 11:02:08,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:02:08,588 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 11:02:08,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 433 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 11:02:08,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-07 11:02:08,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-07 11:02:08,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 87 states have (on average 1.3563218390804597) internal successors, (118), 87 states have internal predecessors, (118), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 11:02:08,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 152 transitions. [2024-11-07 11:02:08,597 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 152 transitions. Word has length 134 [2024-11-07 11:02:08,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:02:08,598 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 152 transitions. [2024-11-07 11:02:08,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 11:02:08,598 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 152 transitions. [2024-11-07 11:02:08,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-07 11:02:08,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:02:08,601 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 11:02:08,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 11:02:08,602 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:02:08,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:02:08,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1684705181, now seen corresponding path program 1 times [2024-11-07 11:02:08,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:02:08,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461889390] [2024-11-07 11:02:08,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:02:08,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:02:08,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:08,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:02:08,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:08,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:02:08,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:08,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:02:08,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:08,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:02:08,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:08,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:02:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:08,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:02:08,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:08,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:02:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:08,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:02:08,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:08,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:02:08,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:08,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:02:08,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:08,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:02:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:08,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:02:08,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:08,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:02:08,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:08,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:02:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:08,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 11:02:08,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:08,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 11:02:08,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:08,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 11:02:08,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:08,804 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 11:02:08,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:02:08,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461889390] [2024-11-07 11:02:08,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461889390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:02:08,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:02:08,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 11:02:08,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025493755] [2024-11-07 11:02:08,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:02:08,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 11:02:08,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:02:08,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 11:02:08,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:02:08,806 INFO L87 Difference]: Start difference. First operand 106 states and 152 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 11:02:08,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:02:08,842 INFO L93 Difference]: Finished difference Result 212 states and 305 transitions. [2024-11-07 11:02:08,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 11:02:08,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2024-11-07 11:02:08,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:02:08,847 INFO L225 Difference]: With dead ends: 212 [2024-11-07 11:02:08,847 INFO L226 Difference]: Without dead ends: 109 [2024-11-07 11:02:08,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:02:08,848 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 1 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 11:02:08,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 430 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 11:02:08,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-07 11:02:08,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2024-11-07 11:02:08,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 89 states have (on average 1.348314606741573) internal successors, (120), 89 states have internal predecessors, (120), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 11:02:08,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 154 transitions. [2024-11-07 11:02:08,864 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 154 transitions. Word has length 136 [2024-11-07 11:02:08,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:02:08,864 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 154 transitions. [2024-11-07 11:02:08,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 11:02:08,864 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 154 transitions. [2024-11-07 11:02:08,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-07 11:02:08,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:02:08,866 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 11:02:08,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 11:02:08,866 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:02:08,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:02:08,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1930203745, now seen corresponding path program 1 times [2024-11-07 11:02:08,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:02:08,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166615923] [2024-11-07 11:02:08,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:02:08,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:02:08,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:02:09,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:02:09,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:02:09,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:02:09,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:02:09,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:02:09,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:02:09,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:02:09,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:02:09,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:02:09,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:02:09,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:02:09,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:02:09,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:02:09,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 11:02:09,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 11:02:09,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 11:02:09,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,098 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 11:02:09,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:02:09,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166615923] [2024-11-07 11:02:09,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166615923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:02:09,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:02:09,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 11:02:09,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327426755] [2024-11-07 11:02:09,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:02:09,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 11:02:09,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:02:09,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 11:02:09,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:02:09,100 INFO L87 Difference]: Start difference. First operand 108 states and 154 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 11:02:09,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:02:09,120 INFO L93 Difference]: Finished difference Result 216 states and 309 transitions. [2024-11-07 11:02:09,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 11:02:09,120 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2024-11-07 11:02:09,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:02:09,122 INFO L225 Difference]: With dead ends: 216 [2024-11-07 11:02:09,122 INFO L226 Difference]: Without dead ends: 111 [2024-11-07 11:02:09,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:02:09,123 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 1 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 11:02:09,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 431 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 11:02:09,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-07 11:02:09,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-11-07 11:02:09,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 91 states have internal predecessors, (122), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 11:02:09,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 156 transitions. [2024-11-07 11:02:09,128 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 156 transitions. Word has length 136 [2024-11-07 11:02:09,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:02:09,129 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 156 transitions. [2024-11-07 11:02:09,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 11:02:09,129 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 156 transitions. [2024-11-07 11:02:09,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-07 11:02:09,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:02:09,130 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 11:02:09,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 11:02:09,131 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:02:09,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:02:09,131 INFO L85 PathProgramCache]: Analyzing trace with hash -155196383, now seen corresponding path program 1 times [2024-11-07 11:02:09,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:02:09,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537492172] [2024-11-07 11:02:09,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:02:09,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:02:09,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:02:09,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:02:09,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:02:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:02:09,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:02:09,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:02:09,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:02:09,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:02:09,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:02:09,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:02:09,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:02:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:02:09,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:02:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:02:09,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 11:02:09,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 11:02:09,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 11:02:09,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,299 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 11:02:09,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:02:09,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537492172] [2024-11-07 11:02:09,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537492172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:02:09,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:02:09,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 11:02:09,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702006819] [2024-11-07 11:02:09,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:02:09,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 11:02:09,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:02:09,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 11:02:09,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:02:09,302 INFO L87 Difference]: Start difference. First operand 110 states and 156 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 11:02:09,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:02:09,330 INFO L93 Difference]: Finished difference Result 220 states and 313 transitions. [2024-11-07 11:02:09,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 11:02:09,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2024-11-07 11:02:09,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:02:09,331 INFO L225 Difference]: With dead ends: 220 [2024-11-07 11:02:09,331 INFO L226 Difference]: Without dead ends: 113 [2024-11-07 11:02:09,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 11:02:09,332 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 1 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 11:02:09,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 433 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 11:02:09,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-07 11:02:09,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-11-07 11:02:09,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 93 states have internal predecessors, (124), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 11:02:09,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 158 transitions. [2024-11-07 11:02:09,341 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 158 transitions. Word has length 136 [2024-11-07 11:02:09,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:02:09,342 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 158 transitions. [2024-11-07 11:02:09,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 11:02:09,343 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 158 transitions. [2024-11-07 11:02:09,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-07 11:02:09,345 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:02:09,345 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 11:02:09,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 11:02:09,345 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:02:09,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:02:09,346 INFO L85 PathProgramCache]: Analyzing trace with hash -153349341, now seen corresponding path program 1 times [2024-11-07 11:02:09,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:02:09,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969807199] [2024-11-07 11:02:09,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:02:09,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:02:09,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:02:09,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:02:09,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:02:09,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:02:09,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:02:09,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:02:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:02:09,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:02:09,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:02:09,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:02:09,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:02:09,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:02:09,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:02:09,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:02:09,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 11:02:09,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 11:02:09,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 11:02:09,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:09,947 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 11:02:09,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:02:09,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969807199] [2024-11-07 11:02:09,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969807199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:02:09,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:02:09,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 11:02:09,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040153612] [2024-11-07 11:02:09,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:02:09,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 11:02:09,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:02:09,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 11:02:09,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 11:02:09,948 INFO L87 Difference]: Start difference. First operand 112 states and 158 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 11:02:10,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:02:10,384 INFO L93 Difference]: Finished difference Result 236 states and 336 transitions. [2024-11-07 11:02:10,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 11:02:10,384 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 136 [2024-11-07 11:02:10,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:02:10,385 INFO L225 Difference]: With dead ends: 236 [2024-11-07 11:02:10,385 INFO L226 Difference]: Without dead ends: 127 [2024-11-07 11:02:10,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 11:02:10,386 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 256 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 11:02:10,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 305 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 11:02:10,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-07 11:02:10,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 123. [2024-11-07 11:02:10,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 104 states have (on average 1.3461538461538463) internal successors, (140), 104 states have internal predecessors, (140), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 11:02:10,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 174 transitions. [2024-11-07 11:02:10,394 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 174 transitions. Word has length 136 [2024-11-07 11:02:10,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:02:10,394 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 174 transitions. [2024-11-07 11:02:10,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-07 11:02:10,394 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 174 transitions. [2024-11-07 11:02:10,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-07 11:02:10,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:02:10,395 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 11:02:10,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 11:02:10,395 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:02:10,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:02:10,396 INFO L85 PathProgramCache]: Analyzing trace with hash -287362847, now seen corresponding path program 1 times [2024-11-07 11:02:10,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:02:10,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961388511] [2024-11-07 11:02:10,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:02:10,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:02:10,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:10,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:02:10,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:10,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:02:10,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:10,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:02:10,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:10,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:02:11,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:11,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:02:11,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:11,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:02:11,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:11,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:02:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:11,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:02:11,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:11,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:02:11,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:11,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:02:11,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:11,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:02:11,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:11,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:02:11,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:11,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:02:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:11,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:02:11,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:11,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 11:02:11,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:11,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 11:02:11,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:11,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 11:02:11,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:11,038 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-07 11:02:11,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:02:11,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961388511] [2024-11-07 11:02:11,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961388511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 11:02:11,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 11:02:11,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 11:02:11,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582312927] [2024-11-07 11:02:11,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 11:02:11,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 11:02:11,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 11:02:11,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 11:02:11,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 11:02:11,039 INFO L87 Difference]: Start difference. First operand 123 states and 174 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 11:02:11,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 11:02:11,421 INFO L93 Difference]: Finished difference Result 287 states and 402 transitions. [2024-11-07 11:02:11,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 11:02:11,422 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2024-11-07 11:02:11,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 11:02:11,423 INFO L225 Difference]: With dead ends: 287 [2024-11-07 11:02:11,423 INFO L226 Difference]: Without dead ends: 167 [2024-11-07 11:02:11,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 11:02:11,424 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 258 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 11:02:11,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 359 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 11:02:11,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-07 11:02:11,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 125. [2024-11-07 11:02:11,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 106 states have (on average 1.3396226415094339) internal successors, (142), 106 states have internal predecessors, (142), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-07 11:02:11,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 176 transitions. [2024-11-07 11:02:11,441 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 176 transitions. Word has length 136 [2024-11-07 11:02:11,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 11:02:11,441 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 176 transitions. [2024-11-07 11:02:11,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-07 11:02:11,441 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 176 transitions. [2024-11-07 11:02:11,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-07 11:02:11,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 11:02:11,443 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 11:02:11,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 11:02:11,443 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 11:02:11,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 11:02:11,443 INFO L85 PathProgramCache]: Analyzing trace with hash 638900394, now seen corresponding path program 1 times [2024-11-07 11:02:11,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 11:02:11,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274911094] [2024-11-07 11:02:11,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:02:11,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 11:02:11,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:12,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 11:02:12,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:12,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 11:02:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:13,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 11:02:13,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:13,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 11:02:13,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:13,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 11:02:13,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:13,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-07 11:02:13,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:13,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 11:02:13,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:13,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 11:02:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:13,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 11:02:13,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:13,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 11:02:13,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:13,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 11:02:13,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:13,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 11:02:13,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:13,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 11:02:13,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:13,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 11:02:13,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:13,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 11:02:13,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:13,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 11:02:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:13,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 11:02:13,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:13,138 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 30 proven. 18 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-07 11:02:13,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 11:02:13,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274911094] [2024-11-07 11:02:13,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274911094] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 11:02:13,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188859829] [2024-11-07 11:02:13,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 11:02:13,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 11:02:13,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 11:02:13,141 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-07 11:02:13,142 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-07 11:02:13,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 11:02:13,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-07 11:02:13,363 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 11:02:15,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-07 11:02:15,933 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 25 treesize of output 13 [2024-11-07 11:02:16,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 25 treesize of output 13 [2024-11-07 11:02:16,645 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 25 treesize of output 13 [2024-11-07 11:02:16,919 INFO L349 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2024-11-07 11:02:16,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 36 treesize of output 46 [2024-11-07 11:02:16,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:16,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:16,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:16,975 INFO L349 Elim1Store]: treesize reduction 36, result has 30.8 percent of original size [2024-11-07 11:02:16,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 29 [2024-11-07 11:02:17,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:17,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:17,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:17,053 INFO L349 Elim1Store]: treesize reduction 106, result has 17.2 percent of original size [2024-11-07 11:02:17,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 34 [2024-11-07 11:02:17,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:17,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:17,092 INFO L349 Elim1Store]: treesize reduction 29, result has 3.3 percent of original size [2024-11-07 11:02:17,093 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 1 case distinctions, treesize of input 25 treesize of output 13 [2024-11-07 11:02:17,191 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-07 11:02:17,191 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2024-11-07 11:02:17,283 INFO L349 Elim1Store]: treesize reduction 32, result has 52.2 percent of original size [2024-11-07 11:02:17,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 108 treesize of output 110 [2024-11-07 11:02:17,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:17,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:17,439 INFO L349 Elim1Store]: treesize reduction 254, result has 9.6 percent of original size [2024-11-07 11:02:17,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 154 treesize of output 264 [2024-11-07 11:02:17,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:17,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:17,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:17,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:17,566 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-07 11:02:17,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 72 [2024-11-07 11:02:17,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:17,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:17,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:17,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:17,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:17,606 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-07 11:02:17,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 72 [2024-11-07 11:02:17,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:17,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:17,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:17,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:17,643 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-07 11:02:17,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 72 [2024-11-07 11:02:17,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:17,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:17,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:17,962 INFO L349 Elim1Store]: treesize reduction 36, result has 33.3 percent of original size [2024-11-07 11:02:17,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 51 treesize of output 55 [2024-11-07 11:02:18,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:18,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:18,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:18,030 INFO L349 Elim1Store]: treesize reduction 36, result has 33.3 percent of original size [2024-11-07 11:02:18,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 51 treesize of output 55 [2024-11-07 11:02:18,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:18,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:18,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:18,111 INFO L349 Elim1Store]: treesize reduction 36, result has 33.3 percent of original size [2024-11-07 11:02:18,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 51 treesize of output 55 [2024-11-07 11:02:18,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:18,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:18,266 INFO L349 Elim1Store]: treesize reduction 80, result has 32.8 percent of original size [2024-11-07 11:02:18,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 61 treesize of output 91 [2024-11-07 11:02:19,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:19,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:19,480 INFO L349 Elim1Store]: treesize reduction 698, result has 20.0 percent of original size [2024-11-07 11:02:19,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 8 select indices, 8 select index equivalence classes, 2 disjoint index pairs (out of 28 index pairs), introduced 12 new quantified variables, introduced 52 case distinctions, treesize of input 154 treesize of output 396 [2024-11-07 11:02:20,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:21,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:21,142 INFO L349 Elim1Store]: treesize reduction 320, result has 26.4 percent of original size [2024-11-07 11:02:21,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 2 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 40 case distinctions, treesize of input 162 treesize of output 242 [2024-11-07 11:02:21,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:21,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:21,708 INFO L349 Elim1Store]: treesize reduction 128, result has 31.2 percent of original size [2024-11-07 11:02:21,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 68 treesize of output 115 [2024-11-07 11:02:21,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:22,464 INFO L349 Elim1Store]: treesize reduction 1195, result has 6.7 percent of original size [2024-11-07 11:02:22,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 8 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 15 new quantified variables, introduced 60 case distinctions, treesize of input 632 treesize of output 965 [2024-11-07 11:02:28,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:28,710 INFO L349 Elim1Store]: treesize reduction 20, result has 47.4 percent of original size [2024-11-07 11:02:28,710 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 3 case distinctions, treesize of input 33 treesize of output 41 [2024-11-07 11:02:28,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:28,787 INFO L349 Elim1Store]: treesize reduction 48, result has 42.2 percent of original size [2024-11-07 11:02:28,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 78 treesize of output 101 [2024-11-07 11:02:28,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:28,990 INFO L349 Elim1Store]: treesize reduction 48, result has 42.2 percent of original size [2024-11-07 11:02:28,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 38 treesize of output 61 [2024-11-07 11:02:29,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:29,146 INFO L349 Elim1Store]: treesize reduction 84, result has 38.2 percent of original size [2024-11-07 11:02:29,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 65 treesize of output 103 [2024-11-07 11:02:29,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:29,330 INFO L349 Elim1Store]: treesize reduction 20, result has 47.4 percent of original size [2024-11-07 11:02:29,330 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 3 case distinctions, treesize of input 33 treesize of output 41 [2024-11-07 11:02:29,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:29,406 INFO L349 Elim1Store]: treesize reduction 20, result has 47.4 percent of original size [2024-11-07 11:02:29,407 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 3 case distinctions, treesize of input 33 treesize of output 41 [2024-11-07 11:02:29,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:29,502 INFO L349 Elim1Store]: treesize reduction 48, result has 42.2 percent of original size [2024-11-07 11:02:29,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 60 treesize of output 83 [2024-11-07 11:02:29,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:29,682 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 28 treesize of output 21 [2024-11-07 11:02:29,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-07 11:02:29,758 INFO L349 Elim1Store]: treesize reduction 108, result has 20.6 percent of original size [2024-11-07 11:02:29,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 69 treesize of output 83