./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/rm-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 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/busybox-1.22.0/rm-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 59e9a970db574e887b8f20a3b70f02a1835d825d4580388273c8fd31c622f7ca --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:04:08,798 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:04:08,859 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-01-10 06:04:08,863 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:04:08,863 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:04:08,878 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:04:08,879 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:04:08,879 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:04:08,879 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:04:08,879 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:04:08,879 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:04:08,879 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:04:08,879 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:04:08,880 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:04:08,880 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:04:08,880 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:04:08,880 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:04:08,880 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:04:08,880 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:04:08,880 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:04:08,880 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:04:08,880 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:04:08,880 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:04:08,881 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:04:08,881 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:04:08,881 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:04:08,881 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:04:08,881 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:04:08,881 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:04:08,881 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:04:08,881 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:04:08,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:04:08,881 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:04:08,881 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:04:08,882 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:04:08,882 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:04:08,882 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:04:08,882 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:04:08,882 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:04:08,882 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:04:08,882 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:04:08,882 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:04:08,882 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:04:08,882 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:04:08,882 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:04:08,883 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:04:08,883 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:04:08,883 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 ! overflow) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 59e9a970db574e887b8f20a3b70f02a1835d825d4580388273c8fd31c622f7ca [2025-01-10 06:04:09,155 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:04:09,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:04:09,167 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:04:09,168 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:04:09,169 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:04:09,171 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/rm-1.i [2025-01-10 06:04:10,481 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/55e2cc8b3/f466f16521324d4280756e7411a8f513/FLAG58c9c9b98 [2025-01-10 06:04:11,063 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:04:11,063 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/rm-1.i [2025-01-10 06:04:11,107 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/55e2cc8b3/f466f16521324d4280756e7411a8f513/FLAG58c9c9b98 [2025-01-10 06:04:11,570 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/55e2cc8b3/f466f16521324d4280756e7411a8f513 [2025-01-10 06:04:11,573 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:04:11,574 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:04:11,580 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:04:11,580 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:04:11,587 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:04:11,591 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:04:11" (1/1) ... [2025-01-10 06:04:11,592 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fc97dec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:11, skipping insertion in model container [2025-01-10 06:04:11,593 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:04:11" (1/1) ... [2025-01-10 06:04:11,657 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:04:13,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:04:13,198 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:04:13,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:04:13,547 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2025-01-10 06:04:13,552 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:04:13,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:13 WrapperNode [2025-01-10 06:04:13,553 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:04:13,554 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:04:13,554 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:04:13,554 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:04:13,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:13" (1/1) ... [2025-01-10 06:04:13,590 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:13" (1/1) ... [2025-01-10 06:04:13,653 INFO L138 Inliner]: procedures = 665, calls = 1116, calls flagged for inlining = 33, calls inlined = 32, statements flattened = 2798 [2025-01-10 06:04:13,654 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:04:13,654 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:04:13,654 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:04:13,655 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:04:13,661 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:13" (1/1) ... [2025-01-10 06:04:13,661 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:13" (1/1) ... [2025-01-10 06:04:13,684 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:13" (1/1) ... [2025-01-10 06:04:13,696 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-10 06:04:13,696 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:13" (1/1) ... [2025-01-10 06:04:13,697 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:13" (1/1) ... [2025-01-10 06:04:13,743 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:13" (1/1) ... [2025-01-10 06:04:13,750 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:13" (1/1) ... [2025-01-10 06:04:13,764 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:13" (1/1) ... [2025-01-10 06:04:13,774 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:13" (1/1) ... [2025-01-10 06:04:13,779 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:13" (1/1) ... [2025-01-10 06:04:13,790 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:04:13,791 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:04:13,791 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:04:13,791 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:04:13,792 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:13" (1/1) ... [2025-01-10 06:04:13,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:04:13,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:13,819 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) [2025-01-10 06:04:13,821 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 [2025-01-10 06:04:13,837 INFO L130 BoogieDeclarations]: Found specification of procedure last_char_is [2025-01-10 06:04:13,838 INFO L138 BoogieDeclarations]: Found implementation of procedure last_char_is [2025-01-10 06:04:13,838 INFO L130 BoogieDeclarations]: Found specification of procedure vasprintf [2025-01-10 06:04:13,838 INFO L138 BoogieDeclarations]: Found implementation of procedure vasprintf [2025-01-10 06:04:13,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:04:13,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2025-01-10 06:04:13,838 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2025-01-10 06:04:13,838 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2025-01-10 06:04:13,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-01-10 06:04:13,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-10 06:04:13,838 INFO L130 BoogieDeclarations]: Found specification of procedure bb_ask_confirmation [2025-01-10 06:04:13,838 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_ask_confirmation [2025-01-10 06:04:13,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 06:04:13,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:04:13,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-10 06:04:13,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:04:13,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:04:13,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2025-01-10 06:04:13,839 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2025-01-10 06:04:13,839 INFO L130 BoogieDeclarations]: Found specification of procedure xmalloc [2025-01-10 06:04:13,839 INFO L138 BoogieDeclarations]: Found implementation of procedure xmalloc [2025-01-10 06:04:13,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2025-01-10 06:04:13,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2025-01-10 06:04:13,839 INFO L130 BoogieDeclarations]: Found specification of procedure remove_file [2025-01-10 06:04:13,839 INFO L138 BoogieDeclarations]: Found implementation of procedure remove_file [2025-01-10 06:04:13,839 INFO L130 BoogieDeclarations]: Found specification of procedure access [2025-01-10 06:04:13,840 INFO L138 BoogieDeclarations]: Found implementation of procedure access [2025-01-10 06:04:13,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2025-01-10 06:04:13,840 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2025-01-10 06:04:13,840 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-10 06:04:13,840 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-10 06:04:13,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 06:04:13,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-01-10 06:04:13,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-01-10 06:04:13,840 INFO L130 BoogieDeclarations]: Found specification of procedure bb_show_usage [2025-01-10 06:04:13,840 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_show_usage [2025-01-10 06:04:13,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-10 06:04:13,840 INFO L130 BoogieDeclarations]: Found specification of procedure bb_perror_msg [2025-01-10 06:04:13,840 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_perror_msg [2025-01-10 06:04:13,840 INFO L130 BoogieDeclarations]: Found specification of procedure isatty [2025-01-10 06:04:13,840 INFO L138 BoogieDeclarations]: Found implementation of procedure isatty [2025-01-10 06:04:13,841 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg_and_die [2025-01-10 06:04:13,841 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg_and_die [2025-01-10 06:04:13,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-10 06:04:13,841 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg [2025-01-10 06:04:13,841 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg [2025-01-10 06:04:14,174 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:04:14,175 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:04:16,537 INFO L? ?]: Removed 754 outVars from TransFormulas that were not future-live. [2025-01-10 06:04:16,537 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:04:16,567 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:04:16,567 INFO L312 CfgBuilder]: Removed 30 assume(true) statements. [2025-01-10 06:04:16,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:04:16 BoogieIcfgContainer [2025-01-10 06:04:16,568 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:04:16,569 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:04:16,569 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:04:16,574 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:04:16,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:04:11" (1/3) ... [2025-01-10 06:04:16,575 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ec62db1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:04:16, skipping insertion in model container [2025-01-10 06:04:16,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:04:13" (2/3) ... [2025-01-10 06:04:16,575 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ec62db1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:04:16, skipping insertion in model container [2025-01-10 06:04:16,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:04:16" (3/3) ... [2025-01-10 06:04:16,576 INFO L128 eAbstractionObserver]: Analyzing ICFG rm-1.i [2025-01-10 06:04:16,588 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:04:16,592 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rm-1.i that has 16 procedures, 707 locations, 1 initial locations, 34 loop locations, and 62 error locations. [2025-01-10 06:04:16,693 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:04:16,702 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;@1bd2b926, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:04:16,702 INFO L334 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2025-01-10 06:04:16,707 INFO L276 IsEmpty]: Start isEmpty. Operand has 707 states, 579 states have (on average 1.6062176165803108) internal successors, (930), 647 states have internal predecessors, (930), 50 states have call successors, (50), 15 states have call predecessors, (50), 15 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-10 06:04:16,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-10 06:04:16,711 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:16,711 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-10 06:04:16,711 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-01-10 06:04:16,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:16,715 INFO L85 PathProgramCache]: Analyzing trace with hash 23028548, now seen corresponding path program 1 times [2025-01-10 06:04:16,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:16,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727297933] [2025-01-10 06:04:16,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:16,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:16,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 06:04:17,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 06:04:17,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:17,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:17,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:04:17,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:17,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727297933] [2025-01-10 06:04:17,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727297933] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:17,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:17,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:04:17,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614998438] [2025-01-10 06:04:17,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:17,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:04:17,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:17,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:04:17,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:17,415 INFO L87 Difference]: Start difference. First operand has 707 states, 579 states have (on average 1.6062176165803108) internal successors, (930), 647 states have internal predecessors, (930), 50 states have call successors, (50), 15 states have call predecessors, (50), 15 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:04:17,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:17,548 INFO L93 Difference]: Finished difference Result 1321 states and 1971 transitions. [2025-01-10 06:04:17,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:04:17,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-01-10 06:04:17,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:17,562 INFO L225 Difference]: With dead ends: 1321 [2025-01-10 06:04:17,565 INFO L226 Difference]: Without dead ends: 615 [2025-01-10 06:04:17,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:17,576 INFO L435 NwaCegarLoop]: 871 mSDtfsCounter, 1 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1737 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:17,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1737 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:17,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2025-01-10 06:04:17,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 615. [2025-01-10 06:04:17,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 514 states have (on average 1.5369649805447472) internal successors, (790), 564 states have internal predecessors, (790), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-10 06:04:17,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 873 transitions. [2025-01-10 06:04:17,649 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 873 transitions. Word has length 4 [2025-01-10 06:04:17,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:17,650 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 873 transitions. [2025-01-10 06:04:17,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:04:17,650 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 873 transitions. [2025-01-10 06:04:17,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 06:04:17,651 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:17,651 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-10 06:04:17,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:04:17,651 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-01-10 06:04:17,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:17,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1150541324, now seen corresponding path program 1 times [2025-01-10 06:04:17,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:17,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621837883] [2025-01-10 06:04:17,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:17,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:17,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:04:17,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:04:17,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:17,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:18,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:04:18,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:18,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621837883] [2025-01-10 06:04:18,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621837883] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:04:18,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433228897] [2025-01-10 06:04:18,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:18,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:18,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:18,104 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) [2025-01-10 06:04:18,106 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 [2025-01-10 06:04:18,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:04:18,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:04:18,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:18,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:18,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 1735 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:04:18,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:18,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:04:18,638 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:04:18,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433228897] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:18,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:04:18,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-01-10 06:04:18,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155146621] [2025-01-10 06:04:18,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:18,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:04:18,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:18,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:04:18,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:04:18,640 INFO L87 Difference]: Start difference. First operand 615 states and 873 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:04:18,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:18,675 INFO L93 Difference]: Finished difference Result 615 states and 873 transitions. [2025-01-10 06:04:18,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:04:18,681 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-10 06:04:18,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:18,684 INFO L225 Difference]: With dead ends: 615 [2025-01-10 06:04:18,684 INFO L226 Difference]: Without dead ends: 614 [2025-01-10 06:04:18,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:04:18,685 INFO L435 NwaCegarLoop]: 864 mSDtfsCounter, 1 mSDsluCounter, 1726 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2590 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:18,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2590 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:18,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2025-01-10 06:04:18,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2025-01-10 06:04:18,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 514 states have (on average 1.5350194552529184) internal successors, (789), 563 states have internal predecessors, (789), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-10 06:04:18,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 872 transitions. [2025-01-10 06:04:18,702 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 872 transitions. Word has length 7 [2025-01-10 06:04:18,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:18,703 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 872 transitions. [2025-01-10 06:04:18,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:04:18,703 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 872 transitions. [2025-01-10 06:04:18,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 06:04:18,703 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:18,703 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-01-10 06:04:18,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 06:04:18,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:18,904 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-01-10 06:04:18,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:18,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1307041918, now seen corresponding path program 1 times [2025-01-10 06:04:18,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:18,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418800359] [2025-01-10 06:04:18,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:18,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:19,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:04:19,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:04:19,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:19,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:19,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:04:19,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:19,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418800359] [2025-01-10 06:04:19,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418800359] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:19,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:19,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:04:19,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058279341] [2025-01-10 06:04:19,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:19,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:04:19,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:19,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:04:19,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:19,157 INFO L87 Difference]: Start difference. First operand 614 states and 872 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:04:19,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:19,190 INFO L93 Difference]: Finished difference Result 614 states and 872 transitions. [2025-01-10 06:04:19,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:04:19,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-10 06:04:19,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:19,193 INFO L225 Difference]: With dead ends: 614 [2025-01-10 06:04:19,193 INFO L226 Difference]: Without dead ends: 613 [2025-01-10 06:04:19,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:19,194 INFO L435 NwaCegarLoop]: 865 mSDtfsCounter, 0 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1728 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:19,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1728 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:19,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2025-01-10 06:04:19,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 611. [2025-01-10 06:04:19,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 512 states have (on average 1.53515625) internal successors, (786), 560 states have internal predecessors, (786), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-10 06:04:19,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 869 transitions. [2025-01-10 06:04:19,242 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 869 transitions. Word has length 8 [2025-01-10 06:04:19,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:19,243 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 869 transitions. [2025-01-10 06:04:19,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:04:19,243 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 869 transitions. [2025-01-10 06:04:19,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 06:04:19,244 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:19,244 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:19,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:04:19,244 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-01-10 06:04:19,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:19,244 INFO L85 PathProgramCache]: Analyzing trace with hash 696228262, now seen corresponding path program 1 times [2025-01-10 06:04:19,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:19,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293086331] [2025-01-10 06:04:19,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:19,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:19,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:04:19,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:04:19,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:19,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:19,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:04:19,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:19,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293086331] [2025-01-10 06:04:19,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293086331] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:04:19,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083791622] [2025-01-10 06:04:19,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:19,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:19,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:19,802 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:04:19,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 06:04:20,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:04:20,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:04:20,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:20,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:20,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 1752 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 06:04:20,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:20,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:04:20,306 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:04:20,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083791622] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:20,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:04:20,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-01-10 06:04:20,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052555104] [2025-01-10 06:04:20,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:20,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:04:20,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:20,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:04:20,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:04:20,308 INFO L87 Difference]: Start difference. First operand 611 states and 869 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:20,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:20,349 INFO L93 Difference]: Finished difference Result 611 states and 869 transitions. [2025-01-10 06:04:20,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:04:20,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-01-10 06:04:20,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:20,354 INFO L225 Difference]: With dead ends: 611 [2025-01-10 06:04:20,355 INFO L226 Difference]: Without dead ends: 609 [2025-01-10 06:04:20,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:04:20,356 INFO L435 NwaCegarLoop]: 857 mSDtfsCounter, 536 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:20,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 1170 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:20,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2025-01-10 06:04:20,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2025-01-10 06:04:20,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 512 states have (on average 1.53125) internal successors, (784), 558 states have internal predecessors, (784), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-10 06:04:20,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 867 transitions. [2025-01-10 06:04:20,418 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 867 transitions. Word has length 12 [2025-01-10 06:04:20,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:20,419 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 867 transitions. [2025-01-10 06:04:20,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:20,420 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 867 transitions. [2025-01-10 06:04:20,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 06:04:20,420 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:20,420 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:20,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 06:04:20,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:20,624 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-01-10 06:04:20,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:20,625 INFO L85 PathProgramCache]: Analyzing trace with hash 108240407, now seen corresponding path program 1 times [2025-01-10 06:04:20,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:20,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454684833] [2025-01-10 06:04:20,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:20,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:20,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:04:20,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:04:20,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:20,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:20,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:04:20,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:20,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454684833] [2025-01-10 06:04:20,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454684833] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:04:20,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954257160] [2025-01-10 06:04:20,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:20,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:20,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:20,876 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:04:20,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 06:04:21,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:04:21,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:04:21,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:21,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:21,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 1753 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:04:21,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:21,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:04:21,337 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:04:21,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:04:21,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954257160] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:04:21,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:04:21,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 06:04:21,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998891346] [2025-01-10 06:04:21,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:04:21,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:04:21,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:21,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:04:21,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:04:21,408 INFO L87 Difference]: Start difference. First operand 609 states and 867 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:04:21,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:21,464 INFO L93 Difference]: Finished difference Result 1221 states and 1739 transitions. [2025-01-10 06:04:21,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:04:21,465 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 13 [2025-01-10 06:04:21,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:21,468 INFO L225 Difference]: With dead ends: 1221 [2025-01-10 06:04:21,469 INFO L226 Difference]: Without dead ends: 618 [2025-01-10 06:04:21,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:04:21,472 INFO L435 NwaCegarLoop]: 863 mSDtfsCounter, 4 mSDsluCounter, 1722 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2585 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:21,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2585 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:21,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2025-01-10 06:04:21,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2025-01-10 06:04:21,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 521 states have (on average 1.5220729366602688) internal successors, (793), 567 states have internal predecessors, (793), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-10 06:04:21,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 876 transitions. [2025-01-10 06:04:21,491 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 876 transitions. Word has length 13 [2025-01-10 06:04:21,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:21,491 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 876 transitions. [2025-01-10 06:04:21,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:04:21,491 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 876 transitions. [2025-01-10 06:04:21,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-10 06:04:21,492 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:21,492 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:21,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 06:04:21,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:21,693 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-01-10 06:04:21,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:21,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1387702119, now seen corresponding path program 2 times [2025-01-10 06:04:21,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:21,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884823338] [2025-01-10 06:04:21,694 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:04:21,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:21,888 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-01-10 06:04:21,930 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-01-10 06:04:21,931 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:04:21,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:22,141 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:04:22,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:22,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884823338] [2025-01-10 06:04:22,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884823338] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:22,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:22,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:04:22,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070684687] [2025-01-10 06:04:22,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:22,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:04:22,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:22,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:04:22,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:04:22,143 INFO L87 Difference]: Start difference. First operand 618 states and 876 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:22,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:22,245 INFO L93 Difference]: Finished difference Result 618 states and 876 transitions. [2025-01-10 06:04:22,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:04:22,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-01-10 06:04:22,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:22,249 INFO L225 Difference]: With dead ends: 618 [2025-01-10 06:04:22,249 INFO L226 Difference]: Without dead ends: 616 [2025-01-10 06:04:22,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:04:22,250 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 535 mSDsluCounter, 1973 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 2819 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:22,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 2819 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:04:22,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2025-01-10 06:04:22,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 616. [2025-01-10 06:04:22,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 521 states have (on average 1.5182341650671785) internal successors, (791), 565 states have internal predecessors, (791), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-10 06:04:22,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 874 transitions. [2025-01-10 06:04:22,270 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 874 transitions. Word has length 22 [2025-01-10 06:04:22,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:22,271 INFO L471 AbstractCegarLoop]: Abstraction has 616 states and 874 transitions. [2025-01-10 06:04:22,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:22,271 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 874 transitions. [2025-01-10 06:04:22,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-10 06:04:22,272 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:22,272 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:22,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:04:22,272 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-01-10 06:04:22,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:22,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1010920066, now seen corresponding path program 1 times [2025-01-10 06:04:22,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:22,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38200035] [2025-01-10 06:04:22,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:22,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:22,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 06:04:22,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 06:04:22,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:22,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:22,620 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:04:22,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:22,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38200035] [2025-01-10 06:04:22,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38200035] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:22,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:22,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:04:22,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276890378] [2025-01-10 06:04:22,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:22,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:04:22,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:22,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:04:22,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:22,622 INFO L87 Difference]: Start difference. First operand 616 states and 874 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:22,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:22,653 INFO L93 Difference]: Finished difference Result 1215 states and 1732 transitions. [2025-01-10 06:04:22,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:04:22,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-01-10 06:04:22,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:22,656 INFO L225 Difference]: With dead ends: 1215 [2025-01-10 06:04:22,656 INFO L226 Difference]: Without dead ends: 619 [2025-01-10 06:04:22,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:22,657 INFO L435 NwaCegarLoop]: 861 mSDtfsCounter, 2 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1717 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:22,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1717 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:22,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2025-01-10 06:04:22,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 619. [2025-01-10 06:04:22,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 524 states have (on average 1.515267175572519) internal successors, (794), 568 states have internal predecessors, (794), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-10 06:04:22,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 877 transitions. [2025-01-10 06:04:22,672 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 877 transitions. Word has length 27 [2025-01-10 06:04:22,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:22,672 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 877 transitions. [2025-01-10 06:04:22,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:22,672 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 877 transitions. [2025-01-10 06:04:22,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-10 06:04:22,673 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:22,673 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:22,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:04:22,673 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-01-10 06:04:22,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:22,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1273263566, now seen corresponding path program 1 times [2025-01-10 06:04:22,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:22,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154990986] [2025-01-10 06:04:22,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:22,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:22,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 06:04:22,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 06:04:22,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:22,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:22,932 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:04:22,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:22,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154990986] [2025-01-10 06:04:22,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154990986] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:22,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:22,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:04:22,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105751767] [2025-01-10 06:04:22,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:22,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:04:22,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:22,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:04:22,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:22,934 INFO L87 Difference]: Start difference. First operand 619 states and 877 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:22,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:22,985 INFO L93 Difference]: Finished difference Result 924 states and 1323 transitions. [2025-01-10 06:04:22,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:04:22,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2025-01-10 06:04:22,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:22,989 INFO L225 Difference]: With dead ends: 924 [2025-01-10 06:04:22,989 INFO L226 Difference]: Without dead ends: 922 [2025-01-10 06:04:22,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:22,990 INFO L435 NwaCegarLoop]: 856 mSDtfsCounter, 418 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 1704 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:22,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 1704 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:22,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2025-01-10 06:04:23,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 623. [2025-01-10 06:04:23,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 528 states have (on average 1.5132575757575757) internal successors, (799), 572 states have internal predecessors, (799), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-10 06:04:23,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 882 transitions. [2025-01-10 06:04:23,014 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 882 transitions. Word has length 28 [2025-01-10 06:04:23,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:23,014 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 882 transitions. [2025-01-10 06:04:23,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:23,014 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 882 transitions. [2025-01-10 06:04:23,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 06:04:23,015 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:23,015 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:23,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:04:23,015 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-01-10 06:04:23,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:23,015 INFO L85 PathProgramCache]: Analyzing trace with hash -13950927, now seen corresponding path program 1 times [2025-01-10 06:04:23,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:23,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930772730] [2025-01-10 06:04:23,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:23,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:23,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 06:04:23,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 06:04:23,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:23,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:23,330 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-10 06:04:23,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:23,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930772730] [2025-01-10 06:04:23,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930772730] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:23,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:23,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:04:23,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715599441] [2025-01-10 06:04:23,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:23,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:04:23,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:23,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:04:23,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:23,331 INFO L87 Difference]: Start difference. First operand 623 states and 882 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:23,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:23,365 INFO L93 Difference]: Finished difference Result 636 states and 897 transitions. [2025-01-10 06:04:23,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:04:23,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-01-10 06:04:23,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:23,368 INFO L225 Difference]: With dead ends: 636 [2025-01-10 06:04:23,368 INFO L226 Difference]: Without dead ends: 634 [2025-01-10 06:04:23,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:23,369 INFO L435 NwaCegarLoop]: 859 mSDtfsCounter, 3 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1714 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:23,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1714 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:23,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2025-01-10 06:04:23,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 632. [2025-01-10 06:04:23,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 537 states have (on average 1.5121042830540037) internal successors, (812), 581 states have internal predecessors, (812), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-10 06:04:23,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 895 transitions. [2025-01-10 06:04:23,384 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 895 transitions. Word has length 30 [2025-01-10 06:04:23,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:23,385 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 895 transitions. [2025-01-10 06:04:23,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:23,385 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 895 transitions. [2025-01-10 06:04:23,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-10 06:04:23,385 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:23,385 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:23,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:04:23,386 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-01-10 06:04:23,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:23,386 INFO L85 PathProgramCache]: Analyzing trace with hash -13951119, now seen corresponding path program 1 times [2025-01-10 06:04:23,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:23,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390360261] [2025-01-10 06:04:23,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:23,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:23,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 06:04:23,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 06:04:23,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:23,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:23,658 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:04:23,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:23,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390360261] [2025-01-10 06:04:23,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390360261] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:04:23,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040495313] [2025-01-10 06:04:23,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:23,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:23,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:23,661 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:04:23,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 06:04:23,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 06:04:24,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 06:04:24,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:24,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:24,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 1938 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:04:24,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:24,218 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:04:24,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:04:24,285 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:04:24,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040495313] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:04:24,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:04:24,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-01-10 06:04:24,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122909976] [2025-01-10 06:04:24,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:04:24,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 06:04:24,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:24,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 06:04:24,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-01-10 06:04:24,287 INFO L87 Difference]: Start difference. First operand 632 states and 895 transitions. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 06:04:24,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:24,390 INFO L93 Difference]: Finished difference Result 1266 states and 1798 transitions. [2025-01-10 06:04:24,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 06:04:24,391 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2025-01-10 06:04:24,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:24,394 INFO L225 Difference]: With dead ends: 1266 [2025-01-10 06:04:24,394 INFO L226 Difference]: Without dead ends: 649 [2025-01-10 06:04:24,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-01-10 06:04:24,396 INFO L435 NwaCegarLoop]: 855 mSDtfsCounter, 5 mSDsluCounter, 3412 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 4267 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:24,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 4267 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:04:24,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2025-01-10 06:04:24,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 649. [2025-01-10 06:04:24,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 555 states have (on average 1.491891891891892) internal successors, (828), 598 states have internal predecessors, (828), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-10 06:04:24,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 911 transitions. [2025-01-10 06:04:24,414 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 911 transitions. Word has length 30 [2025-01-10 06:04:24,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:24,414 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 911 transitions. [2025-01-10 06:04:24,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-10 06:04:24,414 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 911 transitions. [2025-01-10 06:04:24,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-10 06:04:24,415 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:24,415 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:24,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 06:04:24,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-10 06:04:24,616 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-01-10 06:04:24,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:24,616 INFO L85 PathProgramCache]: Analyzing trace with hash -958673988, now seen corresponding path program 1 times [2025-01-10 06:04:24,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:24,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920756437] [2025-01-10 06:04:24,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:24,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:24,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 06:04:24,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 06:04:24,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:24,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:24,847 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-01-10 06:04:24,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:24,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920756437] [2025-01-10 06:04:24,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920756437] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:24,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:24,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:04:24,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227718843] [2025-01-10 06:04:24,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:24,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:04:24,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:24,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:04:24,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:24,848 INFO L87 Difference]: Start difference. First operand 649 states and 911 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:24,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:24,870 INFO L93 Difference]: Finished difference Result 649 states and 911 transitions. [2025-01-10 06:04:24,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:04:24,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-01-10 06:04:24,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:24,874 INFO L225 Difference]: With dead ends: 649 [2025-01-10 06:04:24,874 INFO L226 Difference]: Without dead ends: 648 [2025-01-10 06:04:24,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:24,875 INFO L435 NwaCegarLoop]: 859 mSDtfsCounter, 0 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1715 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:24,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1715 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:24,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2025-01-10 06:04:24,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 644. [2025-01-10 06:04:24,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 551 states have (on average 1.4918330308529946) internal successors, (822), 593 states have internal predecessors, (822), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-10 06:04:24,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 905 transitions. [2025-01-10 06:04:24,892 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 905 transitions. Word has length 49 [2025-01-10 06:04:24,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:24,892 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 905 transitions. [2025-01-10 06:04:24,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:24,892 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 905 transitions. [2025-01-10 06:04:24,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-10 06:04:24,893 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:24,893 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:24,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:04:24,893 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-01-10 06:04:24,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:24,894 INFO L85 PathProgramCache]: Analyzing trace with hash -12815987, now seen corresponding path program 1 times [2025-01-10 06:04:24,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:24,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225165967] [2025-01-10 06:04:24,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:24,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:25,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 06:04:25,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 06:04:25,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:25,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:25,198 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:04:25,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:25,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225165967] [2025-01-10 06:04:25,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225165967] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:04:25,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265543747] [2025-01-10 06:04:25,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:25,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:25,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:25,201 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:04:25,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-10 06:04:25,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 06:04:25,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 06:04:25,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:25,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:25,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 2058 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:04:25,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:25,760 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:04:25,760 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:04:25,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265543747] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:25,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:04:25,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-01-10 06:04:25,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542657350] [2025-01-10 06:04:25,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:25,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:04:25,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:25,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:04:25,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:04:25,762 INFO L87 Difference]: Start difference. First operand 644 states and 905 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:25,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:25,838 INFO L93 Difference]: Finished difference Result 947 states and 1350 transitions. [2025-01-10 06:04:25,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:04:25,838 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2025-01-10 06:04:25,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:25,842 INFO L225 Difference]: With dead ends: 947 [2025-01-10 06:04:25,842 INFO L226 Difference]: Without dead ends: 946 [2025-01-10 06:04:25,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:04:25,843 INFO L435 NwaCegarLoop]: 1288 mSDtfsCounter, 835 mSDsluCounter, 1286 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 2574 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:25,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 2574 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:04:25,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2025-01-10 06:04:25,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 643. [2025-01-10 06:04:25,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 551 states have (on average 1.4900181488203266) internal successors, (821), 592 states have internal predecessors, (821), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-10 06:04:25,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 904 transitions. [2025-01-10 06:04:25,863 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 904 transitions. Word has length 50 [2025-01-10 06:04:25,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:25,864 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 904 transitions. [2025-01-10 06:04:25,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:25,864 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 904 transitions. [2025-01-10 06:04:25,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-10 06:04:25,865 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:25,865 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:25,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 06:04:26,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-10 06:04:26,066 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-01-10 06:04:26,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:26,067 INFO L85 PathProgramCache]: Analyzing trace with hash -397294794, now seen corresponding path program 1 times [2025-01-10 06:04:26,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:26,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136882576] [2025-01-10 06:04:26,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:26,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:26,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-10 06:04:26,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-10 06:04:26,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:26,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:26,360 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:04:26,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:26,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136882576] [2025-01-10 06:04:26,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136882576] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:04:26,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347045478] [2025-01-10 06:04:26,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:26,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:26,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:26,363 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:04:26,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 06:04:26,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-10 06:04:26,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-10 06:04:26,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:26,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:26,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 2059 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:04:26,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:26,933 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:04:26,934 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:04:26,956 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:04:26,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347045478] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:04:26,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:04:26,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 06:04:26,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742385868] [2025-01-10 06:04:26,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:04:26,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:04:26,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:26,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:04:26,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:04:26,958 INFO L87 Difference]: Start difference. First operand 643 states and 904 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:27,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:27,091 INFO L93 Difference]: Finished difference Result 1852 states and 2678 transitions. [2025-01-10 06:04:27,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:04:27,092 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2025-01-10 06:04:27,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:27,099 INFO L225 Difference]: With dead ends: 1852 [2025-01-10 06:04:27,099 INFO L226 Difference]: Without dead ends: 1851 [2025-01-10 06:04:27,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:04:27,100 INFO L435 NwaCegarLoop]: 853 mSDtfsCounter, 2897 mSDsluCounter, 2584 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2929 SdHoareTripleChecker+Valid, 3437 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:27,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2929 Valid, 3437 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:04:27,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1851 states. [2025-01-10 06:04:27,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1851 to 655. [2025-01-10 06:04:27,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 563 states have (on average 1.4849023090586146) internal successors, (836), 604 states have internal predecessors, (836), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-10 06:04:27,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 919 transitions. [2025-01-10 06:04:27,127 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 919 transitions. Word has length 51 [2025-01-10 06:04:27,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:27,128 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 919 transitions. [2025-01-10 06:04:27,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:27,128 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 919 transitions. [2025-01-10 06:04:27,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-10 06:04:27,128 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:27,129 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:27,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 06:04:27,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-10 06:04:27,330 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-01-10 06:04:27,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:27,330 INFO L85 PathProgramCache]: Analyzing trace with hash -633898262, now seen corresponding path program 1 times [2025-01-10 06:04:27,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:27,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669878067] [2025-01-10 06:04:27,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:27,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:27,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-10 06:04:27,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 06:04:27,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:27,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:27,705 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-01-10 06:04:27,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:27,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669878067] [2025-01-10 06:04:27,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669878067] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:04:27,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539847180] [2025-01-10 06:04:27,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:27,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:27,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:27,708 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:04:27,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 06:04:28,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-10 06:04:28,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-10 06:04:28,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:28,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:28,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 2107 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 06:04:28,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:28,389 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-01-10 06:04:28,389 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:04:28,408 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-01-10 06:04:28,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539847180] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:04:28,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:04:28,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-10 06:04:28,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328923338] [2025-01-10 06:04:28,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:04:28,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 06:04:28,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:28,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 06:04:28,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:04:28,410 INFO L87 Difference]: Start difference. First operand 655 states and 919 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:28,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:28,454 INFO L93 Difference]: Finished difference Result 1285 states and 1815 transitions. [2025-01-10 06:04:28,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:04:28,455 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2025-01-10 06:04:28,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:28,458 INFO L225 Difference]: With dead ends: 1285 [2025-01-10 06:04:28,458 INFO L226 Difference]: Without dead ends: 673 [2025-01-10 06:04:28,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:04:28,460 INFO L435 NwaCegarLoop]: 858 mSDtfsCounter, 4 mSDsluCounter, 2565 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3423 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:28,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3423 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:28,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2025-01-10 06:04:28,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 673. [2025-01-10 06:04:28,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 581 states have (on average 1.4698795180722892) internal successors, (854), 622 states have internal predecessors, (854), 45 states have call successors, (45), 15 states have call predecessors, (45), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-10 06:04:28,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 937 transitions. [2025-01-10 06:04:28,478 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 937 transitions. Word has length 55 [2025-01-10 06:04:28,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:28,479 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 937 transitions. [2025-01-10 06:04:28,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:28,479 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 937 transitions. [2025-01-10 06:04:28,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-10 06:04:28,479 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:28,480 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:28,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 06:04:28,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:28,680 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-01-10 06:04:28,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:28,681 INFO L85 PathProgramCache]: Analyzing trace with hash -2024707292, now seen corresponding path program 1 times [2025-01-10 06:04:28,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:28,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083027929] [2025-01-10 06:04:28,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:28,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:28,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-10 06:04:28,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-10 06:04:28,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:28,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:28,942 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:04:28,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:28,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083027929] [2025-01-10 06:04:28,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083027929] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:28,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:28,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:04:28,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413084464] [2025-01-10 06:04:28,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:28,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:04:28,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:28,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:04:28,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:28,944 INFO L87 Difference]: Start difference. First operand 673 states and 937 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:04:29,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:29,039 INFO L93 Difference]: Finished difference Result 1343 states and 1902 transitions. [2025-01-10 06:04:29,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:04:29,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 60 [2025-01-10 06:04:29,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:29,042 INFO L225 Difference]: With dead ends: 1343 [2025-01-10 06:04:29,042 INFO L226 Difference]: Without dead ends: 770 [2025-01-10 06:04:29,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:29,045 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 121 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 1662 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:29,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 1662 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:04:29,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2025-01-10 06:04:29,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 716. [2025-01-10 06:04:29,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 623 states have (on average 1.4622792937399678) internal successors, (911), 664 states have internal predecessors, (911), 46 states have call successors, (46), 15 states have call predecessors, (46), 13 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-10 06:04:29,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 996 transitions. [2025-01-10 06:04:29,062 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 996 transitions. Word has length 60 [2025-01-10 06:04:29,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:29,062 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 996 transitions. [2025-01-10 06:04:29,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:04:29,063 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 996 transitions. [2025-01-10 06:04:29,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-10 06:04:29,063 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:29,063 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:29,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 06:04:29,063 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-01-10 06:04:29,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:29,064 INFO L85 PathProgramCache]: Analyzing trace with hash -123495414, now seen corresponding path program 1 times [2025-01-10 06:04:29,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:29,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844095162] [2025-01-10 06:04:29,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:29,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:29,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-10 06:04:29,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-10 06:04:29,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:29,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:29,297 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:04:29,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:29,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844095162] [2025-01-10 06:04:29,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844095162] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:29,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:29,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:04:29,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559998081] [2025-01-10 06:04:29,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:29,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:04:29,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:29,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:04:29,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:29,299 INFO L87 Difference]: Start difference. First operand 716 states and 996 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:04:29,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:29,322 INFO L93 Difference]: Finished difference Result 718 states and 996 transitions. [2025-01-10 06:04:29,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:04:29,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 62 [2025-01-10 06:04:29,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:29,329 INFO L225 Difference]: With dead ends: 718 [2025-01-10 06:04:29,329 INFO L226 Difference]: Without dead ends: 716 [2025-01-10 06:04:29,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:29,330 INFO L435 NwaCegarLoop]: 859 mSDtfsCounter, 1 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1712 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:29,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1712 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:29,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2025-01-10 06:04:29,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2025-01-10 06:04:29,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 623 states have (on average 1.4590690208667736) internal successors, (909), 664 states have internal predecessors, (909), 46 states have call successors, (46), 15 states have call predecessors, (46), 13 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-10 06:04:29,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 994 transitions. [2025-01-10 06:04:29,346 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 994 transitions. Word has length 62 [2025-01-10 06:04:29,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:29,346 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 994 transitions. [2025-01-10 06:04:29,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:04:29,346 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 994 transitions. [2025-01-10 06:04:29,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-10 06:04:29,347 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:29,347 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:29,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 06:04:29,347 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-01-10 06:04:29,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:29,347 INFO L85 PathProgramCache]: Analyzing trace with hash 371663429, now seen corresponding path program 2 times [2025-01-10 06:04:29,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:29,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644372749] [2025-01-10 06:04:29,348 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:04:29,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:29,447 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 63 statements into 2 equivalence classes. [2025-01-10 06:04:29,503 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 63 statements. [2025-01-10 06:04:29,503 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:04:29,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:29,685 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-01-10 06:04:29,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:29,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644372749] [2025-01-10 06:04:29,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644372749] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:29,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:29,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 06:04:29,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946626226] [2025-01-10 06:04:29,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:29,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:04:29,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:29,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:04:29,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:04:29,687 INFO L87 Difference]: Start difference. First operand 716 states and 994 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:29,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:29,809 INFO L93 Difference]: Finished difference Result 1360 states and 1910 transitions. [2025-01-10 06:04:29,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:04:29,809 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2025-01-10 06:04:29,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:29,812 INFO L225 Difference]: With dead ends: 1360 [2025-01-10 06:04:29,812 INFO L226 Difference]: Without dead ends: 716 [2025-01-10 06:04:29,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:04:29,813 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 536 mSDsluCounter, 2786 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 3626 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:29,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 3626 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:04:29,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2025-01-10 06:04:29,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2025-01-10 06:04:29,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 623 states have (on average 1.4574638844301766) internal successors, (908), 664 states have internal predecessors, (908), 46 states have call successors, (46), 15 states have call predecessors, (46), 13 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-10 06:04:29,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 993 transitions. [2025-01-10 06:04:29,829 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 993 transitions. Word has length 63 [2025-01-10 06:04:29,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:29,829 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 993 transitions. [2025-01-10 06:04:29,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:29,829 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 993 transitions. [2025-01-10 06:04:29,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-10 06:04:29,829 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:29,829 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:29,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 06:04:29,830 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-01-10 06:04:29,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:29,830 INFO L85 PathProgramCache]: Analyzing trace with hash -54593870, now seen corresponding path program 2 times [2025-01-10 06:04:29,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:29,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006950833] [2025-01-10 06:04:29,830 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:04:29,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:29,940 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-01-10 06:04:30,046 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-01-10 06:04:30,047 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:04:30,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:30,200 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-01-10 06:04:30,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:30,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006950833] [2025-01-10 06:04:30,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006950833] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:04:30,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238352713] [2025-01-10 06:04:30,201 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:04:30,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:30,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:30,203 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:04:30,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 06:04:30,627 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-01-10 06:04:33,024 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-01-10 06:04:33,024 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 06:04:33,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:33,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 2245 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:04:33,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:33,074 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-01-10 06:04:33,074 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:04:33,132 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 58 proven. 22 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-01-10 06:04:33,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238352713] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:04:33,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:04:33,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-01-10 06:04:33,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750312857] [2025-01-10 06:04:33,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:04:33,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 06:04:33,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:33,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 06:04:33,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-01-10 06:04:33,134 INFO L87 Difference]: Start difference. First operand 716 states and 993 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:33,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:33,423 INFO L93 Difference]: Finished difference Result 1415 states and 1979 transitions. [2025-01-10 06:04:33,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-10 06:04:33,424 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2025-01-10 06:04:33,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:33,427 INFO L225 Difference]: With dead ends: 1415 [2025-01-10 06:04:33,427 INFO L226 Difference]: Without dead ends: 751 [2025-01-10 06:04:33,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=330, Invalid=792, Unknown=0, NotChecked=0, Total=1122 [2025-01-10 06:04:33,430 INFO L435 NwaCegarLoop]: 853 mSDtfsCounter, 9 mSDsluCounter, 3400 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 4253 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:33,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 4253 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:04:33,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2025-01-10 06:04:33,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 751. [2025-01-10 06:04:33,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 659 states have (on average 1.4309559939301972) internal successors, (943), 699 states have internal predecessors, (943), 46 states have call successors, (46), 15 states have call predecessors, (46), 13 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-10 06:04:33,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1028 transitions. [2025-01-10 06:04:33,447 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1028 transitions. Word has length 73 [2025-01-10 06:04:33,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:33,448 INFO L471 AbstractCegarLoop]: Abstraction has 751 states and 1028 transitions. [2025-01-10 06:04:33,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:33,448 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1028 transitions. [2025-01-10 06:04:33,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-10 06:04:33,449 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:33,449 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:33,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 06:04:33,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 06:04:33,650 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-01-10 06:04:33,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:33,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1360094823, now seen corresponding path program 1 times [2025-01-10 06:04:33,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:33,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857488860] [2025-01-10 06:04:33,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:33,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:33,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-10 06:04:33,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-10 06:04:33,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:33,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:34,078 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-01-10 06:04:34,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:34,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857488860] [2025-01-10 06:04:34,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857488860] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:04:34,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446896107] [2025-01-10 06:04:34,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:34,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:34,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:34,081 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:04:34,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 06:04:34,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-10 06:04:34,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-10 06:04:34,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:34,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:34,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 2366 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:04:34,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:34,755 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-01-10 06:04:34,756 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:04:34,822 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-01-10 06:04:34,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446896107] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:04:34,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:04:34,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-01-10 06:04:34,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086050928] [2025-01-10 06:04:34,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:04:34,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 06:04:34,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:34,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 06:04:34,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 06:04:34,824 INFO L87 Difference]: Start difference. First operand 751 states and 1028 transitions. Second operand has 13 states, 12 states have (on average 5.583333333333333) internal successors, (67), 13 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:35,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:35,148 INFO L93 Difference]: Finished difference Result 4196 states and 6024 transitions. [2025-01-10 06:04:35,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 06:04:35,149 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.583333333333333) internal successors, (67), 13 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2025-01-10 06:04:35,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:35,162 INFO L225 Difference]: With dead ends: 4196 [2025-01-10 06:04:35,162 INFO L226 Difference]: Without dead ends: 4195 [2025-01-10 06:04:35,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 06:04:35,164 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 6134 mSDsluCounter, 7322 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6214 SdHoareTripleChecker+Valid, 8174 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:35,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6214 Valid, 8174 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 06:04:35,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4195 states. [2025-01-10 06:04:35,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4195 to 775. [2025-01-10 06:04:35,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 683 states have (on average 1.424597364568082) internal successors, (973), 723 states have internal predecessors, (973), 46 states have call successors, (46), 15 states have call predecessors, (46), 13 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-10 06:04:35,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1058 transitions. [2025-01-10 06:04:35,206 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1058 transitions. Word has length 97 [2025-01-10 06:04:35,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:35,207 INFO L471 AbstractCegarLoop]: Abstraction has 775 states and 1058 transitions. [2025-01-10 06:04:35,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.583333333333333) internal successors, (67), 13 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 06:04:35,207 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1058 transitions. [2025-01-10 06:04:35,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-10 06:04:35,208 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:35,208 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:35,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-10 06:04:35,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:35,409 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-01-10 06:04:35,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:35,409 INFO L85 PathProgramCache]: Analyzing trace with hash 2055453554, now seen corresponding path program 1 times [2025-01-10 06:04:35,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:35,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701995698] [2025-01-10 06:04:35,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:35,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:35,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-10 06:04:35,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-10 06:04:35,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:35,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:35,731 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-01-10 06:04:35,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:35,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701995698] [2025-01-10 06:04:35,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701995698] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:35,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:35,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:04:35,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695520115] [2025-01-10 06:04:35,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:35,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:04:35,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:35,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:04:35,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:04:35,733 INFO L87 Difference]: Start difference. First operand 775 states and 1058 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:04:36,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:36,153 INFO L93 Difference]: Finished difference Result 1305 states and 1821 transitions. [2025-01-10 06:04:36,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:04:36,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 102 [2025-01-10 06:04:36,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:36,157 INFO L225 Difference]: With dead ends: 1305 [2025-01-10 06:04:36,157 INFO L226 Difference]: Without dead ends: 787 [2025-01-10 06:04:36,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:04:36,158 INFO L435 NwaCegarLoop]: 829 mSDtfsCounter, 544 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 1973 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:36,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 1973 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 06:04:36,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2025-01-10 06:04:36,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 783. [2025-01-10 06:04:36,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 689 states have (on average 1.420899854862119) internal successors, (979), 728 states have internal predecessors, (979), 47 states have call successors, (47), 18 states have call predecessors, (47), 14 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-10 06:04:36,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1065 transitions. [2025-01-10 06:04:36,182 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1065 transitions. Word has length 102 [2025-01-10 06:04:36,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:36,182 INFO L471 AbstractCegarLoop]: Abstraction has 783 states and 1065 transitions. [2025-01-10 06:04:36,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:04:36,183 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1065 transitions. [2025-01-10 06:04:36,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-10 06:04:36,183 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:36,183 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:36,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 06:04:36,184 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-01-10 06:04:36,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:36,184 INFO L85 PathProgramCache]: Analyzing trace with hash 280446192, now seen corresponding path program 1 times [2025-01-10 06:04:36,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:36,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878962260] [2025-01-10 06:04:36,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:36,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:36,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-10 06:04:36,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-10 06:04:36,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:36,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:36,549 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-01-10 06:04:36,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:36,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878962260] [2025-01-10 06:04:36,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878962260] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:36,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:36,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:04:36,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856196039] [2025-01-10 06:04:36,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:36,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:04:36,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:36,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:04:36,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:36,551 INFO L87 Difference]: Start difference. First operand 783 states and 1065 transitions. Second operand has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:04:36,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:36,642 INFO L93 Difference]: Finished difference Result 1356 states and 1901 transitions. [2025-01-10 06:04:36,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:04:36,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 102 [2025-01-10 06:04:36,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:36,647 INFO L225 Difference]: With dead ends: 1356 [2025-01-10 06:04:36,648 INFO L226 Difference]: Without dead ends: 836 [2025-01-10 06:04:36,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:36,650 INFO L435 NwaCegarLoop]: 919 mSDtfsCounter, 74 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1716 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:36,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1716 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:04:36,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2025-01-10 06:04:36,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 786. [2025-01-10 06:04:36,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 694 states have (on average 1.4164265129682998) internal successors, (983), 731 states have internal predecessors, (983), 47 states have call successors, (47), 18 states have call predecessors, (47), 14 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-10 06:04:36,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1069 transitions. [2025-01-10 06:04:36,675 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1069 transitions. Word has length 102 [2025-01-10 06:04:36,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:36,676 INFO L471 AbstractCegarLoop]: Abstraction has 786 states and 1069 transitions. [2025-01-10 06:04:36,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:04:36,676 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1069 transitions. [2025-01-10 06:04:36,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-10 06:04:36,678 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:36,678 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:36,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 06:04:36,678 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-01-10 06:04:36,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:36,679 INFO L85 PathProgramCache]: Analyzing trace with hash 281080669, now seen corresponding path program 1 times [2025-01-10 06:04:36,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:36,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430661155] [2025-01-10 06:04:36,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:36,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:36,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-10 06:04:36,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-10 06:04:36,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:36,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:37,065 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-01-10 06:04:37,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:37,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430661155] [2025-01-10 06:04:37,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430661155] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:37,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:37,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:04:37,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097372295] [2025-01-10 06:04:37,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:37,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:04:37,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:37,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:04:37,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:37,067 INFO L87 Difference]: Start difference. First operand 786 states and 1069 transitions. Second operand has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:04:37,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:37,162 INFO L93 Difference]: Finished difference Result 840 states and 1148 transitions. [2025-01-10 06:04:37,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:04:37,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 102 [2025-01-10 06:04:37,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:37,168 INFO L225 Difference]: With dead ends: 840 [2025-01-10 06:04:37,168 INFO L226 Difference]: Without dead ends: 837 [2025-01-10 06:04:37,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:37,171 INFO L435 NwaCegarLoop]: 803 mSDtfsCounter, 191 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 1500 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:37,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 1500 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:04:37,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2025-01-10 06:04:37,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 783. [2025-01-10 06:04:37,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 694 states have (on average 1.4121037463976944) internal successors, (980), 728 states have internal predecessors, (980), 47 states have call successors, (47), 18 states have call predecessors, (47), 14 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-10 06:04:37,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1066 transitions. [2025-01-10 06:04:37,205 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1066 transitions. Word has length 102 [2025-01-10 06:04:37,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:37,205 INFO L471 AbstractCegarLoop]: Abstraction has 783 states and 1066 transitions. [2025-01-10 06:04:37,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:04:37,205 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1066 transitions. [2025-01-10 06:04:37,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-10 06:04:37,206 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:37,207 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:37,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 06:04:37,207 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-01-10 06:04:37,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:37,208 INFO L85 PathProgramCache]: Analyzing trace with hash 103898395, now seen corresponding path program 1 times [2025-01-10 06:04:37,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:37,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647925876] [2025-01-10 06:04:37,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:37,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:37,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-10 06:04:37,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-10 06:04:37,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:37,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:37,494 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-01-10 06:04:37,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:37,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647925876] [2025-01-10 06:04:37,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647925876] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:37,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:37,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:04:37,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922424563] [2025-01-10 06:04:37,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:37,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:04:37,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:37,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:04:37,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:37,496 INFO L87 Difference]: Start difference. First operand 783 states and 1066 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:04:37,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:37,586 INFO L93 Difference]: Finished difference Result 1358 states and 1903 transitions. [2025-01-10 06:04:37,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:04:37,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 103 [2025-01-10 06:04:37,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:37,591 INFO L225 Difference]: With dead ends: 1358 [2025-01-10 06:04:37,591 INFO L226 Difference]: Without dead ends: 834 [2025-01-10 06:04:37,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:37,593 INFO L435 NwaCegarLoop]: 831 mSDtfsCounter, 157 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 1579 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:37,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 1579 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:04:37,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2025-01-10 06:04:37,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 768. [2025-01-10 06:04:37,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 683 states have (on average 1.4055636896046853) internal successors, (960), 713 states have internal predecessors, (960), 47 states have call successors, (47), 18 states have call predecessors, (47), 14 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-10 06:04:37,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1046 transitions. [2025-01-10 06:04:37,664 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1046 transitions. Word has length 103 [2025-01-10 06:04:37,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:37,665 INFO L471 AbstractCegarLoop]: Abstraction has 768 states and 1046 transitions. [2025-01-10 06:04:37,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:04:37,665 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1046 transitions. [2025-01-10 06:04:37,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-10 06:04:37,668 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:37,668 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:37,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-10 06:04:37,669 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-01-10 06:04:37,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:37,669 INFO L85 PathProgramCache]: Analyzing trace with hash 123567244, now seen corresponding path program 1 times [2025-01-10 06:04:37,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:37,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206090453] [2025-01-10 06:04:37,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:37,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:37,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-10 06:04:37,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-10 06:04:37,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:37,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:38,066 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-01-10 06:04:38,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:38,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206090453] [2025-01-10 06:04:38,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206090453] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:38,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:38,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:04:38,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465499601] [2025-01-10 06:04:38,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:38,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:04:38,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:38,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:04:38,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:38,069 INFO L87 Difference]: Start difference. First operand 768 states and 1046 transitions. Second operand has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:04:38,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:38,137 INFO L93 Difference]: Finished difference Result 822 states and 1125 transitions. [2025-01-10 06:04:38,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:04:38,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 103 [2025-01-10 06:04:38,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:38,141 INFO L225 Difference]: With dead ends: 822 [2025-01-10 06:04:38,141 INFO L226 Difference]: Without dead ends: 821 [2025-01-10 06:04:38,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:38,143 INFO L435 NwaCegarLoop]: 849 mSDtfsCounter, 188 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 1577 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:38,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 1577 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:38,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2025-01-10 06:04:38,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 767. [2025-01-10 06:04:38,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 683 states have (on average 1.404099560761347) internal successors, (959), 712 states have internal predecessors, (959), 47 states have call successors, (47), 18 states have call predecessors, (47), 14 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-10 06:04:38,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1045 transitions. [2025-01-10 06:04:38,164 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1045 transitions. Word has length 103 [2025-01-10 06:04:38,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:38,165 INFO L471 AbstractCegarLoop]: Abstraction has 767 states and 1045 transitions. [2025-01-10 06:04:38,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.5) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:04:38,165 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1045 transitions. [2025-01-10 06:04:38,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-10 06:04:38,167 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:38,168 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:38,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-10 06:04:38,168 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-01-10 06:04:38,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:38,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1968770186, now seen corresponding path program 1 times [2025-01-10 06:04:38,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:38,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212883874] [2025-01-10 06:04:38,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:38,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:38,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-10 06:04:38,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-10 06:04:38,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:38,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:38,551 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-01-10 06:04:38,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:38,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212883874] [2025-01-10 06:04:38,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212883874] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:04:38,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155305832] [2025-01-10 06:04:38,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:38,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:38,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:38,554 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:04:38,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 06:04:39,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-10 06:04:39,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-10 06:04:39,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:39,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:39,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 2449 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:04:39,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:39,402 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-01-10 06:04:39,402 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:04:39,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155305832] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:39,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:04:39,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-01-10 06:04:39,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567046550] [2025-01-10 06:04:39,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:39,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:04:39,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:39,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:04:39,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:04:39,405 INFO L87 Difference]: Start difference. First operand 767 states and 1045 transitions. Second operand has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:04:39,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:39,569 INFO L93 Difference]: Finished difference Result 1463 states and 2044 transitions. [2025-01-10 06:04:39,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:04:39,570 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 105 [2025-01-10 06:04:39,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:39,575 INFO L225 Difference]: With dead ends: 1463 [2025-01-10 06:04:39,575 INFO L226 Difference]: Without dead ends: 884 [2025-01-10 06:04:39,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:04:39,577 INFO L435 NwaCegarLoop]: 902 mSDtfsCounter, 314 mSDsluCounter, 1608 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 2510 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:39,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 2510 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:04:39,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2025-01-10 06:04:39,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 766. [2025-01-10 06:04:39,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 684 states have (on average 1.3976608187134503) internal successors, (956), 711 states have internal predecessors, (956), 47 states have call successors, (47), 18 states have call predecessors, (47), 14 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-10 06:04:39,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1042 transitions. [2025-01-10 06:04:39,635 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1042 transitions. Word has length 105 [2025-01-10 06:04:39,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:39,635 INFO L471 AbstractCegarLoop]: Abstraction has 766 states and 1042 transitions. [2025-01-10 06:04:39,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 06:04:39,636 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1042 transitions. [2025-01-10 06:04:39,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-10 06:04:39,637 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:39,638 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:39,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-10 06:04:39,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-01-10 06:04:39,839 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-01-10 06:04:39,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:39,840 INFO L85 PathProgramCache]: Analyzing trace with hash -439939958, now seen corresponding path program 1 times [2025-01-10 06:04:39,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:39,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97279949] [2025-01-10 06:04:39,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:39,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:39,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-10 06:04:40,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-10 06:04:40,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:40,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:40,161 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2025-01-10 06:04:40,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:40,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97279949] [2025-01-10 06:04:40,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97279949] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:04:40,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:04:40,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:04:40,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254832403] [2025-01-10 06:04:40,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:04:40,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:04:40,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:04:40,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:04:40,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:40,163 INFO L87 Difference]: Start difference. First operand 766 states and 1042 transitions. Second operand has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:04:40,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:04:40,191 INFO L93 Difference]: Finished difference Result 766 states and 1042 transitions. [2025-01-10 06:04:40,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:04:40,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 108 [2025-01-10 06:04:40,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:04:40,196 INFO L225 Difference]: With dead ends: 766 [2025-01-10 06:04:40,197 INFO L226 Difference]: Without dead ends: 765 [2025-01-10 06:04:40,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:04:40,198 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 1 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1684 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:04:40,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1684 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:04:40,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2025-01-10 06:04:40,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 765. [2025-01-10 06:04:40,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 684 states have (on average 1.3961988304093567) internal successors, (955), 710 states have internal predecessors, (955), 47 states have call successors, (47), 18 states have call predecessors, (47), 14 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-10 06:04:40,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1041 transitions. [2025-01-10 06:04:40,222 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1041 transitions. Word has length 108 [2025-01-10 06:04:40,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:04:40,222 INFO L471 AbstractCegarLoop]: Abstraction has 765 states and 1041 transitions. [2025-01-10 06:04:40,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:04:40,222 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1041 transitions. [2025-01-10 06:04:40,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-10 06:04:40,223 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:04:40,224 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:04:40,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-10 06:04:40,224 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [vasprintfErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, remove_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, remove_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-01-10 06:04:40,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:04:40,225 INFO L85 PathProgramCache]: Analyzing trace with hash -753235955, now seen corresponding path program 1 times [2025-01-10 06:04:40,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:04:40,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356698149] [2025-01-10 06:04:40,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:40,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:04:40,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-10 06:04:40,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-10 06:04:40,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:40,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:46,876 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2025-01-10 06:04:46,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:04:46,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356698149] [2025-01-10 06:04:46,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356698149] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:04:46,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108657375] [2025-01-10 06:04:46,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:04:46,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:04:46,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:04:46,880 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:04:46,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 06:04:47,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-10 06:04:47,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-10 06:04:47,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:04:47,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:04:47,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 2454 conjuncts, 104 conjuncts are in the unsatisfiable core [2025-01-10 06:04:47,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:04:47,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:04:47,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 06:04:47,908 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-10 06:04:47,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-10 06:04:47,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 06:04:47,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 06:04:47,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 06:04:47,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 06:04:48,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 06:04:48,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 06:04:48,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 06:04:48,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 06:04:48,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 06:04:48,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 06:04:48,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 06:04:48,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:04:48,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 06:04:48,271 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-10 06:04:48,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-10 06:04:48,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 06:04:48,314 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-01-10 06:04:48,315 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 4 case distinctions, treesize of input 22 treesize of output 33 [2025-01-10 06:04:48,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 217 treesize of output 132 [2025-01-10 06:04:48,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:04:48,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 138 [2025-01-10 06:04:48,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:04:48,410 INFO L349 Elim1Store]: treesize reduction 45, result has 2.2 percent of original size [2025-01-10 06:04:48,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 78 [2025-01-10 06:04:48,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 26 [2025-01-10 06:04:48,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 144 [2025-01-10 06:04:48,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:04:48,444 INFO L349 Elim1Store]: treesize reduction 41, result has 10.9 percent of original size [2025-01-10 06:04:48,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 101 treesize of output 89 [2025-01-10 06:04:48,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:04:48,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 11 [2025-01-10 06:04:48,466 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2025-01-10 06:04:48,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 25 [2025-01-10 06:04:48,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 138 [2025-01-10 06:04:48,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:04:48,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 100 [2025-01-10 06:04:48,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:04:48,502 INFO L349 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2025-01-10 06:04:48,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 72 [2025-01-10 06:04:48,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 106 [2025-01-10 06:04:48,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-10 06:04:48,520 INFO L349 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2025-01-10 06:04:48,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 78 [2025-01-10 06:04:48,536 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-01-10 06:04:48,536 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-01-10 06:04:48,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-01-10 06:04:48,574 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-01-10 06:04:48,574 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-01-10 06:04:48,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-01-10 06:04:48,616 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-01-10 06:04:48,616 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-01-10 06:04:48,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-01-10 06:04:48,690 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-01-10 06:04:48,690 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-01-10 06:04:48,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-01-10 06:04:48,735 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-01-10 06:04:48,736 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-01-10 06:04:48,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-01-10 06:04:48,777 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-01-10 06:04:48,777 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-01-10 06:04:48,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-01-10 06:04:48,817 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-01-10 06:04:48,817 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-01-10 06:04:48,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-01-10 06:04:48,853 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-01-10 06:04:48,853 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-01-10 06:04:48,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-01-10 06:04:48,894 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-01-10 06:04:48,895 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2025-01-10 06:04:48,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2025-01-10 06:04:48,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 17 [2025-01-10 06:04:48,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-10 06:04:49,031 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2025-01-10 06:04:49,031 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:04:49,347 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7777 (Array Int Int)) (v_ArrVal_7778 (Array Int Int)) (v_ArrVal_7779 (Array Int Int))) (not (= (mod (select (select (let ((.cse1 (+ (* |c_ULTIMATE.start_main_~i~5#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (store (store |c_#memory_int| .cse0 v_ArrVal_7778) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7777) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_7779))) 18) 0) 256) 43))) is different from false [2025-01-10 06:04:49,365 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7777 (Array Int Int)) (v_ArrVal_7778 (Array Int Int)) (v_ArrVal_7775 (Array Int Int)) (v_ArrVal_7776 (Array Int Int)) (v_ArrVal_7779 (Array Int Int))) (not (= 43 (mod (select (select (let ((.cse3 (+ (* |c_ULTIMATE.start_main_~i~5#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7776))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store |c_#memory_int| .cse0 v_ArrVal_7775) .cse1 v_ArrVal_7778) (select (select (store .cse2 .cse1 v_ArrVal_7777) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_7779))))) 18) 0) 256)))) is different from false [2025-01-10 06:04:49,389 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7773 (Array Int Int)) (v_ArrVal_7774 (Array Int Int)) (v_ArrVal_7777 (Array Int Int)) (v_ArrVal_7778 (Array Int Int)) (v_ArrVal_7775 (Array Int Int)) (v_ArrVal_7776 (Array Int Int)) (v_ArrVal_7779 (Array Int Int))) (not (= (mod (select (select (let ((.cse4 (+ (* |c_ULTIMATE.start_main_~i~5#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7773))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_7776))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (store (store (store (store |c_#memory_int| .cse0 v_ArrVal_7774) .cse1 v_ArrVal_7775) .cse2 v_ArrVal_7778) (select (select (store .cse3 .cse2 v_ArrVal_7777) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_7779))))))) 18) 0) 256) 43))) is different from false [2025-01-10 06:04:49,413 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7773 (Array Int Int)) (v_ArrVal_7774 (Array Int Int)) (v_ArrVal_7771 (Array Int Int)) (v_ArrVal_7772 (Array Int Int)) (v_ArrVal_7777 (Array Int Int)) (v_ArrVal_7778 (Array Int Int)) (v_ArrVal_7775 (Array Int Int)) (v_ArrVal_7776 (Array Int Int)) (v_ArrVal_7779 (Array Int Int))) (not (= 43 (mod (select (select (let ((.cse5 (+ (* |c_ULTIMATE.start_main_~i~5#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7772))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_7773))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_7776))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_int| .cse0 v_ArrVal_7771) .cse1 v_ArrVal_7774) .cse2 v_ArrVal_7775) .cse3 v_ArrVal_7778) (select (select (store .cse4 .cse3 v_ArrVal_7777) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_7779))))))))) 18) 0) 256)))) is different from false [2025-01-10 06:04:49,442 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7773 (Array Int Int)) (v_ArrVal_7774 (Array Int Int)) (v_ArrVal_7771 (Array Int Int)) (v_ArrVal_7772 (Array Int Int)) (v_ArrVal_7777 (Array Int Int)) (v_ArrVal_7778 (Array Int Int)) (v_ArrVal_7775 (Array Int Int)) (v_ArrVal_7776 (Array Int Int)) (v_ArrVal_7779 (Array Int Int)) (v_ArrVal_7769 (Array Int Int)) (v_ArrVal_7770 (Array Int Int))) (not (= (mod (select (select (let ((.cse6 (+ (* |c_ULTIMATE.start_main_~i~5#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7770))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse8 (store .cse9 .cse1 v_ArrVal_7772))) (let ((.cse2 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse2 v_ArrVal_7773))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_7776))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (store (store (store (store (store (store |c_#memory_int| .cse0 v_ArrVal_7769) .cse1 v_ArrVal_7771) .cse2 v_ArrVal_7774) .cse3 v_ArrVal_7775) .cse4 v_ArrVal_7778) (select (select (store .cse5 .cse4 v_ArrVal_7777) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6) v_ArrVal_7779))))))))))) 18) 0) 256) 43))) is different from false [2025-01-10 06:04:49,484 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7770 (Array Int Int)) (v_ArrVal_7773 (Array Int Int)) (v_ArrVal_7774 (Array Int Int)) (v_ArrVal_7771 (Array Int Int)) (v_ArrVal_7772 (Array Int Int)) (v_ArrVal_7777 (Array Int Int)) (v_ArrVal_7767 (Array Int Int)) (v_ArrVal_7778 (Array Int Int)) (v_ArrVal_7775 (Array Int Int)) (v_ArrVal_7776 (Array Int Int)) (v_ArrVal_7768 (Array Int Int)) (v_ArrVal_7779 (Array Int Int)) (v_ArrVal_7769 (Array Int Int))) (not (= (mod (select (select (let ((.cse7 (+ (* |c_ULTIMATE.start_main_~i~5#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse11 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7768))) (let ((.cse1 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse10 (store .cse11 .cse1 v_ArrVal_7770))) (let ((.cse2 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse9 (store .cse10 .cse2 v_ArrVal_7772))) (let ((.cse3 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse8 (store .cse9 .cse3 v_ArrVal_7773))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse6 (store .cse8 .cse4 v_ArrVal_7776))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (store (store (store (store (store (store (store |c_#memory_int| .cse0 v_ArrVal_7767) .cse1 v_ArrVal_7769) .cse2 v_ArrVal_7771) .cse3 v_ArrVal_7774) .cse4 v_ArrVal_7775) .cse5 v_ArrVal_7778) (select (select (store .cse6 .cse5 v_ArrVal_7777) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_7779))))))))))))) 18) 0) 256) 43))) is different from false [2025-01-10 06:04:53,772 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7770 (Array Int Int)) (v_ArrVal_7773 (Array Int Int)) (v_ArrVal_7763 (Array Int Int)) (v_ArrVal_7774 (Array Int Int)) (v_ArrVal_7771 (Array Int Int)) (v_ArrVal_7772 (Array Int Int)) (v_ArrVal_7766 (Array Int Int)) (v_ArrVal_7777 (Array Int Int)) (v_ArrVal_7767 (Array Int Int)) (v_ArrVal_7778 (Array Int Int)) (v_ArrVal_7764 (Array Int Int)) (v_ArrVal_7775 (Array Int Int)) (v_ArrVal_7765 (Array Int Int)) (v_ArrVal_7776 (Array Int Int)) (v_ArrVal_7768 (Array Int Int)) (v_ArrVal_7779 (Array Int Int)) (v_ArrVal_7769 (Array Int Int))) (not (= 43 (mod (select (select (let ((.cse9 (+ (* |c_ULTIMATE.start_main_~i~5#1| 8) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse15 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7763))) (let ((.cse1 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse14 (store .cse15 .cse1 v_ArrVal_7765))) (let ((.cse2 (select (select .cse14 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse13 (store .cse14 .cse2 v_ArrVal_7768))) (let ((.cse3 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse12 (store .cse13 .cse3 v_ArrVal_7770))) (let ((.cse4 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse11 (store .cse12 .cse4 v_ArrVal_7772))) (let ((.cse5 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse10 (store .cse11 .cse5 v_ArrVal_7773))) (let ((.cse6 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (let ((.cse8 (store .cse10 .cse6 v_ArrVal_7776))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (store (store (store (store (store (store (store (store (store |c_#memory_int| .cse0 v_ArrVal_7764) .cse1 v_ArrVal_7766) .cse2 v_ArrVal_7767) .cse3 v_ArrVal_7769) .cse4 v_ArrVal_7771) .cse5 v_ArrVal_7774) .cse6 v_ArrVal_7775) .cse7 v_ArrVal_7778) (select (select (store .cse8 .cse7 v_ArrVal_7777) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9) v_ArrVal_7779))))))))))))))))) 18) 0) 256)))) is different from false