./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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/uthash-2.0.2/uthash_SAX_test6-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ff5be3465740cb655882704e7eef418c95d0bbd56a2060e741c7d3e996e58af7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 08:49:19,774 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 08:49:19,836 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 08:49:19,841 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 08:49:19,842 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 08:49:19,864 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 08:49:19,865 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 08:49:19,866 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 08:49:19,866 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 08:49:19,866 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 08:49:19,867 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 08:49:19,867 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 08:49:19,868 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 08:49:19,868 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 08:49:19,868 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 08:49:19,869 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 08:49:19,869 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 08:49:19,869 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 08:49:19,869 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 08:49:19,869 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 08:49:19,869 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 08:49:19,869 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 08:49:19,870 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 08:49:19,870 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 08:49:19,870 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 08:49:19,870 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 08:49:19,870 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 08:49:19,870 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 08:49:19,870 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 08:49:19,870 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 08:49:19,871 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 08:49:19,871 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 08:49:19,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:49:19,871 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 08:49:19,871 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 08:49:19,871 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 08:49:19,872 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 08:49:19,872 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 08:49:19,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 08:49:19,872 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 08:49:19,872 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 08:49:19,872 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 08:49:19,872 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 08:49:19,872 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ff5be3465740cb655882704e7eef418c95d0bbd56a2060e741c7d3e996e58af7 [2025-02-06 08:49:20,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 08:49:20,186 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 08:49:20,190 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 08:49:20,192 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 08:49:20,192 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 08:49:20,193 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i [2025-02-06 08:49:21,526 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3aa153e90/1d65f95a5f2742f4951df6c2352703cd/FLAG1136083da [2025-02-06 08:49:21,949 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 08:49:21,951 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i [2025-02-06 08:49:21,978 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3aa153e90/1d65f95a5f2742f4951df6c2352703cd/FLAG1136083da [2025-02-06 08:49:21,999 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3aa153e90/1d65f95a5f2742f4951df6c2352703cd [2025-02-06 08:49:22,002 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 08:49:22,004 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 08:49:22,007 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 08:49:22,008 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 08:49:22,012 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 08:49:22,013 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:49:22" (1/1) ... [2025-02-06 08:49:22,014 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34fb4561 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:49:22, skipping insertion in model container [2025-02-06 08:49:22,014 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 08:49:22" (1/1) ... [2025-02-06 08:49:22,069 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 08:49:22,461 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i[44118,44131] [2025-02-06 08:49:22,470 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i[44660,44673] [2025-02-06 08:49:22,572 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i[56247,56260] [2025-02-06 08:49:22,573 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i[56368,56381] [2025-02-06 08:49:22,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:49:22,605 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 08:49:22,662 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i[44118,44131] [2025-02-06 08:49:22,665 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i[44660,44673] [2025-02-06 08:49:22,732 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i[56247,56260] [2025-02-06 08:49:22,736 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i[56368,56381] [2025-02-06 08:49:22,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 08:49:22,802 INFO L204 MainTranslator]: Completed translation [2025-02-06 08:49:22,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:49:22 WrapperNode [2025-02-06 08:49:22,803 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 08:49:22,804 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 08:49:22,804 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 08:49:22,805 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 08:49:22,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:49:22" (1/1) ... [2025-02-06 08:49:22,848 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:49:22" (1/1) ... [2025-02-06 08:49:22,911 INFO L138 Inliner]: procedures = 282, calls = 296, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1432 [2025-02-06 08:49:22,912 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 08:49:22,912 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 08:49:22,912 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 08:49:22,912 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 08:49:22,925 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:49:22" (1/1) ... [2025-02-06 08:49:22,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:49:22" (1/1) ... [2025-02-06 08:49:22,943 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:49:22" (1/1) ... [2025-02-06 08:49:23,032 INFO L175 MemorySlicer]: Split 268 memory accesses to 4 slices as follows [2, 12, 34, 220]. 82 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10, 0, 0]. The 54 writes are split as follows [0, 1, 4, 49]. [2025-02-06 08:49:23,034 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:49:22" (1/1) ... [2025-02-06 08:49:23,034 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:49:22" (1/1) ... [2025-02-06 08:49:23,077 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:49:22" (1/1) ... [2025-02-06 08:49:23,080 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:49:22" (1/1) ... [2025-02-06 08:49:23,084 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:49:22" (1/1) ... [2025-02-06 08:49:23,089 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:49:22" (1/1) ... [2025-02-06 08:49:23,098 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 08:49:23,099 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 08:49:23,099 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 08:49:23,099 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 08:49:23,100 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:49:22" (1/1) ... [2025-02-06 08:49:23,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 08:49:23,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 08:49:23,156 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-02-06 08:49:23,163 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-02-06 08:49:23,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 08:49:23,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 08:49:23,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 08:49:23,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 08:49:23,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 08:49:23,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 08:49:23,185 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2025-02-06 08:49:23,185 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2025-02-06 08:49:23,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 08:49:23,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 08:49:23,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 08:49:23,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 08:49:23,185 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-06 08:49:23,186 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-06 08:49:23,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 08:49:23,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 08:49:23,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 08:49:23,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 08:49:23,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 08:49:23,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 08:49:23,186 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2025-02-06 08:49:23,186 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2025-02-06 08:49:23,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 08:49:23,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 08:49:23,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 08:49:23,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-06 08:49:23,186 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2025-02-06 08:49:23,186 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2025-02-06 08:49:23,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 08:49:23,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 08:49:23,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 08:49:23,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 08:49:23,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 08:49:23,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 08:49:23,383 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 08:49:23,385 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 08:49:23,443 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L955: havoc #t~malloc32.base, #t~malloc32.offset; [2025-02-06 08:49:24,735 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L969: havoc alt_memcmp_#t~nondet36#1; [2025-02-06 08:49:24,736 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L979: havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset; [2025-02-06 08:49:24,736 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L987: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-02-06 08:49:24,834 INFO L? ?]: Removed 335 outVars from TransFormulas that were not future-live. [2025-02-06 08:49:24,835 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 08:49:24,923 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 08:49:24,923 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-06 08:49:24,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:49:24 BoogieIcfgContainer [2025-02-06 08:49:24,923 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 08:49:24,929 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 08:49:24,929 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 08:49:24,933 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 08:49:24,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 08:49:22" (1/3) ... [2025-02-06 08:49:24,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6df1a6b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:49:24, skipping insertion in model container [2025-02-06 08:49:24,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 08:49:22" (2/3) ... [2025-02-06 08:49:24,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6df1a6b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 08:49:24, skipping insertion in model container [2025-02-06 08:49:24,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 08:49:24" (3/3) ... [2025-02-06 08:49:24,936 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test6-1.i [2025-02-06 08:49:24,950 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 08:49:24,952 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_test6-1.i that has 5 procedures, 432 locations, 1 initial locations, 36 loop locations, and 4 error locations. [2025-02-06 08:49:25,015 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 08:49:25,030 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;@39372030, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 08:49:25,030 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-06 08:49:25,037 INFO L276 IsEmpty]: Start isEmpty. Operand has 432 states, 409 states have (on average 1.5941320293398533) internal successors, (652), 414 states have internal predecessors, (652), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 08:49:25,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 08:49:25,044 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:25,045 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:49:25,045 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:49:25,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:25,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1686042695, now seen corresponding path program 1 times [2025-02-06 08:49:25,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:25,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898791657] [2025-02-06 08:49:25,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:25,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:25,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 08:49:25,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 08:49:25,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:25,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:25,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:49:25,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:25,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898791657] [2025-02-06 08:49:25,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898791657] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:25,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:25,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 08:49:25,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213431941] [2025-02-06 08:49:25,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:25,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 08:49:25,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:25,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 08:49:25,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 08:49:25,252 INFO L87 Difference]: Start difference. First operand has 432 states, 409 states have (on average 1.5941320293398533) internal successors, (652), 414 states have internal predecessors, (652), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:25,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:25,389 INFO L93 Difference]: Finished difference Result 860 states and 1365 transitions. [2025-02-06 08:49:25,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 08:49:25,392 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 08:49:25,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:25,401 INFO L225 Difference]: With dead ends: 860 [2025-02-06 08:49:25,401 INFO L226 Difference]: Without dead ends: 426 [2025-02-06 08:49:25,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 08:49:25,408 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:25,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 569 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:49:25,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2025-02-06 08:49:25,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2025-02-06 08:49:25,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 405 states have (on average 1.4370370370370371) internal successors, (582), 410 states have internal predecessors, (582), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 08:49:25,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 607 transitions. [2025-02-06 08:49:25,481 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 607 transitions. Word has length 8 [2025-02-06 08:49:25,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:25,482 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 607 transitions. [2025-02-06 08:49:25,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:25,482 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 607 transitions. [2025-02-06 08:49:25,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-06 08:49:25,482 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:25,482 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 08:49:25,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 08:49:25,483 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:49:25,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:25,484 INFO L85 PathProgramCache]: Analyzing trace with hash -352224972, now seen corresponding path program 1 times [2025-02-06 08:49:25,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:25,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327249550] [2025-02-06 08:49:25,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:25,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:25,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 08:49:25,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 08:49:25,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:25,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:25,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:49:25,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:25,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327249550] [2025-02-06 08:49:25,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327249550] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:25,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:25,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:49:25,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143427665] [2025-02-06 08:49:25,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:25,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:49:25,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:25,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:49:25,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:49:25,665 INFO L87 Difference]: Start difference. First operand 426 states and 607 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:26,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:26,055 INFO L93 Difference]: Finished difference Result 1036 states and 1487 transitions. [2025-02-06 08:49:26,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:49:26,056 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-06 08:49:26,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:26,063 INFO L225 Difference]: With dead ends: 1036 [2025-02-06 08:49:26,063 INFO L226 Difference]: Without dead ends: 825 [2025-02-06 08:49:26,067 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-02-06 08:49:26,068 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 555 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 1648 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:26,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 1648 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 08:49:26,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2025-02-06 08:49:26,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 428. [2025-02-06 08:49:26,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 407 states have (on average 1.434889434889435) internal successors, (584), 412 states have internal predecessors, (584), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 08:49:26,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 609 transitions. [2025-02-06 08:49:26,107 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 609 transitions. Word has length 10 [2025-02-06 08:49:26,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:26,107 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 609 transitions. [2025-02-06 08:49:26,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:26,108 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 609 transitions. [2025-02-06 08:49:26,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-06 08:49:26,111 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:26,111 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:49:26,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 08:49:26,112 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:49:26,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:26,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1847681027, now seen corresponding path program 1 times [2025-02-06 08:49:26,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:26,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197457133] [2025-02-06 08:49:26,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:26,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:26,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 08:49:26,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 08:49:26,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:26,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:26,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:49:26,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:26,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197457133] [2025-02-06 08:49:26,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197457133] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:26,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:26,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:49:26,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509432388] [2025-02-06 08:49:26,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:26,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:49:26,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:26,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:49:26,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:49:26,482 INFO L87 Difference]: Start difference. First operand 428 states and 609 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:26,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:26,690 INFO L93 Difference]: Finished difference Result 855 states and 1217 transitions. [2025-02-06 08:49:26,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:49:26,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-02-06 08:49:26,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:26,693 INFO L225 Difference]: With dead ends: 855 [2025-02-06 08:49:26,693 INFO L226 Difference]: Without dead ends: 431 [2025-02-06 08:49:26,698 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-02-06 08:49:26,698 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 105 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1530 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:26,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1530 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 08:49:26,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2025-02-06 08:49:26,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 428. [2025-02-06 08:49:26,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 407 states have (on average 1.4176904176904177) internal successors, (577), 412 states have internal predecessors, (577), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 08:49:26,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 602 transitions. [2025-02-06 08:49:26,721 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 602 transitions. Word has length 66 [2025-02-06 08:49:26,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:26,721 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 602 transitions. [2025-02-06 08:49:26,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:26,722 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 602 transitions. [2025-02-06 08:49:26,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-06 08:49:26,723 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:26,723 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:49:26,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 08:49:26,724 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:49:26,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:26,724 INFO L85 PathProgramCache]: Analyzing trace with hash -2132888060, now seen corresponding path program 1 times [2025-02-06 08:49:26,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:26,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534371058] [2025-02-06 08:49:26,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:26,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:26,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 08:49:26,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 08:49:26,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:26,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:26,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:49:26,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:26,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534371058] [2025-02-06 08:49:26,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534371058] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:26,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:26,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 08:49:26,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071767420] [2025-02-06 08:49:26,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:26,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 08:49:26,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:26,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 08:49:26,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 08:49:26,924 INFO L87 Difference]: Start difference. First operand 428 states and 602 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:27,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:27,062 INFO L93 Difference]: Finished difference Result 858 states and 1209 transitions. [2025-02-06 08:49:27,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 08:49:27,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-02-06 08:49:27,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:27,065 INFO L225 Difference]: With dead ends: 858 [2025-02-06 08:49:27,065 INFO L226 Difference]: Without dead ends: 434 [2025-02-06 08:49:27,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-02-06 08:49:27,069 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 1 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:27,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1082 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 08:49:27,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2025-02-06 08:49:27,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2025-02-06 08:49:27,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 413 states have (on average 1.4116222760290558) internal successors, (583), 418 states have internal predecessors, (583), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 08:49:27,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 608 transitions. [2025-02-06 08:49:27,089 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 608 transitions. Word has length 66 [2025-02-06 08:49:27,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:27,089 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 608 transitions. [2025-02-06 08:49:27,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:27,090 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 608 transitions. [2025-02-06 08:49:27,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-06 08:49:27,094 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:27,094 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:49:27,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 08:49:27,094 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:49:27,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:27,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1832313475, now seen corresponding path program 1 times [2025-02-06 08:49:27,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:27,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811503187] [2025-02-06 08:49:27,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:27,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:27,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 08:49:27,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 08:49:27,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:27,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:27,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:49:27,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:27,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811503187] [2025-02-06 08:49:27,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811503187] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:27,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:27,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 08:49:27,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844899399] [2025-02-06 08:49:27,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:27,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:49:27,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:27,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:49:27,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:49:27,579 INFO L87 Difference]: Start difference. First operand 434 states and 608 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:28,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:28,264 INFO L93 Difference]: Finished difference Result 904 states and 1263 transitions. [2025-02-06 08:49:28,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:49:28,268 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-02-06 08:49:28,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:28,270 INFO L225 Difference]: With dead ends: 904 [2025-02-06 08:49:28,270 INFO L226 Difference]: Without dead ends: 474 [2025-02-06 08:49:28,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:49:28,275 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 14 mSDsluCounter, 1701 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2245 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:28,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2245 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 08:49:28,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2025-02-06 08:49:28,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 467. [2025-02-06 08:49:28,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 446 states have (on average 1.3946188340807175) internal successors, (622), 451 states have internal predecessors, (622), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 08:49:28,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 647 transitions. [2025-02-06 08:49:28,300 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 647 transitions. Word has length 66 [2025-02-06 08:49:28,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:28,301 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 647 transitions. [2025-02-06 08:49:28,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:28,302 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 647 transitions. [2025-02-06 08:49:28,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-06 08:49:28,306 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:28,307 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:49:28,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 08:49:28,307 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:49:28,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:28,307 INFO L85 PathProgramCache]: Analyzing trace with hash 46339073, now seen corresponding path program 1 times [2025-02-06 08:49:28,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:28,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937642530] [2025-02-06 08:49:28,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:28,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:28,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-06 08:49:28,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-06 08:49:28,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:28,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:28,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:49:28,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:28,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937642530] [2025-02-06 08:49:28,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937642530] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:28,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:28,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 08:49:28,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015920410] [2025-02-06 08:49:28,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:28,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 08:49:28,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:28,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 08:49:28,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:49:28,605 INFO L87 Difference]: Start difference. First operand 467 states and 647 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:29,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:29,292 INFO L93 Difference]: Finished difference Result 943 states and 1311 transitions. [2025-02-06 08:49:29,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 08:49:29,293 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-02-06 08:49:29,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:29,296 INFO L225 Difference]: With dead ends: 943 [2025-02-06 08:49:29,296 INFO L226 Difference]: Without dead ends: 480 [2025-02-06 08:49:29,297 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-02-06 08:49:29,298 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 15 mSDsluCounter, 2158 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2697 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:29,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2697 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 08:49:29,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2025-02-06 08:49:29,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 477. [2025-02-06 08:49:29,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 456 states have (on average 1.3969298245614035) internal successors, (637), 461 states have internal predecessors, (637), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 08:49:29,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 662 transitions. [2025-02-06 08:49:29,322 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 662 transitions. Word has length 67 [2025-02-06 08:49:29,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:29,322 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 662 transitions. [2025-02-06 08:49:29,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:29,323 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 662 transitions. [2025-02-06 08:49:29,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-06 08:49:29,324 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:29,324 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:49:29,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 08:49:29,325 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:49:29,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:29,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1740254104, now seen corresponding path program 1 times [2025-02-06 08:49:29,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:29,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525658332] [2025-02-06 08:49:29,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:29,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:29,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-06 08:49:29,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-06 08:49:29,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:29,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:29,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:49:29,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:29,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525658332] [2025-02-06 08:49:29,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525658332] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:29,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:29,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 08:49:29,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101882071] [2025-02-06 08:49:29,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:29,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 08:49:29,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:29,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 08:49:29,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 08:49:29,666 INFO L87 Difference]: Start difference. First operand 477 states and 662 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:29,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:29,957 INFO L93 Difference]: Finished difference Result 953 states and 1324 transitions. [2025-02-06 08:49:29,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 08:49:29,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-02-06 08:49:29,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:29,962 INFO L225 Difference]: With dead ends: 953 [2025-02-06 08:49:29,962 INFO L226 Difference]: Without dead ends: 480 [2025-02-06 08:49:29,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-02-06 08:49:29,965 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 17 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1483 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:29,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1483 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 08:49:29,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2025-02-06 08:49:29,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 477. [2025-02-06 08:49:29,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 456 states have (on average 1.394736842105263) internal successors, (636), 461 states have internal predecessors, (636), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 08:49:29,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 661 transitions. [2025-02-06 08:49:29,983 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 661 transitions. Word has length 67 [2025-02-06 08:49:29,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:29,983 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 661 transitions. [2025-02-06 08:49:29,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:29,984 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 661 transitions. [2025-02-06 08:49:29,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-06 08:49:29,986 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:29,986 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:49:29,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 08:49:29,986 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:49:29,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:29,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1384604700, now seen corresponding path program 1 times [2025-02-06 08:49:29,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:29,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033311776] [2025-02-06 08:49:29,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:29,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:30,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-06 08:49:30,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 08:49:30,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:30,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:30,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:49:30,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:30,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033311776] [2025-02-06 08:49:30,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033311776] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:30,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:30,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 08:49:30,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752058051] [2025-02-06 08:49:30,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:30,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 08:49:30,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:30,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 08:49:30,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:49:30,420 INFO L87 Difference]: Start difference. First operand 477 states and 661 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:31,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:31,370 INFO L93 Difference]: Finished difference Result 966 states and 1343 transitions. [2025-02-06 08:49:31,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 08:49:31,372 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-02-06 08:49:31,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:31,375 INFO L225 Difference]: With dead ends: 966 [2025-02-06 08:49:31,375 INFO L226 Difference]: Without dead ends: 493 [2025-02-06 08:49:31,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-06 08:49:31,377 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 33 mSDsluCounter, 3129 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3670 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:31,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3670 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1172 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 08:49:31,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2025-02-06 08:49:31,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 487. [2025-02-06 08:49:31,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 466 states have (on average 1.3948497854077253) internal successors, (650), 471 states have internal predecessors, (650), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 08:49:31,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 675 transitions. [2025-02-06 08:49:31,397 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 675 transitions. Word has length 68 [2025-02-06 08:49:31,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:31,397 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 675 transitions. [2025-02-06 08:49:31,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:31,397 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 675 transitions. [2025-02-06 08:49:31,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-06 08:49:31,398 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:31,398 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:49:31,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 08:49:31,399 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:49:31,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:31,399 INFO L85 PathProgramCache]: Analyzing trace with hash -174576288, now seen corresponding path program 1 times [2025-02-06 08:49:31,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:31,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056959181] [2025-02-06 08:49:31,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:31,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:31,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-06 08:49:31,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 08:49:31,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:31,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:31,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:49:31,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:31,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056959181] [2025-02-06 08:49:31,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056959181] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:31,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:31,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 08:49:31,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80725597] [2025-02-06 08:49:31,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:31,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 08:49:31,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:31,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 08:49:31,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 08:49:31,915 INFO L87 Difference]: Start difference. First operand 487 states and 675 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:32,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:32,575 INFO L93 Difference]: Finished difference Result 976 states and 1355 transitions. [2025-02-06 08:49:32,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 08:49:32,576 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-02-06 08:49:32,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:32,579 INFO L225 Difference]: With dead ends: 976 [2025-02-06 08:49:32,579 INFO L226 Difference]: Without dead ends: 493 [2025-02-06 08:49:32,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-02-06 08:49:32,581 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 27 mSDsluCounter, 2251 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2795 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:32,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2795 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 08:49:32,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2025-02-06 08:49:32,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 490. [2025-02-06 08:49:32,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 469 states have (on average 1.392324093816631) internal successors, (653), 474 states have internal predecessors, (653), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 08:49:32,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 678 transitions. [2025-02-06 08:49:32,595 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 678 transitions. Word has length 68 [2025-02-06 08:49:32,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:32,595 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 678 transitions. [2025-02-06 08:49:32,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:32,596 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 678 transitions. [2025-02-06 08:49:32,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-06 08:49:32,596 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:32,597 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:49:32,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 08:49:32,597 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:49:32,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:32,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1536550656, now seen corresponding path program 1 times [2025-02-06 08:49:32,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:32,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488376243] [2025-02-06 08:49:32,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:32,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:32,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-06 08:49:32,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-06 08:49:32,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:32,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:32,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:49:32,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:32,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488376243] [2025-02-06 08:49:32,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488376243] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:32,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:32,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 08:49:32,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713113535] [2025-02-06 08:49:32,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:32,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 08:49:32,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:32,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 08:49:32,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:49:32,852 INFO L87 Difference]: Start difference. First operand 490 states and 678 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:33,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:33,289 INFO L93 Difference]: Finished difference Result 979 states and 1357 transitions. [2025-02-06 08:49:33,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 08:49:33,290 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-02-06 08:49:33,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:33,293 INFO L225 Difference]: With dead ends: 979 [2025-02-06 08:49:33,293 INFO L226 Difference]: Without dead ends: 493 [2025-02-06 08:49:33,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 08:49:33,295 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 8 mSDsluCounter, 1321 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1870 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:33,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1870 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 08:49:33,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2025-02-06 08:49:33,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2025-02-06 08:49:33,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 472 states have (on average 1.3898305084745763) internal successors, (656), 477 states have internal predecessors, (656), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 08:49:33,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 681 transitions. [2025-02-06 08:49:33,314 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 681 transitions. Word has length 68 [2025-02-06 08:49:33,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:33,315 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 681 transitions. [2025-02-06 08:49:33,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:33,315 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 681 transitions. [2025-02-06 08:49:33,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-06 08:49:33,316 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:33,316 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:49:33,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 08:49:33,318 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:49:33,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:33,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1098462895, now seen corresponding path program 1 times [2025-02-06 08:49:33,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:33,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108744682] [2025-02-06 08:49:33,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:33,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:33,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-06 08:49:33,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 08:49:33,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:33,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:33,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:49:33,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:33,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108744682] [2025-02-06 08:49:33,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108744682] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:33,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:33,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 08:49:33,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415683782] [2025-02-06 08:49:33,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:33,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 08:49:33,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:33,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 08:49:33,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:49:33,879 INFO L87 Difference]: Start difference. First operand 493 states and 681 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:35,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:35,034 INFO L93 Difference]: Finished difference Result 1435 states and 1995 transitions. [2025-02-06 08:49:35,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 08:49:35,035 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-02-06 08:49:35,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:35,039 INFO L225 Difference]: With dead ends: 1435 [2025-02-06 08:49:35,040 INFO L226 Difference]: Without dead ends: 946 [2025-02-06 08:49:35,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-02-06 08:49:35,042 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 856 mSDsluCounter, 2262 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 2802 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:35,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 2802 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 08:49:35,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2025-02-06 08:49:35,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 530. [2025-02-06 08:49:35,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 509 states have (on average 1.3713163064833005) internal successors, (698), 514 states have internal predecessors, (698), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 08:49:35,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 723 transitions. [2025-02-06 08:49:35,061 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 723 transitions. Word has length 69 [2025-02-06 08:49:35,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:35,061 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 723 transitions. [2025-02-06 08:49:35,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:35,062 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 723 transitions. [2025-02-06 08:49:35,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-06 08:49:35,062 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:35,063 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:49:35,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 08:49:35,063 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:49:35,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:35,063 INFO L85 PathProgramCache]: Analyzing trace with hash -468036161, now seen corresponding path program 1 times [2025-02-06 08:49:35,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:35,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540544701] [2025-02-06 08:49:35,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:35,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:35,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-06 08:49:35,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 08:49:35,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:35,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:35,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:49:35,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:35,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540544701] [2025-02-06 08:49:35,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540544701] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:35,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:35,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 08:49:35,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307258994] [2025-02-06 08:49:35,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:35,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 08:49:35,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:35,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 08:49:35,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:49:35,294 INFO L87 Difference]: Start difference. First operand 530 states and 723 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:35,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:35,955 INFO L93 Difference]: Finished difference Result 1026 states and 1411 transitions. [2025-02-06 08:49:35,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 08:49:35,955 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-02-06 08:49:35,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:35,958 INFO L225 Difference]: With dead ends: 1026 [2025-02-06 08:49:35,958 INFO L226 Difference]: Without dead ends: 537 [2025-02-06 08:49:35,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 08:49:35,959 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 12 mSDsluCounter, 2159 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2705 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:35,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2705 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 08:49:35,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-02-06 08:49:36,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 530. [2025-02-06 08:49:36,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 509 states have (on average 1.3713163064833005) internal successors, (698), 514 states have internal predecessors, (698), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 08:49:36,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 723 transitions. [2025-02-06 08:49:36,018 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 723 transitions. Word has length 69 [2025-02-06 08:49:36,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:36,018 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 723 transitions. [2025-02-06 08:49:36,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:36,019 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 723 transitions. [2025-02-06 08:49:36,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-06 08:49:36,022 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:36,022 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:49:36,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 08:49:36,022 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:49:36,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:36,023 INFO L85 PathProgramCache]: Analyzing trace with hash 624377177, now seen corresponding path program 1 times [2025-02-06 08:49:36,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:36,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220739052] [2025-02-06 08:49:36,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:36,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:36,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 08:49:36,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 08:49:36,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:36,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:36,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:49:36,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:36,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220739052] [2025-02-06 08:49:36,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220739052] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:36,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:36,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 08:49:36,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561484764] [2025-02-06 08:49:36,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:36,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 08:49:36,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:36,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 08:49:36,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:49:36,262 INFO L87 Difference]: Start difference. First operand 530 states and 723 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:36,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:36,972 INFO L93 Difference]: Finished difference Result 1032 states and 1418 transitions. [2025-02-06 08:49:36,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 08:49:36,973 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-02-06 08:49:36,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:36,977 INFO L225 Difference]: With dead ends: 1032 [2025-02-06 08:49:36,977 INFO L226 Difference]: Without dead ends: 543 [2025-02-06 08:49:36,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:49:36,979 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 20 mSDsluCounter, 3131 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 3672 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:36,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 3672 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1134 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 08:49:36,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2025-02-06 08:49:36,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 533. [2025-02-06 08:49:36,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 512 states have (on average 1.37109375) internal successors, (702), 517 states have internal predecessors, (702), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 08:49:36,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 727 transitions. [2025-02-06 08:49:36,998 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 727 transitions. Word has length 70 [2025-02-06 08:49:36,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:36,998 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 727 transitions. [2025-02-06 08:49:36,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:36,998 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 727 transitions. [2025-02-06 08:49:37,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-06 08:49:37,001 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:37,001 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:49:37,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 08:49:37,002 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:49:37,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:37,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1676125666, now seen corresponding path program 1 times [2025-02-06 08:49:37,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:37,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028515872] [2025-02-06 08:49:37,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:37,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:37,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 08:49:37,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 08:49:37,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:37,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:37,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:49:37,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:37,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028515872] [2025-02-06 08:49:37,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028515872] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:37,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:37,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 08:49:37,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111429970] [2025-02-06 08:49:37,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:37,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 08:49:37,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:37,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 08:49:37,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:49:37,302 INFO L87 Difference]: Start difference. First operand 533 states and 727 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:38,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:38,262 INFO L93 Difference]: Finished difference Result 1041 states and 1429 transitions. [2025-02-06 08:49:38,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 08:49:38,263 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-02-06 08:49:38,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:38,266 INFO L225 Difference]: With dead ends: 1041 [2025-02-06 08:49:38,266 INFO L226 Difference]: Without dead ends: 549 [2025-02-06 08:49:38,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-06 08:49:38,268 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 37 mSDsluCounter, 3035 mSDsCounter, 0 mSdLazyCounter, 1360 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 3584 SdHoareTripleChecker+Invalid, 1362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:38,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 3584 Invalid, 1362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1360 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 08:49:38,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-02-06 08:49:38,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 533. [2025-02-06 08:49:38,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 512 states have (on average 1.37109375) internal successors, (702), 517 states have internal predecessors, (702), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 08:49:38,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 727 transitions. [2025-02-06 08:49:38,292 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 727 transitions. Word has length 70 [2025-02-06 08:49:38,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:38,292 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 727 transitions. [2025-02-06 08:49:38,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:38,292 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 727 transitions. [2025-02-06 08:49:38,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-06 08:49:38,293 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:38,293 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:49:38,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 08:49:38,294 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:49:38,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:38,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1146051037, now seen corresponding path program 1 times [2025-02-06 08:49:38,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:38,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540540923] [2025-02-06 08:49:38,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:38,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:38,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-06 08:49:38,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 08:49:38,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:38,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:38,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:49:38,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:38,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540540923] [2025-02-06 08:49:38,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540540923] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:38,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:38,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 08:49:38,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604742200] [2025-02-06 08:49:38,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:38,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 08:49:38,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:38,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 08:49:38,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 08:49:38,606 INFO L87 Difference]: Start difference. First operand 533 states and 727 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:39,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:39,361 INFO L93 Difference]: Finished difference Result 1041 states and 1431 transitions. [2025-02-06 08:49:39,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 08:49:39,361 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-02-06 08:49:39,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:39,364 INFO L225 Difference]: With dead ends: 1041 [2025-02-06 08:49:39,364 INFO L226 Difference]: Without dead ends: 549 [2025-02-06 08:49:39,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-06 08:49:39,367 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 26 mSDsluCounter, 3077 mSDsCounter, 0 mSdLazyCounter, 1305 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 3624 SdHoareTripleChecker+Invalid, 1306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:39,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 3624 Invalid, 1306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1305 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 08:49:39,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-02-06 08:49:39,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 543. [2025-02-06 08:49:39,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 522 states have (on average 1.367816091954023) internal successors, (714), 527 states have internal predecessors, (714), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 08:49:39,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 739 transitions. [2025-02-06 08:49:39,389 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 739 transitions. Word has length 71 [2025-02-06 08:49:39,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:39,389 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 739 transitions. [2025-02-06 08:49:39,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:39,390 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 739 transitions. [2025-02-06 08:49:39,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-06 08:49:39,390 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:39,390 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:49:39,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 08:49:39,391 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:49:39,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:39,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1450060360, now seen corresponding path program 1 times [2025-02-06 08:49:39,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:39,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616956926] [2025-02-06 08:49:39,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:39,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:39,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-06 08:49:39,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 08:49:39,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:39,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:39,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:49:39,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:39,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616956926] [2025-02-06 08:49:39,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616956926] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:39,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:39,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 08:49:39,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840890842] [2025-02-06 08:49:39,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:39,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 08:49:39,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:39,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 08:49:39,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-06 08:49:39,694 INFO L87 Difference]: Start difference. First operand 543 states and 739 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:40,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:40,589 INFO L93 Difference]: Finished difference Result 1063 states and 1458 transitions. [2025-02-06 08:49:40,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 08:49:40,590 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-02-06 08:49:40,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:40,593 INFO L225 Difference]: With dead ends: 1063 [2025-02-06 08:49:40,593 INFO L226 Difference]: Without dead ends: 561 [2025-02-06 08:49:40,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-06 08:49:40,595 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 17 mSDsluCounter, 3500 mSDsCounter, 0 mSdLazyCounter, 1430 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4035 SdHoareTripleChecker+Invalid, 1430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:40,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4035 Invalid, 1430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1430 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 08:49:40,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2025-02-06 08:49:40,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 546. [2025-02-06 08:49:40,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 525 states have (on average 1.3676190476190475) internal successors, (718), 530 states have internal predecessors, (718), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 08:49:40,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 743 transitions. [2025-02-06 08:49:40,613 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 743 transitions. Word has length 71 [2025-02-06 08:49:40,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:40,614 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 743 transitions. [2025-02-06 08:49:40,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:40,614 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 743 transitions. [2025-02-06 08:49:40,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-06 08:49:40,615 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:40,615 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:49:40,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 08:49:40,616 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:49:40,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:40,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1638205352, now seen corresponding path program 1 times [2025-02-06 08:49:40,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:40,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155303207] [2025-02-06 08:49:40,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:40,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:40,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-06 08:49:40,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 08:49:40,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:40,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:40,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:49:40,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:40,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155303207] [2025-02-06 08:49:40,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155303207] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:40,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:40,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 08:49:40,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981262679] [2025-02-06 08:49:40,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:40,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 08:49:40,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:40,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 08:49:40,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:49:40,906 INFO L87 Difference]: Start difference. First operand 546 states and 743 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:41,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:41,427 INFO L93 Difference]: Finished difference Result 1058 states and 1448 transitions. [2025-02-06 08:49:41,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 08:49:41,428 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-02-06 08:49:41,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:41,430 INFO L225 Difference]: With dead ends: 1058 [2025-02-06 08:49:41,430 INFO L226 Difference]: Without dead ends: 553 [2025-02-06 08:49:41,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-02-06 08:49:41,432 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 11 mSDsluCounter, 2193 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2735 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:41,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2735 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 08:49:41,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-02-06 08:49:41,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 546. [2025-02-06 08:49:41,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 525 states have (on average 1.3657142857142857) internal successors, (717), 530 states have internal predecessors, (717), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 08:49:41,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 742 transitions. [2025-02-06 08:49:41,447 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 742 transitions. Word has length 71 [2025-02-06 08:49:41,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:41,448 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 742 transitions. [2025-02-06 08:49:41,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:41,448 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 742 transitions. [2025-02-06 08:49:41,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-06 08:49:41,450 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:41,450 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:49:41,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 08:49:41,450 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:49:41,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:41,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1097580956, now seen corresponding path program 1 times [2025-02-06 08:49:41,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:41,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982243312] [2025-02-06 08:49:41,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:41,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:41,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-06 08:49:41,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 08:49:41,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:41,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:41,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:49:41,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:41,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982243312] [2025-02-06 08:49:41,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982243312] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:41,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:41,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 08:49:41,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712229092] [2025-02-06 08:49:41,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:41,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 08:49:41,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:41,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 08:49:41,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 08:49:41,668 INFO L87 Difference]: Start difference. First operand 546 states and 742 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:42,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:42,312 INFO L93 Difference]: Finished difference Result 1056 states and 1446 transitions. [2025-02-06 08:49:42,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 08:49:42,313 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-02-06 08:49:42,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:42,315 INFO L225 Difference]: With dead ends: 1056 [2025-02-06 08:49:42,315 INFO L226 Difference]: Without dead ends: 551 [2025-02-06 08:49:42,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-02-06 08:49:42,319 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 8 mSDsluCounter, 2126 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2671 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:42,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2671 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 08:49:42,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2025-02-06 08:49:42,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 550. [2025-02-06 08:49:42,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 529 states have (on average 1.3648393194706994) internal successors, (722), 534 states have internal predecessors, (722), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 08:49:42,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 747 transitions. [2025-02-06 08:49:42,336 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 747 transitions. Word has length 71 [2025-02-06 08:49:42,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:42,336 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 747 transitions. [2025-02-06 08:49:42,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:42,337 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 747 transitions. [2025-02-06 08:49:42,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-06 08:49:42,339 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:42,339 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:49:42,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 08:49:42,339 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:49:42,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:42,340 INFO L85 PathProgramCache]: Analyzing trace with hash 584019810, now seen corresponding path program 1 times [2025-02-06 08:49:42,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:42,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526093858] [2025-02-06 08:49:42,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:42,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:42,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 08:49:42,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 08:49:42,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:42,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:42,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:49:42,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:42,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526093858] [2025-02-06 08:49:42,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526093858] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:42,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:42,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 08:49:42,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450587553] [2025-02-06 08:49:42,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:42,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 08:49:42,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:42,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 08:49:42,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-06 08:49:42,766 INFO L87 Difference]: Start difference. First operand 550 states and 747 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:43,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:43,637 INFO L93 Difference]: Finished difference Result 1071 states and 1466 transitions. [2025-02-06 08:49:43,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 08:49:43,638 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-02-06 08:49:43,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:43,641 INFO L225 Difference]: With dead ends: 1071 [2025-02-06 08:49:43,641 INFO L226 Difference]: Without dead ends: 562 [2025-02-06 08:49:43,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-06 08:49:43,642 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 13 mSDsluCounter, 3046 mSDsCounter, 0 mSdLazyCounter, 1345 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3590 SdHoareTripleChecker+Invalid, 1345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:43,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3590 Invalid, 1345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1345 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 08:49:43,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2025-02-06 08:49:43,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 554. [2025-02-06 08:49:43,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 533 states have (on average 1.3639774859287055) internal successors, (727), 538 states have internal predecessors, (727), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 08:49:43,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 752 transitions. [2025-02-06 08:49:43,657 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 752 transitions. Word has length 72 [2025-02-06 08:49:43,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:43,657 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 752 transitions. [2025-02-06 08:49:43,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:43,658 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 752 transitions. [2025-02-06 08:49:43,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-06 08:49:43,658 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:43,658 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:49:43,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 08:49:43,659 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:49:43,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:43,659 INFO L85 PathProgramCache]: Analyzing trace with hash 774828983, now seen corresponding path program 1 times [2025-02-06 08:49:43,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:43,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293335540] [2025-02-06 08:49:43,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:43,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:43,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 08:49:43,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 08:49:43,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:43,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:43,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:49:43,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:43,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293335540] [2025-02-06 08:49:43,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293335540] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:43,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:43,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 08:49:43,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886810267] [2025-02-06 08:49:43,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:43,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 08:49:43,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:43,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 08:49:43,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-02-06 08:49:43,929 INFO L87 Difference]: Start difference. First operand 554 states and 752 transitions. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:44,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:44,666 INFO L93 Difference]: Finished difference Result 1081 states and 1477 transitions. [2025-02-06 08:49:44,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 08:49:44,667 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-02-06 08:49:44,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:44,669 INFO L225 Difference]: With dead ends: 1081 [2025-02-06 08:49:44,669 INFO L226 Difference]: Without dead ends: 568 [2025-02-06 08:49:44,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-02-06 08:49:44,670 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 26 mSDsluCounter, 4018 mSDsCounter, 0 mSdLazyCounter, 1568 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 4560 SdHoareTripleChecker+Invalid, 1569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:44,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 4560 Invalid, 1569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1568 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 08:49:44,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2025-02-06 08:49:44,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 557. [2025-02-06 08:49:44,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 536 states have (on average 1.3619402985074627) internal successors, (730), 541 states have internal predecessors, (730), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 08:49:44,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 755 transitions. [2025-02-06 08:49:44,687 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 755 transitions. Word has length 72 [2025-02-06 08:49:44,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:44,687 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 755 transitions. [2025-02-06 08:49:44,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:44,688 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 755 transitions. [2025-02-06 08:49:44,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-06 08:49:44,689 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:44,689 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:49:44,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 08:49:44,689 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:49:44,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:44,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1708945127, now seen corresponding path program 1 times [2025-02-06 08:49:44,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:44,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684945052] [2025-02-06 08:49:44,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:44,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:44,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 08:49:44,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 08:49:44,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:44,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:45,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:49:45,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:45,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684945052] [2025-02-06 08:49:45,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684945052] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:45,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:45,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 08:49:45,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138858490] [2025-02-06 08:49:45,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:45,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 08:49:45,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:45,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 08:49:45,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-06 08:49:45,155 INFO L87 Difference]: Start difference. First operand 557 states and 755 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:46,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:46,327 INFO L93 Difference]: Finished difference Result 1084 states and 1477 transitions. [2025-02-06 08:49:46,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 08:49:46,328 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-02-06 08:49:46,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:46,330 INFO L225 Difference]: With dead ends: 1084 [2025-02-06 08:49:46,330 INFO L226 Difference]: Without dead ends: 568 [2025-02-06 08:49:46,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-02-06 08:49:46,332 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 44 mSDsluCounter, 2997 mSDsCounter, 0 mSdLazyCounter, 1350 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 3540 SdHoareTripleChecker+Invalid, 1357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:46,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 3540 Invalid, 1357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1350 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 08:49:46,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2025-02-06 08:49:46,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 558. [2025-02-06 08:49:46,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 537 states have (on average 1.361266294227188) internal successors, (731), 542 states have internal predecessors, (731), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 08:49:46,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 756 transitions. [2025-02-06 08:49:46,354 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 756 transitions. Word has length 72 [2025-02-06 08:49:46,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:46,355 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 756 transitions. [2025-02-06 08:49:46,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:46,356 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 756 transitions. [2025-02-06 08:49:46,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-06 08:49:46,356 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:46,357 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:49:46,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 08:49:46,357 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:49:46,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:46,357 INFO L85 PathProgramCache]: Analyzing trace with hash -386635295, now seen corresponding path program 1 times [2025-02-06 08:49:46,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:46,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109934909] [2025-02-06 08:49:46,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:46,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:46,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 08:49:46,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 08:49:46,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:46,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:49:46,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:49:46,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:49:46,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109934909] [2025-02-06 08:49:46,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109934909] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:49:46,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:49:46,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 08:49:46,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143997182] [2025-02-06 08:49:46,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:49:46,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 08:49:46,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:49:46,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 08:49:46,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 08:49:46,576 INFO L87 Difference]: Start difference. First operand 558 states and 756 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:47,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 08:49:47,424 INFO L93 Difference]: Finished difference Result 1089 states and 1484 transitions. [2025-02-06 08:49:47,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 08:49:47,425 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-02-06 08:49:47,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 08:49:47,427 INFO L225 Difference]: With dead ends: 1089 [2025-02-06 08:49:47,427 INFO L226 Difference]: Without dead ends: 572 [2025-02-06 08:49:47,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-06 08:49:47,430 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 33 mSDsluCounter, 3035 mSDsCounter, 0 mSdLazyCounter, 1338 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3584 SdHoareTripleChecker+Invalid, 1340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 08:49:47,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3584 Invalid, 1340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1338 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 08:49:47,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-02-06 08:49:47,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 555. [2025-02-06 08:49:47,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 534 states have (on average 1.3632958801498127) internal successors, (728), 539 states have internal predecessors, (728), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 08:49:47,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 753 transitions. [2025-02-06 08:49:47,443 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 753 transitions. Word has length 72 [2025-02-06 08:49:47,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 08:49:47,444 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 753 transitions. [2025-02-06 08:49:47,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:49:47,444 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 753 transitions. [2025-02-06 08:49:47,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-06 08:49:47,445 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 08:49:47,445 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 08:49:47,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 08:49:47,445 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 08:49:47,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 08:49:47,446 INFO L85 PathProgramCache]: Analyzing trace with hash -316293995, now seen corresponding path program 1 times [2025-02-06 08:49:47,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 08:49:47,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087457164] [2025-02-06 08:49:47,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 08:49:47,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 08:49:47,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-06 08:49:47,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-06 08:49:47,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 08:49:47,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 08:50:11,500 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* (div |c_ULTIMATE.start_main_~_hj_j~0#1| 4294967296) 524288)) (.cse0 (div |c_ULTIMATE.start_main_~_hj_j~0#1| 8192))) (and (= .cse0 (+ .cse1 |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (<= 4408680405129836981 (+ (* 1030789530 |c_ULTIMATE.start_main_~_ha_hashv~0#1|) (* |c_ULTIMATE.start_main_~_hj_j~0#1| 2061579059) (* (div (+ (* (- 4123158118) |c_ULTIMATE.start_main_~_hj_j~0#1|) 8817360810260198248 .cse1 (* (- 2061579059) |c_ULTIMATE.start_main_~_ha_hashv~0#1|) (* (- 1) .cse0)) 4294967296) 2147483648))))) is different from false [2025-02-06 08:50:11,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 08:50:11,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 08:50:11,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087457164] [2025-02-06 08:50:11,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087457164] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 08:50:11,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 08:50:11,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 08:50:11,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658913729] [2025-02-06 08:50:11,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 08:50:11,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 08:50:11,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 08:50:11,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 08:50:11,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=72, Unknown=1, NotChecked=16, Total=110 [2025-02-06 08:50:11,552 INFO L87 Difference]: Start difference. First operand 555 states and 753 transitions. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 08:50:13,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 08:50:17,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 08:50:21,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 08:50:23,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 08:50:27,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 08:50:31,943 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (div |c_ULTIMATE.start_main_~_hj_j~0#1| 8192)) (.cse3 (* (div |c_ULTIMATE.start_main_~_hj_j~0#1| 4294967296) 524288))) (let ((.cse0 (+ .cse3 |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (.cse6 (* 1030789530 |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (.cse7 (* |c_ULTIMATE.start_main_~_hj_j~0#1| 2061579059)) (.cse2 (* (- 4123158118) |c_ULTIMATE.start_main_~_hj_j~0#1|)) (.cse4 (* (- 2061579059) |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (.cse5 (* (- 1) .cse1))) (and (or (< .cse0 (+ .cse1 (mod |c_ULTIMATE.start_main_~_hj_i~0#1| 4294967296))) (< 4408680405129836980 (+ (* 1030789529 |c_ULTIMATE.start_main_~_hj_i~0#1|) (* 2147483648 (div (+ .cse2 8817360810260198248 (* (- 2061579059) |c_ULTIMATE.start_main_~_hj_i~0#1|) .cse3 .cse4 .cse5) 4294967296)) .cse6 .cse7 (* (div |c_ULTIMATE.start_main_~_hj_i~0#1| 4294967296) 2147483648)))) (= .cse1 .cse0) (<= 4408680405129836981 (+ .cse6 .cse7 (* (div (+ .cse2 8817360810260198248 .cse3 .cse4 .cse5) 4294967296) 2147483648)))))) is different from false [2025-02-06 08:50:33,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 08:50:39,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 08:50:40,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 08:50:44,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.85s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 08:50:45,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []