./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/ddv-machzwd/ddv_machzwd_inw.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/ddv-machzwd/ddv_machzwd_inw.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6e6f79eda5be95b806b33aaa2a353a360ae33a1e35cc1bf6f128d14768d932de --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:42:13,537 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:42:13,582 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 01:42:13,587 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:42:13,591 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:42:13,613 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:42:13,614 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:42:13,614 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:42:13,614 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:42:13,614 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:42:13,615 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:42:13,615 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:42:13,615 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:42:13,615 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:42:13,615 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:42:13,615 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:42:13,616 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:42:13,616 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:42:13,616 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:42:13,616 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:42:13,616 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:42:13,616 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:42:13,616 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:42:13,616 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:42:13,617 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:42:13,617 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:42:13,617 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:42:13,617 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:42:13,617 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:42:13,617 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:42:13,617 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:42:13,617 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:42:13,617 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:42:13,617 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:42:13,617 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:42:13,618 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:42:13,618 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:42:13,618 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:42:13,618 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:42:13,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:42:13,618 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:42:13,618 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:42:13,618 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:42:13,618 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:42:13,619 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:42:13,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:42:13,619 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:42:13,619 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:42:13,619 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:42:13,619 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:42:13,619 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6e6f79eda5be95b806b33aaa2a353a360ae33a1e35cc1bf6f128d14768d932de [2025-01-10 01:42:13,821 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:42:13,837 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:42:13,838 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:42:13,839 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:42:13,839 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:42:13,850 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ddv-machzwd/ddv_machzwd_inw.i [2025-01-10 01:42:15,078 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/083a399d5/d2bf4fc00e034a87926a09483bcc9172/FLAG38b989a44 [2025-01-10 01:42:15,493 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:42:15,494 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ddv-machzwd/ddv_machzwd_inw.i [2025-01-10 01:42:15,513 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/083a399d5/d2bf4fc00e034a87926a09483bcc9172/FLAG38b989a44 [2025-01-10 01:42:15,618 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/083a399d5/d2bf4fc00e034a87926a09483bcc9172 [2025-01-10 01:42:15,620 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:42:15,621 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:42:15,622 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:42:15,622 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:42:15,624 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:42:15,625 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:42:15" (1/1) ... [2025-01-10 01:42:15,625 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59a2c58f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:15, skipping insertion in model container [2025-01-10 01:42:15,625 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:42:15" (1/1) ... [2025-01-10 01:42:15,670 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:42:16,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:42:16,371 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:42:16,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:42:16,673 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:42:16,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:16 WrapperNode [2025-01-10 01:42:16,675 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:42:16,676 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:42:16,676 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:42:16,676 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:42:16,680 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:16" (1/1) ... [2025-01-10 01:42:16,731 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:16" (1/1) ... [2025-01-10 01:42:16,881 INFO L138 Inliner]: procedures = 473, calls = 2667, calls flagged for inlining = 55, calls inlined = 39, statements flattened = 3372 [2025-01-10 01:42:16,882 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:42:16,882 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:42:16,883 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:42:16,883 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:42:16,889 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:16" (1/1) ... [2025-01-10 01:42:16,889 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:16" (1/1) ... [2025-01-10 01:42:16,911 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:16" (1/1) ... [2025-01-10 01:42:16,981 INFO L175 MemorySlicer]: Split 2024 memory accesses to 27 slices as follows [5, 3, 35, 1040, 480, 59, 35, 11, 5, 2, 15, 120, 2, 67, 5, 0, 2, 20, 4, 3, 2, 16, 18, 12, 37, 21, 5]. 51 percent of accesses are in the largest equivalence class. The 1901 initializations are split as follows [3, 3, 15, 1040, 480, 59, 32, 2, 1, 0, 10, 120, 0, 67, 4, 0, 2, 4, 4, 0, 0, 5, 18, 6, 25, 0, 1]. The 58 writes are split as follows [0, 0, 6, 0, 0, 0, 0, 5, 1, 2, 2, 0, 1, 0, 0, 0, 0, 4, 0, 0, 0, 8, 0, 6, 0, 21, 2]. [2025-01-10 01:42:16,982 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:16" (1/1) ... [2025-01-10 01:42:16,982 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:16" (1/1) ... [2025-01-10 01:42:17,053 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:16" (1/1) ... [2025-01-10 01:42:17,063 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:16" (1/1) ... [2025-01-10 01:42:17,073 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:16" (1/1) ... [2025-01-10 01:42:17,093 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:16" (1/1) ... [2025-01-10 01:42:17,108 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:16" (1/1) ... [2025-01-10 01:42:17,132 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:42:17,133 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:42:17,134 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:42:17,134 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:42:17,134 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:16" (1/1) ... [2025-01-10 01:42:17,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:42:17,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:42:17,164 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 01:42:17,166 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 01:42:17,185 INFO L130 BoogieDeclarations]: Found specification of procedure zf_timer_off [2025-01-10 01:42:17,185 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_timer_off [2025-01-10 01:42:17,186 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 01:42:17,186 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_atomic_begin [2025-01-10 01:42:17,186 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2025-01-10 01:42:17,186 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2025-01-10 01:42:17,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 01:42:17,186 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2025-01-10 01:42:17,186 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2025-01-10 01:42:17,186 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 01:42:17,186 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_atomic_end [2025-01-10 01:42:17,186 INFO L130 BoogieDeclarations]: Found specification of procedure zf_get_control [2025-01-10 01:42:17,187 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_get_control [2025-01-10 01:42:17,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-10 01:42:17,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-10 01:42:17,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-10 01:42:17,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-01-10 01:42:17,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-01-10 01:42:17,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-01-10 01:42:17,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-01-10 01:42:17,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-01-10 01:42:17,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-01-10 01:42:17,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-01-10 01:42:17,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-01-10 01:42:17,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-01-10 01:42:17,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-01-10 01:42:17,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-01-10 01:42:17,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-01-10 01:42:17,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#15 [2025-01-10 01:42:17,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#16 [2025-01-10 01:42:17,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#17 [2025-01-10 01:42:17,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#18 [2025-01-10 01:42:17,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#19 [2025-01-10 01:42:17,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#20 [2025-01-10 01:42:17,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#21 [2025-01-10 01:42:17,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#22 [2025-01-10 01:42:17,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#23 [2025-01-10 01:42:17,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#24 [2025-01-10 01:42:17,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#25 [2025-01-10 01:42:17,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#26 [2025-01-10 01:42:17,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:42:17,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:42:17,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 01:42:17,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 01:42:17,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-10 01:42:17,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-10 01:42:17,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-10 01:42:17,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-10 01:42:17,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-10 01:42:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-10 01:42:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-10 01:42:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-10 01:42:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-10 01:42:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-10 01:42:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-01-10 01:42:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-01-10 01:42:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-01-10 01:42:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-01-10 01:42:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-01-10 01:42:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-01-10 01:42:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-01-10 01:42:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-01-10 01:42:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2025-01-10 01:42:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#23 [2025-01-10 01:42:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#24 [2025-01-10 01:42:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#25 [2025-01-10 01:42:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#26 [2025-01-10 01:42:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:42:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure request_region [2025-01-10 01:42:17,190 INFO L138 BoogieDeclarations]: Found implementation of procedure request_region [2025-01-10 01:42:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:42:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 01:42:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 01:42:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 01:42:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-10 01:42:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-10 01:42:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-10 01:42:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-10 01:42:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-10 01:42:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-10 01:42:17,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-10 01:42:17,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-01-10 01:42:17,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-01-10 01:42:17,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-01-10 01:42:17,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-01-10 01:42:17,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-01-10 01:42:17,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-01-10 01:42:17,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-01-10 01:42:17,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-01-10 01:42:17,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-01-10 01:42:17,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#19 [2025-01-10 01:42:17,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#20 [2025-01-10 01:42:17,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#21 [2025-01-10 01:42:17,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#22 [2025-01-10 01:42:17,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#23 [2025-01-10 01:42:17,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#24 [2025-01-10 01:42:17,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#25 [2025-01-10 01:42:17,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#26 [2025-01-10 01:42:17,193 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-01-10 01:42:17,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-01-10 01:42:17,193 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_irqsave [2025-01-10 01:42:17,193 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_irqsave [2025-01-10 01:42:17,193 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2025-01-10 01:42:17,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2025-01-10 01:42:17,193 INFO L130 BoogieDeclarations]: Found specification of procedure release_region [2025-01-10 01:42:17,193 INFO L138 BoogieDeclarations]: Found implementation of procedure release_region [2025-01-10 01:42:17,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:42:17,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:42:17,193 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_init [2025-01-10 01:42:17,193 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_init [2025-01-10 01:42:17,193 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-10 01:42:17,193 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-10 01:42:17,193 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2025-01-10 01:42:17,193 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2025-01-10 01:42:17,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 01:42:17,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 01:42:17,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 01:42:17,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-10 01:42:17,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-10 01:42:17,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-10 01:42:17,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-10 01:42:17,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-10 01:42:17,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-10 01:42:17,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-10 01:42:17,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-10 01:42:17,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-01-10 01:42:17,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-01-10 01:42:17,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-01-10 01:42:17,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-01-10 01:42:17,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-01-10 01:42:17,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-01-10 01:42:17,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-01-10 01:42:17,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-01-10 01:42:17,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-01-10 01:42:17,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#19 [2025-01-10 01:42:17,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#20 [2025-01-10 01:42:17,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#21 [2025-01-10 01:42:17,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#22 [2025-01-10 01:42:17,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#23 [2025-01-10 01:42:17,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#24 [2025-01-10 01:42:17,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#25 [2025-01-10 01:42:17,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#26 [2025-01-10 01:42:17,194 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2025-01-10 01:42:17,194 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2025-01-10 01:42:17,194 INFO L130 BoogieDeclarations]: Found specification of procedure cdev_add [2025-01-10 01:42:17,194 INFO L138 BoogieDeclarations]: Found implementation of procedure cdev_add [2025-01-10 01:42:17,194 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~$Pointer$~TO~int [2025-01-10 01:42:17,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~$Pointer$~TO~int [2025-01-10 01:42:17,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-10 01:42:17,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-10 01:42:17,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-10 01:42:17,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-10 01:42:17,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-01-10 01:42:17,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-01-10 01:42:17,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-01-10 01:42:17,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-01-10 01:42:17,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-01-10 01:42:17,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-01-10 01:42:17,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-01-10 01:42:17,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-01-10 01:42:17,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-01-10 01:42:17,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-01-10 01:42:17,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-01-10 01:42:17,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-01-10 01:42:17,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-01-10 01:42:17,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-01-10 01:42:17,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-01-10 01:42:17,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#19 [2025-01-10 01:42:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#20 [2025-01-10 01:42:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#21 [2025-01-10 01:42:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#22 [2025-01-10 01:42:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#23 [2025-01-10 01:42:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#24 [2025-01-10 01:42:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#25 [2025-01-10 01:42:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#26 [2025-01-10 01:42:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-01-10 01:42:17,198 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-01-10 01:42:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure outw [2025-01-10 01:42:17,198 INFO L138 BoogieDeclarations]: Found implementation of procedure outw [2025-01-10 01:42:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2025-01-10 01:42:17,198 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2025-01-10 01:42:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure misc_deregister [2025-01-10 01:42:17,198 INFO L138 BoogieDeclarations]: Found implementation of procedure misc_deregister [2025-01-10 01:42:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure assert_context_process [2025-01-10 01:42:17,198 INFO L138 BoogieDeclarations]: Found implementation of procedure assert_context_process [2025-01-10 01:42:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure zf_set_control [2025-01-10 01:42:17,198 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_set_control [2025-01-10 01:42:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:42:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:42:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 01:42:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 01:42:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-10 01:42:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-10 01:42:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-10 01:42:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-10 01:42:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-10 01:42:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-10 01:42:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-10 01:42:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-10 01:42:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-10 01:42:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-10 01:42:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-01-10 01:42:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-01-10 01:42:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-01-10 01:42:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-01-10 01:42:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-01-10 01:42:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-01-10 01:42:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-01-10 01:42:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-01-10 01:42:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2025-01-10 01:42:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#23 [2025-01-10 01:42:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#24 [2025-01-10 01:42:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#25 [2025-01-10 01:42:17,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#26 [2025-01-10 01:42:17,199 INFO L130 BoogieDeclarations]: Found specification of procedure zf_readw [2025-01-10 01:42:17,199 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_readw [2025-01-10 01:42:17,199 INFO L130 BoogieDeclarations]: Found specification of procedure zf_ping [2025-01-10 01:42:17,199 INFO L138 BoogieDeclarations]: Found implementation of procedure zf_ping [2025-01-10 01:42:17,199 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~int [2025-01-10 01:42:17,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~TO~int [2025-01-10 01:42:17,199 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2025-01-10 01:42:17,199 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2025-01-10 01:42:17,199 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-01-10 01:42:17,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2025-01-10 01:42:17,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:42:17,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:42:17,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 01:42:17,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 01:42:17,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-10 01:42:17,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-10 01:42:17,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-10 01:42:17,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-10 01:42:17,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-10 01:42:17,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-10 01:42:17,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-10 01:42:17,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-10 01:42:17,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-10 01:42:17,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-10 01:42:17,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-10 01:42:17,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-10 01:42:17,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-10 01:42:17,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-10 01:42:17,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-01-10 01:42:17,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-01-10 01:42:17,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-01-10 01:42:17,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-01-10 01:42:17,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2025-01-10 01:42:17,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#23 [2025-01-10 01:42:17,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#24 [2025-01-10 01:42:17,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#25 [2025-01-10 01:42:17,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#26 [2025-01-10 01:42:17,604 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:42:17,605 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:42:22,487 INFO L? ?]: Removed 457 outVars from TransFormulas that were not future-live. [2025-01-10 01:42:22,491 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:42:22,510 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:42:22,514 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-10 01:42:22,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:42:22 BoogieIcfgContainer [2025-01-10 01:42:22,514 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:42:22,515 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:42:22,515 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:42:22,519 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:42:22,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:42:15" (1/3) ... [2025-01-10 01:42:22,520 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5238031b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:42:22, skipping insertion in model container [2025-01-10 01:42:22,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:42:16" (2/3) ... [2025-01-10 01:42:22,520 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5238031b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:42:22, skipping insertion in model container [2025-01-10 01:42:22,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:42:22" (3/3) ... [2025-01-10 01:42:22,521 INFO L128 eAbstractionObserver]: Analyzing ICFG ddv_machzwd_inw.i [2025-01-10 01:42:22,533 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:42:22,537 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ddv_machzwd_inw.i that has 29 procedures, 430 locations, 1 initial locations, 4 loop locations, and 21 error locations. [2025-01-10 01:42:22,584 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:42:22,591 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;@221d6fd5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:42:22,591 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-01-10 01:42:22,594 INFO L276 IsEmpty]: Start isEmpty. Operand has 426 states, 300 states have (on average 1.41) internal successors, (423), 327 states have internal predecessors, (423), 78 states have call successors, (78), 26 states have call predecessors, (78), 26 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-01-10 01:42:22,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 01:42:22,598 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:22,598 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:22,598 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 01:42:22,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:22,602 INFO L85 PathProgramCache]: Analyzing trace with hash 113007048, now seen corresponding path program 1 times [2025-01-10 01:42:22,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:22,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539992922] [2025-01-10 01:42:22,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:22,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:24,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 01:42:25,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 01:42:25,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:25,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:25,800 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 01:42:25,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:25,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539992922] [2025-01-10 01:42:25,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539992922] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:42:25,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:42:25,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:42:25,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227391444] [2025-01-10 01:42:25,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:42:25,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:42:25,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:25,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:42:25,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:42:25,823 INFO L87 Difference]: Start difference. First operand has 426 states, 300 states have (on average 1.41) internal successors, (423), 327 states have internal predecessors, (423), 78 states have call successors, (78), 26 states have call predecessors, (78), 26 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 01:42:25,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:25,930 INFO L93 Difference]: Finished difference Result 846 states and 1175 transitions. [2025-01-10 01:42:25,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:42:25,932 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), 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 9 [2025-01-10 01:42:25,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:25,939 INFO L225 Difference]: With dead ends: 846 [2025-01-10 01:42:25,939 INFO L226 Difference]: Without dead ends: 416 [2025-01-10 01:42:25,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:42:25,948 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 1 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1691 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:25,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1691 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:25,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2025-01-10 01:42:26,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2025-01-10 01:42:26,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 295 states have (on average 1.3898305084745763) internal successors, (410), 320 states have internal predecessors, (410), 76 states have call successors, (76), 26 states have call predecessors, (76), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-01-10 01:42:26,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 561 transitions. [2025-01-10 01:42:26,019 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 561 transitions. Word has length 9 [2025-01-10 01:42:26,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:26,020 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 561 transitions. [2025-01-10 01:42:26,021 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), 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 01:42:26,021 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 561 transitions. [2025-01-10 01:42:26,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 01:42:26,021 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:26,022 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:26,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:42:26,022 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 01:42:26,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:26,023 INFO L85 PathProgramCache]: Analyzing trace with hash -660932470, now seen corresponding path program 1 times [2025-01-10 01:42:26,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:26,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208361757] [2025-01-10 01:42:26,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:26,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:28,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:42:28,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:42:28,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:28,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:28,745 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 01:42:28,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:28,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208361757] [2025-01-10 01:42:28,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208361757] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:42:28,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476058399] [2025-01-10 01:42:28,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:28,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:28,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:42:28,753 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 01:42:28,754 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 01:42:30,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:42:31,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:42:31,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:31,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:31,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 5617 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:42:31,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:42:31,380 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 01:42:31,380 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:42:31,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476058399] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:42:31,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:42:31,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 01:42:31,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923865443] [2025-01-10 01:42:31,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:42:31,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:42:31,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:31,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:42:31,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:42:31,381 INFO L87 Difference]: Start difference. First operand 416 states and 561 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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 01:42:31,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:31,450 INFO L93 Difference]: Finished difference Result 416 states and 561 transitions. [2025-01-10 01:42:31,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:42:31,450 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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 01:42:31,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:31,452 INFO L225 Difference]: With dead ends: 416 [2025-01-10 01:42:31,452 INFO L226 Difference]: Without dead ends: 415 [2025-01-10 01:42:31,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:42:31,453 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 1 mSDsluCounter, 2186 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2736 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:31,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2736 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:31,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-01-10 01:42:31,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2025-01-10 01:42:31,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 295 states have (on average 1.3864406779661016) internal successors, (409), 319 states have internal predecessors, (409), 76 states have call successors, (76), 26 states have call predecessors, (76), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-01-10 01:42:31,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 560 transitions. [2025-01-10 01:42:31,477 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 560 transitions. Word has length 12 [2025-01-10 01:42:31,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:31,478 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 560 transitions. [2025-01-10 01:42:31,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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 01:42:31,478 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 560 transitions. [2025-01-10 01:42:31,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-10 01:42:31,478 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:31,478 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:31,496 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 01:42:31,683 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 01:42:31,683 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 01:42:31,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:31,684 INFO L85 PathProgramCache]: Analyzing trace with hash 985936396, now seen corresponding path program 1 times [2025-01-10 01:42:31,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:31,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415716080] [2025-01-10 01:42:31,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:31,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:33,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:42:33,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:42:33,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:33,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:33,892 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 01:42:33,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:33,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415716080] [2025-01-10 01:42:33,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415716080] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:42:33,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10013420] [2025-01-10 01:42:33,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:33,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:33,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:42:33,897 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 01:42:33,898 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 01:42:35,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 01:42:36,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 01:42:36,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:36,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:36,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 5628 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:42:36,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:42:36,427 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 01:42:36,427 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:42:36,463 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 01:42:36,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10013420] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:42:36,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:42:36,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-10 01:42:36,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493687371] [2025-01-10 01:42:36,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:42:36,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:42:36,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:36,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:42:36,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:42:36,465 INFO L87 Difference]: Start difference. First operand 415 states and 560 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 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 01:42:36,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:36,545 INFO L93 Difference]: Finished difference Result 824 states and 1114 transitions. [2025-01-10 01:42:36,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:42:36,546 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 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 13 [2025-01-10 01:42:36,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:36,549 INFO L225 Difference]: With dead ends: 824 [2025-01-10 01:42:36,549 INFO L226 Difference]: Without dead ends: 419 [2025-01-10 01:42:36,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:42:36,554 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 0 mSDsluCounter, 3831 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4383 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:36,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4383 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:36,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2025-01-10 01:42:36,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2025-01-10 01:42:36,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 299 states have (on average 1.3812709030100334) internal successors, (413), 323 states have internal predecessors, (413), 76 states have call successors, (76), 26 states have call predecessors, (76), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-01-10 01:42:36,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 564 transitions. [2025-01-10 01:42:36,578 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 564 transitions. Word has length 13 [2025-01-10 01:42:36,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:36,580 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 564 transitions. [2025-01-10 01:42:36,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 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 01:42:36,580 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 564 transitions. [2025-01-10 01:42:36,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 01:42:36,580 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:36,581 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:36,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 01:42:36,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:36,782 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 01:42:36,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:36,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1429108664, now seen corresponding path program 1 times [2025-01-10 01:42:36,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:36,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165997613] [2025-01-10 01:42:36,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:36,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:38,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 01:42:38,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 01:42:38,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:38,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:38,774 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 01:42:38,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:38,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165997613] [2025-01-10 01:42:38,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165997613] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:42:38,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:42:38,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:42:38,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436525148] [2025-01-10 01:42:38,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:42:38,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:42:38,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:38,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:42:38,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:42:38,776 INFO L87 Difference]: Start difference. First operand 419 states and 564 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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 01:42:38,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:38,793 INFO L93 Difference]: Finished difference Result 419 states and 564 transitions. [2025-01-10 01:42:38,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:42:38,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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 16 [2025-01-10 01:42:38,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:38,796 INFO L225 Difference]: With dead ends: 419 [2025-01-10 01:42:38,796 INFO L226 Difference]: Without dead ends: 418 [2025-01-10 01:42:38,797 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 01:42:38,798 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 0 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:38,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1103 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:38,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-01-10 01:42:38,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2025-01-10 01:42:38,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 299 states have (on average 1.3779264214046822) internal successors, (412), 322 states have internal predecessors, (412), 76 states have call successors, (76), 26 states have call predecessors, (76), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-01-10 01:42:38,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 563 transitions. [2025-01-10 01:42:38,816 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 563 transitions. Word has length 16 [2025-01-10 01:42:38,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:38,816 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 563 transitions. [2025-01-10 01:42:38,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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 01:42:38,816 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 563 transitions. [2025-01-10 01:42:38,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-10 01:42:38,817 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:38,817 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:38,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 01:42:38,817 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 01:42:38,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:38,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1435058892, now seen corresponding path program 2 times [2025-01-10 01:42:38,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:38,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596548445] [2025-01-10 01:42:38,818 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:42:38,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:40,641 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-01-10 01:42:40,679 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 19 statements. [2025-01-10 01:42:40,679 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:42:40,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:40,946 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:42:40,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:40,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596548445] [2025-01-10 01:42:40,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596548445] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:42:40,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:42:40,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:42:40,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917975986] [2025-01-10 01:42:40,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:42:40,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:42:40,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:40,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:42:40,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:42:40,948 INFO L87 Difference]: Start difference. First operand 418 states and 563 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 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 01:42:40,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:40,975 INFO L93 Difference]: Finished difference Result 422 states and 567 transitions. [2025-01-10 01:42:40,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:42:40,976 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 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 19 [2025-01-10 01:42:40,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:40,978 INFO L225 Difference]: With dead ends: 422 [2025-01-10 01:42:40,978 INFO L226 Difference]: Without dead ends: 420 [2025-01-10 01:42:40,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:42:40,980 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 1 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1643 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:40,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1643 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:40,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-01-10 01:42:40,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2025-01-10 01:42:40,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 301 states have (on average 1.3754152823920265) internal successors, (414), 324 states have internal predecessors, (414), 76 states have call successors, (76), 26 states have call predecessors, (76), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-01-10 01:42:40,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 565 transitions. [2025-01-10 01:42:40,995 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 565 transitions. Word has length 19 [2025-01-10 01:42:40,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:40,995 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 565 transitions. [2025-01-10 01:42:40,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 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 01:42:40,995 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 565 transitions. [2025-01-10 01:42:40,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-10 01:42:40,996 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:40,996 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:40,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:42:40,996 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 01:42:40,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:40,996 INFO L85 PathProgramCache]: Analyzing trace with hash -264542256, now seen corresponding path program 1 times [2025-01-10 01:42:40,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:40,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156567504] [2025-01-10 01:42:40,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:40,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:42,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:42:42,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:42:42,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:42,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:43,327 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:42:43,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:43,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156567504] [2025-01-10 01:42:43,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156567504] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:42:43,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016114992] [2025-01-10 01:42:43,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:43,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:43,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:42:43,330 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 01:42:43,334 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 01:42:45,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 01:42:45,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 01:42:45,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:45,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:45,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 5693 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:42:45,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:42:46,005 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:42:46,005 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:42:46,093 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 01:42:46,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016114992] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:42:46,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:42:46,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-01-10 01:42:46,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460517712] [2025-01-10 01:42:46,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:42:46,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 01:42:46,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:46,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 01:42:46,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2025-01-10 01:42:46,094 INFO L87 Difference]: Start difference. First operand 420 states and 565 transitions. Second operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 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 01:42:46,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:46,205 INFO L93 Difference]: Finished difference Result 834 states and 1126 transitions. [2025-01-10 01:42:46,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-10 01:42:46,205 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 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 01:42:46,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:46,208 INFO L225 Difference]: With dead ends: 834 [2025-01-10 01:42:46,208 INFO L226 Difference]: Without dead ends: 428 [2025-01-10 01:42:46,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2025-01-10 01:42:46,213 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 0 mSDsluCounter, 3802 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4348 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:46,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4348 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:46,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-01-10 01:42:46,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2025-01-10 01:42:46,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 311 states have (on average 1.3536977491961415) internal successors, (421), 332 states have internal predecessors, (421), 76 states have call successors, (76), 26 states have call predecessors, (76), 26 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-01-10 01:42:46,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 572 transitions. [2025-01-10 01:42:46,231 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 572 transitions. Word has length 22 [2025-01-10 01:42:46,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:46,231 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 572 transitions. [2025-01-10 01:42:46,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 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 01:42:46,232 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 572 transitions. [2025-01-10 01:42:46,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-10 01:42:46,232 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:46,233 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 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 01:42:46,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 01:42:46,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:46,437 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 01:42:46,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:46,438 INFO L85 PathProgramCache]: Analyzing trace with hash -2025275620, now seen corresponding path program 1 times [2025-01-10 01:42:46,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:46,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256455239] [2025-01-10 01:42:46,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:46,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:48,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-10 01:42:48,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-10 01:42:48,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:48,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:49,084 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-01-10 01:42:49,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:49,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256455239] [2025-01-10 01:42:49,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256455239] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:42:49,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:42:49,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:42:49,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800077356] [2025-01-10 01:42:49,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:42:49,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:42:49,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:49,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:42:49,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:42:49,085 INFO L87 Difference]: Start difference. First operand 428 states and 572 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 01:42:49,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:49,123 INFO L93 Difference]: Finished difference Result 750 states and 1012 transitions. [2025-01-10 01:42:49,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:42:49,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2025-01-10 01:42:49,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:49,126 INFO L225 Difference]: With dead ends: 750 [2025-01-10 01:42:49,126 INFO L226 Difference]: Without dead ends: 746 [2025-01-10 01:42:49,127 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 01:42:49,127 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 499 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:49,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 1045 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:49,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2025-01-10 01:42:49,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 740. [2025-01-10 01:42:49,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 543 states have (on average 1.3627992633517496) internal successors, (740), 568 states have internal predecessors, (740), 134 states have call successors, (134), 48 states have call predecessors, (134), 48 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2025-01-10 01:42:49,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1007 transitions. [2025-01-10 01:42:49,153 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1007 transitions. Word has length 49 [2025-01-10 01:42:49,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:49,153 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 1007 transitions. [2025-01-10 01:42:49,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-10 01:42:49,153 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1007 transitions. [2025-01-10 01:42:49,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-10 01:42:49,155 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:49,155 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:42:49,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:42:49,156 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 01:42:49,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:49,156 INFO L85 PathProgramCache]: Analyzing trace with hash 509703695, now seen corresponding path program 1 times [2025-01-10 01:42:49,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:49,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168455836] [2025-01-10 01:42:49,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:49,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:50,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-10 01:42:50,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-10 01:42:50,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:50,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:51,192 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-01-10 01:42:51,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:51,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168455836] [2025-01-10 01:42:51,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168455836] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:42:51,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:42:51,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:42:51,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23828603] [2025-01-10 01:42:51,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:42:51,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:42:51,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:51,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:42:51,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:42:51,196 INFO L87 Difference]: Start difference. First operand 740 states and 1007 transitions. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 01:42:51,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:51,223 INFO L93 Difference]: Finished difference Result 1437 states and 1963 transitions. [2025-01-10 01:42:51,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:42:51,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 58 [2025-01-10 01:42:51,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:51,228 INFO L225 Difference]: With dead ends: 1437 [2025-01-10 01:42:51,228 INFO L226 Difference]: Without dead ends: 738 [2025-01-10 01:42:51,230 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 01:42:51,230 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 530 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:51,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 545 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:51,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2025-01-10 01:42:51,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2025-01-10 01:42:51,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 542 states have (on average 1.3579335793357934) internal successors, (736), 566 states have internal predecessors, (736), 134 states have call successors, (134), 48 states have call predecessors, (134), 48 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2025-01-10 01:42:51,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1003 transitions. [2025-01-10 01:42:51,254 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1003 transitions. Word has length 58 [2025-01-10 01:42:51,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:51,255 INFO L471 AbstractCegarLoop]: Abstraction has 738 states and 1003 transitions. [2025-01-10 01:42:51,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 01:42:51,255 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1003 transitions. [2025-01-10 01:42:51,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-10 01:42:51,258 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:51,258 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:51,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:42:51,259 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 01:42:51,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:51,259 INFO L85 PathProgramCache]: Analyzing trace with hash -200390661, now seen corresponding path program 1 times [2025-01-10 01:42:51,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:51,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608056135] [2025-01-10 01:42:51,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:51,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:53,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-10 01:42:53,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-10 01:42:53,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:53,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:53,480 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2025-01-10 01:42:53,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:53,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608056135] [2025-01-10 01:42:53,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608056135] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:42:53,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:42:53,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:42:53,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777443054] [2025-01-10 01:42:53,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:42:53,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:42:53,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:53,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:42:53,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:42:53,481 INFO L87 Difference]: Start difference. First operand 738 states and 1003 transitions. Second operand has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-10 01:42:53,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:53,523 INFO L93 Difference]: Finished difference Result 1714 states and 2347 transitions. [2025-01-10 01:42:53,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:42:53,524 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 78 [2025-01-10 01:42:53,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:53,529 INFO L225 Difference]: With dead ends: 1714 [2025-01-10 01:42:53,529 INFO L226 Difference]: Without dead ends: 1048 [2025-01-10 01:42:53,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 01:42:53,531 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 444 mSDsluCounter, 1072 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 1644 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:53,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 1644 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:53,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2025-01-10 01:42:53,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 1042. [2025-01-10 01:42:53,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 770 states have (on average 1.361038961038961) internal successors, (1048), 797 states have internal predecessors, (1048), 191 states have call successors, (191), 69 states have call predecessors, (191), 69 states have return successors, (190), 190 states have call predecessors, (190), 190 states have call successors, (190) [2025-01-10 01:42:53,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1429 transitions. [2025-01-10 01:42:53,562 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1429 transitions. Word has length 78 [2025-01-10 01:42:53,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:53,563 INFO L471 AbstractCegarLoop]: Abstraction has 1042 states and 1429 transitions. [2025-01-10 01:42:53,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-10 01:42:53,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1429 transitions. [2025-01-10 01:42:53,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-10 01:42:53,564 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:53,564 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:53,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:42:53,564 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting zf_pingErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 01:42:53,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:53,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1223371879, now seen corresponding path program 1 times [2025-01-10 01:42:53,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:53,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570117822] [2025-01-10 01:42:53,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:53,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:42:55,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-10 01:42:55,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-10 01:42:55,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:55,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:56,215 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-10 01:42:56,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:42:56,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570117822] [2025-01-10 01:42:56,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570117822] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:42:56,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206703610] [2025-01-10 01:42:56,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:42:56,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:42:56,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:42:56,218 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 01:42:56,219 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 01:42:58,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-10 01:42:58,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-10 01:42:58,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:42:58,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:42:59,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 5941 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:42:59,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:42:59,079 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-10 01:42:59,079 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:42:59,287 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-10 01:42:59,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206703610] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:42:59,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:42:59,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-01-10 01:42:59,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780065310] [2025-01-10 01:42:59,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:42:59,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-10 01:42:59,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:42:59,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-10 01:42:59,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-01-10 01:42:59,288 INFO L87 Difference]: Start difference. First operand 1042 states and 1429 transitions. Second operand has 23 states, 23 states have (on average 3.9565217391304346) internal successors, (91), 23 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-10 01:42:59,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:42:59,376 INFO L93 Difference]: Finished difference Result 2067 states and 2842 transitions. [2025-01-10 01:42:59,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-10 01:42:59,377 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.9565217391304346) internal successors, (91), 23 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 87 [2025-01-10 01:42:59,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:42:59,381 INFO L225 Difference]: With dead ends: 2067 [2025-01-10 01:42:59,381 INFO L226 Difference]: Without dead ends: 1051 [2025-01-10 01:42:59,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 157 SyntacticMatches, 11 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-01-10 01:42:59,384 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 0 mSDsluCounter, 3776 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4318 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:42:59,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4318 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:42:59,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2025-01-10 01:42:59,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1051. [2025-01-10 01:42:59,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1051 states, 779 states have (on average 1.3568677792041077) internal successors, (1057), 806 states have internal predecessors, (1057), 191 states have call successors, (191), 69 states have call predecessors, (191), 69 states have return successors, (190), 190 states have call predecessors, (190), 190 states have call successors, (190) [2025-01-10 01:42:59,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1438 transitions. [2025-01-10 01:42:59,415 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1438 transitions. Word has length 87 [2025-01-10 01:42:59,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:42:59,416 INFO L471 AbstractCegarLoop]: Abstraction has 1051 states and 1438 transitions. [2025-01-10 01:42:59,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.9565217391304346) internal successors, (91), 23 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-10 01:42:59,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1438 transitions. [2025-01-10 01:42:59,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-10 01:42:59,418 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:42:59,418 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:42:59,433 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 01:42:59,618 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 01:42:59,619 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting zf_pingErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 01:42:59,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:42:59,619 INFO L85 PathProgramCache]: Analyzing trace with hash 39511785, now seen corresponding path program 2 times [2025-01-10 01:42:59,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:42:59,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003305955] [2025-01-10 01:42:59,620 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:42:59,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:01,354 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 96 statements into 2 equivalence classes. [2025-01-10 01:43:01,391 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 37 of 96 statements. [2025-01-10 01:43:01,392 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:43:01,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:01,597 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2025-01-10 01:43:01,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:01,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003305955] [2025-01-10 01:43:01,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003305955] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:43:01,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:43:01,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:43:01,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159543532] [2025-01-10 01:43:01,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:43:01,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:43:01,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:01,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:43:01,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:43:01,598 INFO L87 Difference]: Start difference. First operand 1051 states and 1438 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-10 01:43:01,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:01,629 INFO L93 Difference]: Finished difference Result 1076 states and 1456 transitions. [2025-01-10 01:43:01,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:43:01,630 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 96 [2025-01-10 01:43:01,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:01,633 INFO L225 Difference]: With dead ends: 1076 [2025-01-10 01:43:01,633 INFO L226 Difference]: Without dead ends: 762 [2025-01-10 01:43:01,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 01:43:01,635 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 0 mSDsluCounter, 1625 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2169 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:43:01,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2169 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:43:01,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2025-01-10 01:43:01,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 762. [2025-01-10 01:43:01,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 762 states, 565 states have (on average 1.3380530973451328) internal successors, (756), 587 states have internal predecessors, (756), 134 states have call successors, (134), 51 states have call predecessors, (134), 51 states have return successors, (133), 133 states have call predecessors, (133), 133 states have call successors, (133) [2025-01-10 01:43:01,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1023 transitions. [2025-01-10 01:43:01,659 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 1023 transitions. Word has length 96 [2025-01-10 01:43:01,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:01,659 INFO L471 AbstractCegarLoop]: Abstraction has 762 states and 1023 transitions. [2025-01-10 01:43:01,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-10 01:43:01,659 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1023 transitions. [2025-01-10 01:43:01,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-10 01:43:01,660 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:01,660 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:43:01,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 01:43:01,660 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 01:43:01,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:01,660 INFO L85 PathProgramCache]: Analyzing trace with hash 529587118, now seen corresponding path program 1 times [2025-01-10 01:43:01,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:01,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990876556] [2025-01-10 01:43:01,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:01,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:03,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-10 01:43:03,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-10 01:43:03,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:03,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:04,406 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2025-01-10 01:43:04,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:04,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990876556] [2025-01-10 01:43:04,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990876556] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:43:04,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:43:04,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:43:04,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078796729] [2025-01-10 01:43:04,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:43:04,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:43:04,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:04,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:43:04,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:43:04,409 INFO L87 Difference]: Start difference. First operand 762 states and 1023 transitions. Second operand has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-10 01:43:04,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:04,489 INFO L93 Difference]: Finished difference Result 1732 states and 2311 transitions. [2025-01-10 01:43:04,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:43:04,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 100 [2025-01-10 01:43:04,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:04,501 INFO L225 Difference]: With dead ends: 1732 [2025-01-10 01:43:04,501 INFO L226 Difference]: Without dead ends: 1056 [2025-01-10 01:43:04,503 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 01:43:04,509 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 235 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 1677 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:43:04,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 1677 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:43:04,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2025-01-10 01:43:04,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 1050. [2025-01-10 01:43:04,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1050 states, 767 states have (on average 1.303780964797914) internal successors, (1000), 790 states have internal predecessors, (1000), 190 states have call successors, (190), 83 states have call predecessors, (190), 83 states have return successors, (188), 188 states have call predecessors, (188), 187 states have call successors, (188) [2025-01-10 01:43:04,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1378 transitions. [2025-01-10 01:43:04,572 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1378 transitions. Word has length 100 [2025-01-10 01:43:04,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:04,572 INFO L471 AbstractCegarLoop]: Abstraction has 1050 states and 1378 transitions. [2025-01-10 01:43:04,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-10 01:43:04,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1378 transitions. [2025-01-10 01:43:04,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-10 01:43:04,574 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:04,574 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:43:04,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 01:43:04,574 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 01:43:04,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:04,574 INFO L85 PathProgramCache]: Analyzing trace with hash -495702767, now seen corresponding path program 1 times [2025-01-10 01:43:04,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:04,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437846910] [2025-01-10 01:43:04,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:04,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:06,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-10 01:43:06,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-10 01:43:06,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:06,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:07,278 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2025-01-10 01:43:07,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:07,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437846910] [2025-01-10 01:43:07,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437846910] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:43:07,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:43:07,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:43:07,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528523876] [2025-01-10 01:43:07,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:43:07,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:43:07,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:07,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:43:07,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:43:07,280 INFO L87 Difference]: Start difference. First operand 1050 states and 1378 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-10 01:43:09,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 01:43:10,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:10,079 INFO L93 Difference]: Finished difference Result 2016 states and 2665 transitions. [2025-01-10 01:43:10,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:43:10,080 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 135 [2025-01-10 01:43:10,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:10,088 INFO L225 Difference]: With dead ends: 2016 [2025-01-10 01:43:10,088 INFO L226 Difference]: Without dead ends: 1050 [2025-01-10 01:43:10,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:43:10,091 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 511 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 1438 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-10 01:43:10,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 1438 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-10 01:43:10,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050 states. [2025-01-10 01:43:10,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 1050. [2025-01-10 01:43:10,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1050 states, 767 states have (on average 1.3011734028683182) internal successors, (998), 790 states have internal predecessors, (998), 190 states have call successors, (190), 83 states have call predecessors, (190), 83 states have return successors, (188), 188 states have call predecessors, (188), 187 states have call successors, (188) [2025-01-10 01:43:10,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1376 transitions. [2025-01-10 01:43:10,146 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1376 transitions. Word has length 135 [2025-01-10 01:43:10,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:10,151 INFO L471 AbstractCegarLoop]: Abstraction has 1050 states and 1376 transitions. [2025-01-10 01:43:10,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-10 01:43:10,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1376 transitions. [2025-01-10 01:43:10,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-10 01:43:10,152 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:10,152 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:43:10,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 01:43:10,152 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 01:43:10,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:10,153 INFO L85 PathProgramCache]: Analyzing trace with hash 789023380, now seen corresponding path program 1 times [2025-01-10 01:43:10,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:10,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183536622] [2025-01-10 01:43:10,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:10,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:12,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-10 01:43:12,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-10 01:43:12,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:12,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:12,588 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2025-01-10 01:43:12,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:12,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183536622] [2025-01-10 01:43:12,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183536622] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:43:12,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:43:12,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:43:12,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826460528] [2025-01-10 01:43:12,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:43:12,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:43:12,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:12,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:43:12,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:43:12,589 INFO L87 Difference]: Start difference. First operand 1050 states and 1376 transitions. Second operand has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-10 01:43:12,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:12,651 INFO L93 Difference]: Finished difference Result 1940 states and 2562 transitions. [2025-01-10 01:43:12,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:43:12,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 137 [2025-01-10 01:43:12,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:12,661 INFO L225 Difference]: With dead ends: 1940 [2025-01-10 01:43:12,661 INFO L226 Difference]: Without dead ends: 1492 [2025-01-10 01:43:12,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 01:43:12,664 INFO L435 NwaCegarLoop]: 530 mSDtfsCounter, 484 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 1491 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:43:12,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 1491 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:43:12,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1492 states. [2025-01-10 01:43:12,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1492 to 1484. [2025-01-10 01:43:12,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1484 states, 1085 states have (on average 1.3096774193548386) internal successors, (1421), 1114 states have internal predecessors, (1421), 273 states have call successors, (273), 119 states have call predecessors, (273), 118 states have return successors, (268), 268 states have call predecessors, (268), 267 states have call successors, (268) [2025-01-10 01:43:12,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1484 states to 1484 states and 1962 transitions. [2025-01-10 01:43:12,727 INFO L78 Accepts]: Start accepts. Automaton has 1484 states and 1962 transitions. Word has length 137 [2025-01-10 01:43:12,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:12,727 INFO L471 AbstractCegarLoop]: Abstraction has 1484 states and 1962 transitions. [2025-01-10 01:43:12,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-10 01:43:12,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 1962 transitions. [2025-01-10 01:43:12,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-01-10 01:43:12,731 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:12,731 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:43:12,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 01:43:12,731 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting zf_pingErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 01:43:12,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:12,732 INFO L85 PathProgramCache]: Analyzing trace with hash 854427795, now seen corresponding path program 1 times [2025-01-10 01:43:12,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:12,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922997526] [2025-01-10 01:43:12,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:12,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:14,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-10 01:43:14,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-10 01:43:14,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:14,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:15,304 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2025-01-10 01:43:15,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:15,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922997526] [2025-01-10 01:43:15,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922997526] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:43:15,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:43:15,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:43:15,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029352616] [2025-01-10 01:43:15,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:43:15,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:43:15,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:15,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:43:15,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:43:15,306 INFO L87 Difference]: Start difference. First operand 1484 states and 1962 transitions. Second operand has 3 states, 2 states have (on average 34.0) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-10 01:43:15,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:15,395 INFO L93 Difference]: Finished difference Result 3852 states and 5211 transitions. [2025-01-10 01:43:15,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:43:15,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 34.0) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 138 [2025-01-10 01:43:15,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:15,410 INFO L225 Difference]: With dead ends: 3852 [2025-01-10 01:43:15,410 INFO L226 Difference]: Without dead ends: 2472 [2025-01-10 01:43:15,415 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 01:43:15,416 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 425 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 982 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 01:43:15,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 982 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:43:15,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2472 states. [2025-01-10 01:43:15,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2472 to 2321. [2025-01-10 01:43:15,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2321 states, 1712 states have (on average 1.338785046728972) internal successors, (2292), 1754 states have internal predecessors, (2292), 420 states have call successors, (420), 187 states have call predecessors, (420), 181 states have return successors, (421), 405 states have call predecessors, (421), 408 states have call successors, (421) [2025-01-10 01:43:15,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2321 states and 3133 transitions. [2025-01-10 01:43:15,564 INFO L78 Accepts]: Start accepts. Automaton has 2321 states and 3133 transitions. Word has length 138 [2025-01-10 01:43:15,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:15,565 INFO L471 AbstractCegarLoop]: Abstraction has 2321 states and 3133 transitions. [2025-01-10 01:43:15,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 34.0) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-10 01:43:15,565 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 3133 transitions. [2025-01-10 01:43:15,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-10 01:43:15,569 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:15,570 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:43:15,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 01:43:15,570 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 01:43:15,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:15,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1283893614, now seen corresponding path program 1 times [2025-01-10 01:43:15,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:15,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260762741] [2025-01-10 01:43:15,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:15,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:17,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-10 01:43:17,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-10 01:43:17,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:17,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:17,845 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2025-01-10 01:43:17,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:17,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260762741] [2025-01-10 01:43:17,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260762741] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:43:17,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:43:17,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:43:17,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830380230] [2025-01-10 01:43:17,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:43:17,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:43:17,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:17,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:43:17,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:43:17,847 INFO L87 Difference]: Start difference. First operand 2321 states and 3133 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-10 01:43:17,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:17,888 INFO L93 Difference]: Finished difference Result 2476 states and 3308 transitions. [2025-01-10 01:43:17,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:43:17,889 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 155 [2025-01-10 01:43:17,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:17,896 INFO L225 Difference]: With dead ends: 2476 [2025-01-10 01:43:17,896 INFO L226 Difference]: Without dead ends: 1663 [2025-01-10 01:43:17,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:43:17,899 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 0 mSDsluCounter, 1053 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1582 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:43:17,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1582 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:43:17,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2025-01-10 01:43:17,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 1663. [2025-01-10 01:43:17,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1663 states, 1224 states have (on average 1.3218954248366013) internal successors, (1618), 1254 states have internal predecessors, (1618), 296 states have call successors, (296), 138 states have call predecessors, (296), 135 states have return successors, (298), 288 states have call predecessors, (298), 289 states have call successors, (298) [2025-01-10 01:43:17,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1663 states and 2212 transitions. [2025-01-10 01:43:17,959 INFO L78 Accepts]: Start accepts. Automaton has 1663 states and 2212 transitions. Word has length 155 [2025-01-10 01:43:17,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:17,961 INFO L471 AbstractCegarLoop]: Abstraction has 1663 states and 2212 transitions. [2025-01-10 01:43:17,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-10 01:43:17,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 2212 transitions. [2025-01-10 01:43:17,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-10 01:43:17,962 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:17,962 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:43:17,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 01:43:17,962 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ##fun~$Pointer$~X~$Pointer$~TO~intErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 01:43:17,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:17,963 INFO L85 PathProgramCache]: Analyzing trace with hash 646277011, now seen corresponding path program 1 times [2025-01-10 01:43:17,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:17,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094564816] [2025-01-10 01:43:17,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:17,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:19,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-10 01:43:19,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-10 01:43:19,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:19,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:19,940 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-01-10 01:43:19,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:19,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094564816] [2025-01-10 01:43:19,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094564816] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:43:19,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:43:19,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:43:19,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471213995] [2025-01-10 01:43:19,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:43:19,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:43:19,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:19,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:43:19,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:43:19,942 INFO L87 Difference]: Start difference. First operand 1663 states and 2212 transitions. Second operand has 3 states, 2 states have (on average 46.0) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-10 01:43:19,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:19,981 INFO L93 Difference]: Finished difference Result 1673 states and 2228 transitions. [2025-01-10 01:43:19,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:43:19,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 46.0) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 155 [2025-01-10 01:43:19,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:19,998 INFO L225 Difference]: With dead ends: 1673 [2025-01-10 01:43:19,999 INFO L226 Difference]: Without dead ends: 1671 [2025-01-10 01:43:19,999 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 01:43:20,000 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 1 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1050 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 01:43:20,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1050 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:43:20,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2025-01-10 01:43:20,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1671. [2025-01-10 01:43:20,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1232 states have (on average 1.3198051948051948) internal successors, (1626), 1262 states have internal predecessors, (1626), 296 states have call successors, (296), 138 states have call predecessors, (296), 135 states have return successors, (298), 288 states have call predecessors, (298), 289 states have call successors, (298) [2025-01-10 01:43:20,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2220 transitions. [2025-01-10 01:43:20,117 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2220 transitions. Word has length 155 [2025-01-10 01:43:20,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:20,117 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 2220 transitions. [2025-01-10 01:43:20,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 46.0) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-10 01:43:20,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2220 transitions. [2025-01-10 01:43:20,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-10 01:43:20,119 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:20,119 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:43:20,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 01:43:20,119 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ##fun~$Pointer$~X~$Pointer$~TO~intErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 01:43:20,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:20,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1440246971, now seen corresponding path program 1 times [2025-01-10 01:43:20,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:20,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753879284] [2025-01-10 01:43:20,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:20,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:21,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-10 01:43:22,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-10 01:43:22,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:22,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:22,235 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-01-10 01:43:22,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:22,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753879284] [2025-01-10 01:43:22,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753879284] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:43:22,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:43:22,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:43:22,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433499089] [2025-01-10 01:43:22,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:43:22,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:43:22,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:22,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:43:22,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:43:22,236 INFO L87 Difference]: Start difference. First operand 1671 states and 2220 transitions. Second operand has 3 states, 2 states have (on average 46.5) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-10 01:43:22,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:22,275 INFO L93 Difference]: Finished difference Result 1671 states and 2220 transitions. [2025-01-10 01:43:22,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:43:22,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 46.5) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 156 [2025-01-10 01:43:22,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:22,284 INFO L225 Difference]: With dead ends: 1671 [2025-01-10 01:43:22,285 INFO L226 Difference]: Without dead ends: 1670 [2025-01-10 01:43:22,285 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 01:43:22,286 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 1 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1050 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 01:43:22,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1050 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:43:22,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2025-01-10 01:43:22,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1670. [2025-01-10 01:43:22,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1670 states, 1232 states have (on average 1.3165584415584415) internal successors, (1622), 1261 states have internal predecessors, (1622), 296 states have call successors, (296), 138 states have call predecessors, (296), 135 states have return successors, (298), 288 states have call predecessors, (298), 289 states have call successors, (298) [2025-01-10 01:43:22,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 2216 transitions. [2025-01-10 01:43:22,346 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 2216 transitions. Word has length 156 [2025-01-10 01:43:22,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:22,346 INFO L471 AbstractCegarLoop]: Abstraction has 1670 states and 2216 transitions. [2025-01-10 01:43:22,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 46.5) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-10 01:43:22,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 2216 transitions. [2025-01-10 01:43:22,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-01-10 01:43:22,348 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:22,348 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:43:22,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 01:43:22,348 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ##fun~$Pointer$~X~$Pointer$~TO~intErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 01:43:22,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:22,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1697982800, now seen corresponding path program 1 times [2025-01-10 01:43:22,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:22,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960035371] [2025-01-10 01:43:22,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:22,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:24,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-10 01:43:24,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-10 01:43:24,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:24,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:24,595 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-01-10 01:43:24,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:24,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960035371] [2025-01-10 01:43:24,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960035371] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:43:24,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:43:24,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:43:24,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276988851] [2025-01-10 01:43:24,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:43:24,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:43:24,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:24,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:43:24,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:43:24,597 INFO L87 Difference]: Start difference. First operand 1670 states and 2216 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-10 01:43:24,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:24,632 INFO L93 Difference]: Finished difference Result 3139 states and 4227 transitions. [2025-01-10 01:43:24,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:43:24,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 157 [2025-01-10 01:43:24,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:24,638 INFO L225 Difference]: With dead ends: 3139 [2025-01-10 01:43:24,638 INFO L226 Difference]: Without dead ends: 1657 [2025-01-10 01:43:24,641 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 01:43:24,641 INFO L435 NwaCegarLoop]: 524 mSDtfsCounter, 2 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:43:24,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1044 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:43:24,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2025-01-10 01:43:24,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1657. [2025-01-10 01:43:24,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1657 states, 1220 states have (on average 1.3131147540983608) internal successors, (1602), 1248 states have internal predecessors, (1602), 296 states have call successors, (296), 138 states have call predecessors, (296), 135 states have return successors, (298), 288 states have call predecessors, (298), 289 states have call successors, (298) [2025-01-10 01:43:24,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 2196 transitions. [2025-01-10 01:43:24,698 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 2196 transitions. Word has length 157 [2025-01-10 01:43:24,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:24,699 INFO L471 AbstractCegarLoop]: Abstraction has 1657 states and 2196 transitions. [2025-01-10 01:43:24,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-01-10 01:43:24,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2196 transitions. [2025-01-10 01:43:24,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-10 01:43:24,701 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:24,701 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:43:24,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 01:43:24,701 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ##fun~$Pointer$~X~$Pointer$~TO~intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 01:43:24,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:24,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1714017538, now seen corresponding path program 1 times [2025-01-10 01:43:24,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:24,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030193836] [2025-01-10 01:43:24,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:24,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:26,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-10 01:43:26,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-10 01:43:26,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:26,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:26,648 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2025-01-10 01:43:26,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:26,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030193836] [2025-01-10 01:43:26,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030193836] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:43:26,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:43:26,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:43:26,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445439045] [2025-01-10 01:43:26,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:43:26,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:43:26,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:26,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:43:26,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:43:26,649 INFO L87 Difference]: Start difference. First operand 1657 states and 2196 transitions. Second operand has 3 states, 2 states have (on average 47.5) internal successors, (95), 3 states have internal predecessors, (95), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-10 01:43:26,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:26,684 INFO L93 Difference]: Finished difference Result 1667 states and 2212 transitions. [2025-01-10 01:43:26,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:43:26,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 47.5) internal successors, (95), 3 states have internal predecessors, (95), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 164 [2025-01-10 01:43:26,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:26,690 INFO L225 Difference]: With dead ends: 1667 [2025-01-10 01:43:26,690 INFO L226 Difference]: Without dead ends: 1665 [2025-01-10 01:43:26,691 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 01:43:26,691 INFO L435 NwaCegarLoop]: 524 mSDtfsCounter, 1 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1042 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 01:43:26,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1042 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:43:26,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2025-01-10 01:43:26,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1665. [2025-01-10 01:43:26,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1665 states, 1228 states have (on average 1.3110749185667752) internal successors, (1610), 1256 states have internal predecessors, (1610), 296 states have call successors, (296), 138 states have call predecessors, (296), 135 states have return successors, (298), 288 states have call predecessors, (298), 289 states have call successors, (298) [2025-01-10 01:43:26,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 2204 transitions. [2025-01-10 01:43:26,735 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 2204 transitions. Word has length 164 [2025-01-10 01:43:26,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:26,735 INFO L471 AbstractCegarLoop]: Abstraction has 1665 states and 2204 transitions. [2025-01-10 01:43:26,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 47.5) internal successors, (95), 3 states have internal predecessors, (95), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-10 01:43:26,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2204 transitions. [2025-01-10 01:43:26,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-10 01:43:26,738 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:26,738 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:43:26,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 01:43:26,738 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ##fun~$Pointer$~X~$Pointer$~TO~intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 01:43:26,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:26,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1516182711, now seen corresponding path program 1 times [2025-01-10 01:43:26,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:26,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925793712] [2025-01-10 01:43:26,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:26,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:28,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-10 01:43:28,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-10 01:43:28,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:28,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:28,662 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2025-01-10 01:43:28,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:28,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925793712] [2025-01-10 01:43:28,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925793712] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:43:28,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:43:28,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:43:28,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253678920] [2025-01-10 01:43:28,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:43:28,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:43:28,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:28,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:43:28,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:43:28,664 INFO L87 Difference]: Start difference. First operand 1665 states and 2204 transitions. Second operand has 3 states, 2 states have (on average 49.0) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-10 01:43:28,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:28,699 INFO L93 Difference]: Finished difference Result 1665 states and 2204 transitions. [2025-01-10 01:43:28,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:43:28,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 49.0) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 167 [2025-01-10 01:43:28,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:28,705 INFO L225 Difference]: With dead ends: 1665 [2025-01-10 01:43:28,705 INFO L226 Difference]: Without dead ends: 1664 [2025-01-10 01:43:28,705 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 01:43:28,706 INFO L435 NwaCegarLoop]: 524 mSDtfsCounter, 1 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1042 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 01:43:28,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1042 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:43:28,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1664 states. [2025-01-10 01:43:28,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1664 to 1664. [2025-01-10 01:43:28,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1664 states, 1228 states have (on average 1.3078175895765471) internal successors, (1606), 1255 states have internal predecessors, (1606), 296 states have call successors, (296), 138 states have call predecessors, (296), 135 states have return successors, (298), 288 states have call predecessors, (298), 289 states have call successors, (298) [2025-01-10 01:43:28,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1664 states and 2200 transitions. [2025-01-10 01:43:28,752 INFO L78 Accepts]: Start accepts. Automaton has 1664 states and 2200 transitions. Word has length 167 [2025-01-10 01:43:28,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:28,752 INFO L471 AbstractCegarLoop]: Abstraction has 1664 states and 2200 transitions. [2025-01-10 01:43:28,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 49.0) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-10 01:43:28,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 2200 transitions. [2025-01-10 01:43:28,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-10 01:43:28,754 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:28,754 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:43:28,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 01:43:28,755 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting zf_pingErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 01:43:28,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:28,755 INFO L85 PathProgramCache]: Analyzing trace with hash -127484119, now seen corresponding path program 1 times [2025-01-10 01:43:28,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:28,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400675713] [2025-01-10 01:43:28,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:28,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:30,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-10 01:43:30,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-10 01:43:30,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:30,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:30,641 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-01-10 01:43:30,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:30,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400675713] [2025-01-10 01:43:30,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400675713] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:43:30,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:43:30,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:43:30,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061030324] [2025-01-10 01:43:30,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:43:30,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:43:30,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:30,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:43:30,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:43:30,642 INFO L87 Difference]: Start difference. First operand 1664 states and 2200 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-10 01:43:32,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-10 01:43:33,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:33,124 INFO L93 Difference]: Finished difference Result 2571 states and 3427 transitions. [2025-01-10 01:43:33,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:43:33,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 167 [2025-01-10 01:43:33,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:33,131 INFO L225 Difference]: With dead ends: 2571 [2025-01-10 01:43:33,131 INFO L226 Difference]: Without dead ends: 1660 [2025-01-10 01:43:33,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:43:33,134 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 468 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-10 01:43:33,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 892 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-10 01:43:33,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2025-01-10 01:43:33,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 1660. [2025-01-10 01:43:33,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1660 states, 1224 states have (on average 1.3022875816993464) internal successors, (1594), 1251 states have internal predecessors, (1594), 296 states have call successors, (296), 138 states have call predecessors, (296), 135 states have return successors, (298), 288 states have call predecessors, (298), 289 states have call successors, (298) [2025-01-10 01:43:33,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 2188 transitions. [2025-01-10 01:43:33,181 INFO L78 Accepts]: Start accepts. Automaton has 1660 states and 2188 transitions. Word has length 167 [2025-01-10 01:43:33,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:33,181 INFO L471 AbstractCegarLoop]: Abstraction has 1660 states and 2188 transitions. [2025-01-10 01:43:33,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-10 01:43:33,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 2188 transitions. [2025-01-10 01:43:33,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-10 01:43:33,183 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:33,183 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:43:33,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 01:43:33,184 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ##fun~$Pointer$~X~$Pointer$~TO~intErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 01:43:33,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:33,184 INFO L85 PathProgramCache]: Analyzing trace with hash -2096521249, now seen corresponding path program 1 times [2025-01-10 01:43:33,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:33,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028186898] [2025-01-10 01:43:33,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:33,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:34,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-10 01:43:34,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-10 01:43:34,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:34,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:35,401 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2025-01-10 01:43:35,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:35,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028186898] [2025-01-10 01:43:35,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028186898] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:43:35,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:43:35,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:43:35,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088880535] [2025-01-10 01:43:35,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:43:35,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:43:35,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:35,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:43:35,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:43:35,403 INFO L87 Difference]: Start difference. First operand 1660 states and 2188 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-10 01:43:35,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:35,441 INFO L93 Difference]: Finished difference Result 3119 states and 4167 transitions. [2025-01-10 01:43:35,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:43:35,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 166 [2025-01-10 01:43:35,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:35,447 INFO L225 Difference]: With dead ends: 3119 [2025-01-10 01:43:35,447 INFO L226 Difference]: Without dead ends: 1647 [2025-01-10 01:43:35,449 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 01:43:35,450 INFO L435 NwaCegarLoop]: 517 mSDtfsCounter, 2 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:43:35,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1030 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:43:35,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2025-01-10 01:43:35,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1647. [2025-01-10 01:43:35,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1647 states, 1212 states have (on average 1.2986798679867986) internal successors, (1574), 1238 states have internal predecessors, (1574), 296 states have call successors, (296), 138 states have call predecessors, (296), 135 states have return successors, (298), 288 states have call predecessors, (298), 289 states have call successors, (298) [2025-01-10 01:43:35,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 2168 transitions. [2025-01-10 01:43:35,491 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 2168 transitions. Word has length 166 [2025-01-10 01:43:35,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:35,491 INFO L471 AbstractCegarLoop]: Abstraction has 1647 states and 2168 transitions. [2025-01-10 01:43:35,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-10 01:43:35,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 2168 transitions. [2025-01-10 01:43:35,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-10 01:43:35,493 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:35,494 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:43:35,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-10 01:43:35,494 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting zf_pingErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 01:43:35,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:35,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1019476590, now seen corresponding path program 1 times [2025-01-10 01:43:35,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:35,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706543935] [2025-01-10 01:43:35,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:35,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:37,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-10 01:43:37,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-10 01:43:37,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:37,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:37,819 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-01-10 01:43:37,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:37,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706543935] [2025-01-10 01:43:37,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706543935] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:43:37,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:43:37,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:43:37,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055588402] [2025-01-10 01:43:37,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:43:37,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:43:37,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:37,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:43:37,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:43:37,820 INFO L87 Difference]: Start difference. First operand 1647 states and 2168 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-10 01:43:37,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:37,923 INFO L93 Difference]: Finished difference Result 2531 states and 3361 transitions. [2025-01-10 01:43:37,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:43:37,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 168 [2025-01-10 01:43:37,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:37,930 INFO L225 Difference]: With dead ends: 2531 [2025-01-10 01:43:37,930 INFO L226 Difference]: Without dead ends: 1685 [2025-01-10 01:43:37,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:43:37,932 INFO L435 NwaCegarLoop]: 517 mSDtfsCounter, 18 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1528 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:43:37,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1528 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:43:37,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1685 states. [2025-01-10 01:43:38,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1685 to 1651. [2025-01-10 01:43:38,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1651 states, 1216 states have (on average 1.2976973684210527) internal successors, (1578), 1242 states have internal predecessors, (1578), 296 states have call successors, (296), 138 states have call predecessors, (296), 135 states have return successors, (298), 288 states have call predecessors, (298), 289 states have call successors, (298) [2025-01-10 01:43:38,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1651 states to 1651 states and 2172 transitions. [2025-01-10 01:43:38,014 INFO L78 Accepts]: Start accepts. Automaton has 1651 states and 2172 transitions. Word has length 168 [2025-01-10 01:43:38,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:38,015 INFO L471 AbstractCegarLoop]: Abstraction has 1651 states and 2172 transitions. [2025-01-10 01:43:38,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-10 01:43:38,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1651 states and 2172 transitions. [2025-01-10 01:43:38,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-01-10 01:43:38,017 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:38,017 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:43:38,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-10 01:43:38,017 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 01:43:38,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:38,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1889663331, now seen corresponding path program 1 times [2025-01-10 01:43:38,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:38,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605395500] [2025-01-10 01:43:38,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:38,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:39,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-10 01:43:39,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-10 01:43:39,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:39,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:40,039 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2025-01-10 01:43:40,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:40,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605395500] [2025-01-10 01:43:40,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605395500] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:43:40,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:43:40,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 01:43:40,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649688321] [2025-01-10 01:43:40,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:43:40,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:43:40,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:40,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:43:40,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:43:40,042 INFO L87 Difference]: Start difference. First operand 1651 states and 2172 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-10 01:43:40,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:40,101 INFO L93 Difference]: Finished difference Result 1838 states and 2370 transitions. [2025-01-10 01:43:40,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:43:40,101 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 172 [2025-01-10 01:43:40,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:40,106 INFO L225 Difference]: With dead ends: 1838 [2025-01-10 01:43:40,106 INFO L226 Difference]: Without dead ends: 1665 [2025-01-10 01:43:40,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:43:40,107 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 109 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:43:40,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 1267 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:43:40,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2025-01-10 01:43:40,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1659. [2025-01-10 01:43:40,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1659 states, 1224 states have (on average 1.2957516339869282) internal successors, (1586), 1250 states have internal predecessors, (1586), 296 states have call successors, (296), 138 states have call predecessors, (296), 135 states have return successors, (298), 288 states have call predecessors, (298), 289 states have call successors, (298) [2025-01-10 01:43:40,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 2180 transitions. [2025-01-10 01:43:40,177 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 2180 transitions. Word has length 172 [2025-01-10 01:43:40,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:40,178 INFO L471 AbstractCegarLoop]: Abstraction has 1659 states and 2180 transitions. [2025-01-10 01:43:40,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-10 01:43:40,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2180 transitions. [2025-01-10 01:43:40,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-10 01:43:40,180 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:40,180 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:43:40,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-10 01:43:40,180 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 01:43:40,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:40,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1813115837, now seen corresponding path program 1 times [2025-01-10 01:43:40,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:40,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032370033] [2025-01-10 01:43:40,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:40,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:43:41,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-10 01:43:41,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-10 01:43:41,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:43:41,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:43:42,320 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2025-01-10 01:43:42,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:43:42,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032370033] [2025-01-10 01:43:42,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032370033] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:43:42,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:43:42,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 01:43:42,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783748439] [2025-01-10 01:43:42,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:43:42,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:43:42,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:43:42,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:43:42,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:43:42,321 INFO L87 Difference]: Start difference. First operand 1659 states and 2180 transitions. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 6 states have internal predecessors, (95), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-10 01:43:42,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:43:42,387 INFO L93 Difference]: Finished difference Result 1748 states and 2286 transitions. [2025-01-10 01:43:42,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:43:42,388 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 6 states have internal predecessors, (95), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 175 [2025-01-10 01:43:42,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:43:42,393 INFO L225 Difference]: With dead ends: 1748 [2025-01-10 01:43:42,393 INFO L226 Difference]: Without dead ends: 1623 [2025-01-10 01:43:42,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:43:42,394 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 3 mSDsluCounter, 2554 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 3069 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:43:42,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 3069 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:43:42,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1623 states. [2025-01-10 01:43:42,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1623 to 1623. [2025-01-10 01:43:42,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1623 states, 1199 states have (on average 1.3010842368640534) internal successors, (1560), 1225 states have internal predecessors, (1560), 290 states have call successors, (290), 134 states have call predecessors, (290), 130 states have return successors, (291), 281 states have call predecessors, (291), 283 states have call successors, (291) [2025-01-10 01:43:42,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2141 transitions. [2025-01-10 01:43:42,442 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2141 transitions. Word has length 175 [2025-01-10 01:43:42,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:43:42,442 INFO L471 AbstractCegarLoop]: Abstraction has 1623 states and 2141 transitions. [2025-01-10 01:43:42,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 6 states have internal predecessors, (95), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-10 01:43:42,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2141 transitions. [2025-01-10 01:43:42,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-01-10 01:43:42,445 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:43:42,445 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:43:42,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-10 01:43:42,445 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [cdev_addErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, cdev_addErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, zf_readwErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 01:43:42,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:43:42,445 INFO L85 PathProgramCache]: Analyzing trace with hash -126889573, now seen corresponding path program 1 times [2025-01-10 01:43:42,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:43:42,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358656001] [2025-01-10 01:43:42,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:43:42,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms