./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1d2a98d270a821b4275b6b35f502458543f3a892fcdda158c69925a18d34f6cf --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 20:59:18,571 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 20:59:18,632 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 20:59:18,637 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 20:59:18,637 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 20:59:18,662 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 20:59:18,663 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 20:59:18,663 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 20:59:18,663 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 20:59:18,663 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 20:59:18,663 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 20:59:18,663 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 20:59:18,664 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 20:59:18,664 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 20:59:18,664 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 20:59:18,664 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 20:59:18,664 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 20:59:18,664 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 20:59:18,664 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 20:59:18,664 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 20:59:18,664 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 20:59:18,664 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 20:59:18,664 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 20:59:18,664 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 20:59:18,664 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 20:59:18,664 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 20:59:18,664 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 20:59:18,664 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 20:59:18,664 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 20:59:18,664 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:59:18,664 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:59:18,664 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:59:18,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:59:18,665 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 20:59:18,665 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 20:59:18,665 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 20:59:18,665 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 20:59:18,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:59:18,665 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 20:59:18,665 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 20:59:18,665 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 20:59:18,665 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 20:59:18,665 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 20:59:18,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 20:59:18,665 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 20:59:18,665 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 20:59:18,665 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 20:59:18,665 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 20:59:18,665 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 -> 1d2a98d270a821b4275b6b35f502458543f3a892fcdda158c69925a18d34f6cf [2025-01-09 20:59:18,890 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 20:59:18,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 20:59:18,905 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 20:59:18,906 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 20:59:18,906 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 20:59:18,908 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_SFH_test6-2.i [2025-01-09 20:59:20,089 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/13ab990af/687251788eaa418893c0aaa441a90d8c/FLAG7ce8ae46c [2025-01-09 20:59:20,440 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 20:59:20,440 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-2.i [2025-01-09 20:59:20,460 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/13ab990af/687251788eaa418893c0aaa441a90d8c/FLAG7ce8ae46c [2025-01-09 20:59:20,475 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/13ab990af/687251788eaa418893c0aaa441a90d8c [2025-01-09 20:59:20,477 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 20:59:20,478 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 20:59:20,478 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 20:59:20,479 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 20:59:20,481 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 20:59:20,482 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:59:20" (1/1) ... [2025-01-09 20:59:20,482 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@412363d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:20, skipping insertion in model container [2025-01-09 20:59:20,482 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:59:20" (1/1) ... [2025-01-09 20:59:20,515 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 20:59:20,829 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_SFH_test6-2.i[44118,44131] [2025-01-09 20:59:20,837 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_SFH_test6-2.i[44660,44673] [2025-01-09 20:59:20,927 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_SFH_test6-2.i[56247,56260] [2025-01-09 20:59:20,931 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_SFH_test6-2.i[56368,56381] [2025-01-09 20:59:20,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:59:20,965 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 20:59:20,997 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_SFH_test6-2.i[44118,44131] [2025-01-09 20:59:21,000 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_SFH_test6-2.i[44660,44673] [2025-01-09 20:59:21,041 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_SFH_test6-2.i[56247,56260] [2025-01-09 20:59:21,041 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_SFH_test6-2.i[56368,56381] [2025-01-09 20:59:21,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 20:59:21,089 INFO L204 MainTranslator]: Completed translation [2025-01-09 20:59:21,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:21 WrapperNode [2025-01-09 20:59:21,091 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 20:59:21,092 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 20:59:21,092 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 20:59:21,093 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 20:59:21,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:21" (1/1) ... [2025-01-09 20:59:21,129 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:21" (1/1) ... [2025-01-09 20:59:21,187 INFO L138 Inliner]: procedures = 282, calls = 349, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1595 [2025-01-09 20:59:21,188 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 20:59:21,188 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 20:59:21,188 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 20:59:21,188 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 20:59:21,195 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:21" (1/1) ... [2025-01-09 20:59:21,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:21" (1/1) ... [2025-01-09 20:59:21,209 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:21" (1/1) ... [2025-01-09 20:59:21,289 INFO L175 MemorySlicer]: Split 318 memory accesses to 4 slices as follows [2, 12, 34, 270]. 85 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10, 0, 0]. The 62 writes are split as follows [0, 1, 4, 57]. [2025-01-09 20:59:21,290 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:21" (1/1) ... [2025-01-09 20:59:21,292 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:21" (1/1) ... [2025-01-09 20:59:21,346 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:21" (1/1) ... [2025-01-09 20:59:21,348 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:21" (1/1) ... [2025-01-09 20:59:21,354 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:21" (1/1) ... [2025-01-09 20:59:21,357 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:21" (1/1) ... [2025-01-09 20:59:21,359 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:21" (1/1) ... [2025-01-09 20:59:21,366 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 20:59:21,366 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 20:59:21,366 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 20:59:21,366 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 20:59:21,367 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:21" (1/1) ... [2025-01-09 20:59:21,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 20:59:21,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 20:59:21,393 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 20:59:21,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 20:59:21,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 20:59:21,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 20:59:21,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 20:59:21,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 20:59:21,414 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 20:59:21,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 20:59:21,414 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2025-01-09 20:59:21,415 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2025-01-09 20:59:21,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 20:59:21,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 20:59:21,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 20:59:21,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 20:59:21,416 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 20:59:21,416 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 20:59:21,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 20:59:21,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 20:59:21,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 20:59:21,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 20:59:21,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 20:59:21,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 20:59:21,418 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2025-01-09 20:59:21,418 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2025-01-09 20:59:21,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 20:59:21,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 20:59:21,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 20:59:21,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 20:59:21,418 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2025-01-09 20:59:21,418 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2025-01-09 20:59:21,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 20:59:21,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 20:59:21,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 20:59:21,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 20:59:21,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 20:59:21,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 20:59:21,627 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 20:59:21,628 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 20:59:22,913 INFO L? ?]: Removed 365 outVars from TransFormulas that were not future-live. [2025-01-09 20:59:22,913 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 20:59:22,924 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 20:59:22,924 INFO L312 CfgBuilder]: Removed 35 assume(true) statements. [2025-01-09 20:59:22,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:59:22 BoogieIcfgContainer [2025-01-09 20:59:22,925 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 20:59:22,926 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 20:59:22,926 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 20:59:22,929 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 20:59:22,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:59:20" (1/3) ... [2025-01-09 20:59:22,930 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5873f289 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:59:22, skipping insertion in model container [2025-01-09 20:59:22,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:59:21" (2/3) ... [2025-01-09 20:59:22,930 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5873f289 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:59:22, skipping insertion in model container [2025-01-09 20:59:22,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:59:22" (3/3) ... [2025-01-09 20:59:22,931 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test6-2.i [2025-01-09 20:59:22,940 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 20:59:22,941 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_test6-2.i that has 5 procedures, 470 locations, 1 initial locations, 41 loop locations, and 4 error locations. [2025-01-09 20:59:22,992 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 20:59:23,001 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;@59459475, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 20:59:23,002 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-09 20:59:23,005 INFO L276 IsEmpty]: Start isEmpty. Operand has 470 states, 446 states have (on average 1.5896860986547086) internal successors, (709), 450 states have internal predecessors, (709), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-01-09 20:59:23,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 20:59:23,009 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:23,009 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:59:23,009 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 20:59:23,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:23,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1883014248, now seen corresponding path program 1 times [2025-01-09 20:59:23,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:23,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002577701] [2025-01-09 20:59:23,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:23,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:23,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 20:59:23,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 20:59:23,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:23,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:23,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:59:23,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:23,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002577701] [2025-01-09 20:59:23,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002577701] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:23,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:23,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 20:59:23,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895621330] [2025-01-09 20:59:23,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:23,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 20:59:23,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:23,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 20:59:23,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 20:59:23,170 INFO L87 Difference]: Start difference. First operand has 470 states, 446 states have (on average 1.5896860986547086) internal successors, (709), 450 states have internal predecessors, (709), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) 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-01-09 20:59:23,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:23,221 INFO L93 Difference]: Finished difference Result 936 states and 1489 transitions. [2025-01-09 20:59:23,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 20:59:23,223 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-01-09 20:59:23,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:23,229 INFO L225 Difference]: With dead ends: 936 [2025-01-09 20:59:23,230 INFO L226 Difference]: Without dead ends: 465 [2025-01-09 20:59:23,233 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-01-09 20:59:23,234 INFO L435 NwaCegarLoop]: 664 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:23,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:59:23,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-01-09 20:59:23,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 465. [2025-01-09 20:59:23,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 442 states have (on average 1.4276018099547512) internal successors, (631), 446 states have internal predecessors, (631), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 20:59:23,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 661 transitions. [2025-01-09 20:59:23,301 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 661 transitions. Word has length 8 [2025-01-09 20:59:23,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:23,301 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 661 transitions. [2025-01-09 20:59:23,301 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-01-09 20:59:23,301 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 661 transitions. [2025-01-09 20:59:23,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-09 20:59:23,301 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:23,301 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 20:59:23,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 20:59:23,302 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 20:59:23,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:23,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1883663023, now seen corresponding path program 1 times [2025-01-09 20:59:23,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:23,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125535356] [2025-01-09 20:59:23,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:23,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:23,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 20:59:23,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 20:59:23,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:23,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:23,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:59:23,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:23,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125535356] [2025-01-09 20:59:23,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125535356] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:23,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:23,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:59:23,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946465440] [2025-01-09 20:59:23,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:23,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:59:23,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:23,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:59:23,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:59:23,516 INFO L87 Difference]: Start difference. First operand 465 states and 661 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-01-09 20:59:23,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:23,672 INFO L93 Difference]: Finished difference Result 1152 states and 1648 transitions. [2025-01-09 20:59:23,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:59:23,673 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-01-09 20:59:23,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:23,677 INFO L225 Difference]: With dead ends: 1152 [2025-01-09 20:59:23,677 INFO L226 Difference]: Without dead ends: 903 [2025-01-09 20:59:23,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:59:23,679 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 604 mSDsluCounter, 1320 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 2014 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:23,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 2014 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:59:23,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2025-01-09 20:59:23,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 467. [2025-01-09 20:59:23,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 444 states have (on average 1.4256756756756757) internal successors, (633), 448 states have internal predecessors, (633), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 20:59:23,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 663 transitions. [2025-01-09 20:59:23,700 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 663 transitions. Word has length 10 [2025-01-09 20:59:23,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:23,700 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 663 transitions. [2025-01-09 20:59:23,700 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-01-09 20:59:23,700 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 663 transitions. [2025-01-09 20:59:23,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 20:59:23,701 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:23,702 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-01-09 20:59:23,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 20:59:23,702 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-01-09 20:59:23,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:23,702 INFO L85 PathProgramCache]: Analyzing trace with hash -546527626, now seen corresponding path program 1 times [2025-01-09 20:59:23,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:23,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280698554] [2025-01-09 20:59:23,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:23,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:23,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 20:59:23,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 20:59:23,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:23,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:23,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:59:23,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:23,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280698554] [2025-01-09 20:59:23,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280698554] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:23,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:23,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:59:23,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969113776] [2025-01-09 20:59:23,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:23,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:59:23,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:23,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:59:23,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:59:23,994 INFO L87 Difference]: Start difference. First operand 467 states and 663 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-01-09 20:59:24,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:24,087 INFO L93 Difference]: Finished difference Result 888 states and 1256 transitions. [2025-01-09 20:59:24,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 20:59:24,090 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-01-09 20:59:24,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:24,092 INFO L225 Difference]: With dead ends: 888 [2025-01-09 20:59:24,093 INFO L226 Difference]: Without dead ends: 425 [2025-01-09 20:59:24,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 20:59:24,094 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 30 mSDsluCounter, 1101 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1661 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:24,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1661 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:59:24,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-01-09 20:59:24,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2025-01-09 20:59:24,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 402 states have (on average 1.3830845771144278) internal successors, (556), 406 states have internal predecessors, (556), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 20:59:24,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 586 transitions. [2025-01-09 20:59:24,109 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 586 transitions. Word has length 66 [2025-01-09 20:59:24,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:24,109 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 586 transitions. [2025-01-09 20:59:24,109 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-01-09 20:59:24,109 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 586 transitions. [2025-01-09 20:59:24,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 20:59:24,110 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:24,110 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-01-09 20:59:24,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 20:59:24,111 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-01-09 20:59:24,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:24,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1513782506, now seen corresponding path program 1 times [2025-01-09 20:59:24,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:24,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293414011] [2025-01-09 20:59:24,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:24,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:24,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 20:59:24,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 20:59:24,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:24,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:24,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:59:24,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:24,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293414011] [2025-01-09 20:59:24,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293414011] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:24,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:24,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 20:59:24,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814396975] [2025-01-09 20:59:24,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:24,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 20:59:24,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:24,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 20:59:24,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:59:24,310 INFO L87 Difference]: Start difference. First operand 425 states and 586 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-01-09 20:59:24,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:24,352 INFO L93 Difference]: Finished difference Result 846 states and 1168 transitions. [2025-01-09 20:59:24,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 20:59:24,353 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-01-09 20:59:24,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:24,354 INFO L225 Difference]: With dead ends: 846 [2025-01-09 20:59:24,355 INFO L226 Difference]: Without dead ends: 425 [2025-01-09 20:59:24,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 20:59:24,356 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 0 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:24,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1122 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 20:59:24,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-01-09 20:59:24,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2025-01-09 20:59:24,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 402 states have (on average 1.3756218905472637) internal successors, (553), 406 states have internal predecessors, (553), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 20:59:24,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 583 transitions. [2025-01-09 20:59:24,375 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 583 transitions. Word has length 66 [2025-01-09 20:59:24,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:24,376 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 583 transitions. [2025-01-09 20:59:24,376 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-01-09 20:59:24,376 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 583 transitions. [2025-01-09 20:59:24,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 20:59:24,378 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:24,378 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-01-09 20:59:24,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 20:59:24,379 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-01-09 20:59:24,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:24,379 INFO L85 PathProgramCache]: Analyzing trace with hash -537201492, now seen corresponding path program 1 times [2025-01-09 20:59:24,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:24,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312665213] [2025-01-09 20:59:24,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:24,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:24,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 20:59:24,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 20:59:24,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:24,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:24,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:59:24,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:24,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312665213] [2025-01-09 20:59:24,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312665213] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:24,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:24,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 20:59:24,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839427175] [2025-01-09 20:59:24,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:24,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 20:59:24,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:24,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 20:59:24,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:59:24,679 INFO L87 Difference]: Start difference. First operand 425 states and 583 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-01-09 20:59:24,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:24,949 INFO L93 Difference]: Finished difference Result 851 states and 1170 transitions. [2025-01-09 20:59:24,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 20:59:24,952 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-01-09 20:59:24,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:24,954 INFO L225 Difference]: With dead ends: 851 [2025-01-09 20:59:24,954 INFO L226 Difference]: Without dead ends: 430 [2025-01-09 20:59:24,954 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-01-09 20:59:24,955 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 14 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2519 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:24,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2519 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:59:24,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2025-01-09 20:59:24,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 427. [2025-01-09 20:59:24,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 404 states have (on average 1.3737623762376239) internal successors, (555), 408 states have internal predecessors, (555), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 20:59:24,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 585 transitions. [2025-01-09 20:59:24,963 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 585 transitions. Word has length 66 [2025-01-09 20:59:24,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:24,964 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 585 transitions. [2025-01-09 20:59:24,964 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-01-09 20:59:24,964 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 585 transitions. [2025-01-09 20:59:24,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 20:59:24,965 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:24,965 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-01-09 20:59:24,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 20:59:24,965 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-01-09 20:59:24,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:24,966 INFO L85 PathProgramCache]: Analyzing trace with hash 2064890107, now seen corresponding path program 1 times [2025-01-09 20:59:24,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:24,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380362590] [2025-01-09 20:59:24,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:24,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:24,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 20:59:25,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 20:59:25,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:25,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:25,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:59:25,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:25,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380362590] [2025-01-09 20:59:25,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380362590] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:25,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:25,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 20:59:25,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769609458] [2025-01-09 20:59:25,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:25,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:59:25,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:25,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:59:25,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:59:25,198 INFO L87 Difference]: Start difference. First operand 427 states and 585 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-01-09 20:59:25,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:25,460 INFO L93 Difference]: Finished difference Result 855 states and 1174 transitions. [2025-01-09 20:59:25,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 20:59:25,461 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-01-09 20:59:25,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:25,462 INFO L225 Difference]: With dead ends: 855 [2025-01-09 20:59:25,462 INFO L226 Difference]: Without dead ends: 432 [2025-01-09 20:59:25,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:59:25,464 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 15 mSDsluCounter, 2466 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 3023 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:25,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 3023 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:59:25,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2025-01-09 20:59:25,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 431. [2025-01-09 20:59:25,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 408 states have (on average 1.3725490196078431) internal successors, (560), 412 states have internal predecessors, (560), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 20:59:25,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 590 transitions. [2025-01-09 20:59:25,481 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 590 transitions. Word has length 67 [2025-01-09 20:59:25,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:25,481 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 590 transitions. [2025-01-09 20:59:25,481 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-01-09 20:59:25,481 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 590 transitions. [2025-01-09 20:59:25,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-01-09 20:59:25,482 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:25,482 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-01-09 20:59:25,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 20:59:25,482 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-01-09 20:59:25,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:25,483 INFO L85 PathProgramCache]: Analyzing trace with hash -395471473, now seen corresponding path program 1 times [2025-01-09 20:59:25,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:25,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9729751] [2025-01-09 20:59:25,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:25,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:25,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 20:59:25,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 20:59:25,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:25,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:25,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:59:25,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:25,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9729751] [2025-01-09 20:59:25,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9729751] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:25,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:25,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 20:59:25,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062223772] [2025-01-09 20:59:25,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:25,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 20:59:25,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:25,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 20:59:25,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 20:59:25,697 INFO L87 Difference]: Start difference. First operand 431 states and 590 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-01-09 20:59:25,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:25,788 INFO L93 Difference]: Finished difference Result 858 states and 1176 transitions. [2025-01-09 20:59:25,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 20:59:25,789 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-01-09 20:59:25,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:25,791 INFO L225 Difference]: With dead ends: 858 [2025-01-09 20:59:25,791 INFO L226 Difference]: Without dead ends: 431 [2025-01-09 20:59:25,792 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-01-09 20:59:25,793 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 17 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1576 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:25,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1576 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 20:59:25,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2025-01-09 20:59:25,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2025-01-09 20:59:25,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 408 states have (on average 1.3700980392156863) internal successors, (559), 412 states have internal predecessors, (559), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 20:59:25,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 589 transitions. [2025-01-09 20:59:25,807 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 589 transitions. Word has length 67 [2025-01-09 20:59:25,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:25,807 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 589 transitions. [2025-01-09 20:59:25,807 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-01-09 20:59:25,807 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 589 transitions. [2025-01-09 20:59:25,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 20:59:25,808 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:25,808 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-01-09 20:59:25,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 20:59:25,808 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-01-09 20:59:25,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:25,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1316778760, now seen corresponding path program 1 times [2025-01-09 20:59:25,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:25,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807488859] [2025-01-09 20:59:25,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:25,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:25,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 20:59:25,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 20:59:25,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:25,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:26,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:59:26,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:26,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807488859] [2025-01-09 20:59:26,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807488859] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:26,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:26,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 20:59:26,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898666756] [2025-01-09 20:59:26,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:26,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 20:59:26,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:26,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 20:59:26,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:59:26,151 INFO L87 Difference]: Start difference. First operand 431 states and 589 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-01-09 20:59:26,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:26,539 INFO L93 Difference]: Finished difference Result 871 states and 1195 transitions. [2025-01-09 20:59:26,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 20:59:26,540 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-01-09 20:59:26,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:26,542 INFO L225 Difference]: With dead ends: 871 [2025-01-09 20:59:26,542 INFO L226 Difference]: Without dead ends: 444 [2025-01-09 20:59:26,543 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-01-09 20:59:26,543 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 33 mSDsluCounter, 3521 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 4079 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:26,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 4079 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:59:26,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-01-09 20:59:26,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 441. [2025-01-09 20:59:26,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 418 states have (on average 1.3708133971291867) internal successors, (573), 422 states have internal predecessors, (573), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 20:59:26,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 603 transitions. [2025-01-09 20:59:26,557 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 603 transitions. Word has length 68 [2025-01-09 20:59:26,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:26,557 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 603 transitions. [2025-01-09 20:59:26,557 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-01-09 20:59:26,558 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 603 transitions. [2025-01-09 20:59:26,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 20:59:26,558 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:26,558 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-01-09 20:59:26,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 20:59:26,558 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-01-09 20:59:26,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:26,559 INFO L85 PathProgramCache]: Analyzing trace with hash 295892241, now seen corresponding path program 1 times [2025-01-09 20:59:26,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:26,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206650176] [2025-01-09 20:59:26,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:26,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:26,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 20:59:26,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 20:59:26,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:26,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:26,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:59:26,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:26,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206650176] [2025-01-09 20:59:26,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206650176] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:26,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:26,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 20:59:26,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321536910] [2025-01-09 20:59:26,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:26,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 20:59:26,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:26,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 20:59:26,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 20:59:26,890 INFO L87 Difference]: Start difference. First operand 441 states and 603 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-01-09 20:59:27,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:27,221 INFO L93 Difference]: Finished difference Result 881 states and 1207 transitions. [2025-01-09 20:59:27,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 20:59:27,222 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-01-09 20:59:27,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:27,223 INFO L225 Difference]: With dead ends: 881 [2025-01-09 20:59:27,223 INFO L226 Difference]: Without dead ends: 444 [2025-01-09 20:59:27,224 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-01-09 20:59:27,225 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 27 mSDsluCounter, 3009 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 3571 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:27,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 3571 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:59:27,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-01-09 20:59:27,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 444. [2025-01-09 20:59:27,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 421 states have (on average 1.368171021377672) internal successors, (576), 425 states have internal predecessors, (576), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 20:59:27,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 606 transitions. [2025-01-09 20:59:27,234 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 606 transitions. Word has length 68 [2025-01-09 20:59:27,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:27,234 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 606 transitions. [2025-01-09 20:59:27,234 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-01-09 20:59:27,234 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 606 transitions. [2025-01-09 20:59:27,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-01-09 20:59:27,235 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:27,235 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-01-09 20:59:27,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 20:59:27,235 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-01-09 20:59:27,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:27,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1457191505, now seen corresponding path program 1 times [2025-01-09 20:59:27,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:27,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493502473] [2025-01-09 20:59:27,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:27,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:27,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 20:59:27,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 20:59:27,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:27,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:27,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:59:27,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:27,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493502473] [2025-01-09 20:59:27,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493502473] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:27,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:27,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 20:59:27,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366971935] [2025-01-09 20:59:27,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:27,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 20:59:27,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:27,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 20:59:27,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 20:59:27,377 INFO L87 Difference]: Start difference. First operand 444 states and 606 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-01-09 20:59:27,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:27,562 INFO L93 Difference]: Finished difference Result 887 states and 1213 transitions. [2025-01-09 20:59:27,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 20:59:27,563 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-01-09 20:59:27,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:27,565 INFO L225 Difference]: With dead ends: 887 [2025-01-09 20:59:27,565 INFO L226 Difference]: Without dead ends: 447 [2025-01-09 20:59:27,566 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-01-09 20:59:27,566 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 8 mSDsluCounter, 1973 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2541 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:27,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2541 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:59:27,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2025-01-09 20:59:27,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 447. [2025-01-09 20:59:27,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 424 states have (on average 1.365566037735849) internal successors, (579), 428 states have internal predecessors, (579), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 20:59:27,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 609 transitions. [2025-01-09 20:59:27,576 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 609 transitions. Word has length 68 [2025-01-09 20:59:27,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:27,576 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 609 transitions. [2025-01-09 20:59:27,576 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-01-09 20:59:27,576 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 609 transitions. [2025-01-09 20:59:27,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 20:59:27,577 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:27,577 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-01-09 20:59:27,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 20:59:27,577 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-01-09 20:59:27,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:27,577 INFO L85 PathProgramCache]: Analyzing trace with hash -924128962, now seen corresponding path program 1 times [2025-01-09 20:59:27,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:27,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370877722] [2025-01-09 20:59:27,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:27,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:27,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 20:59:27,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 20:59:27,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:27,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:28,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:59:28,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:28,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370877722] [2025-01-09 20:59:28,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370877722] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:28,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:28,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 20:59:28,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778414104] [2025-01-09 20:59:28,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:28,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 20:59:28,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:28,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 20:59:28,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:59:28,016 INFO L87 Difference]: Start difference. First operand 447 states and 609 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-01-09 20:59:28,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:28,855 INFO L93 Difference]: Finished difference Result 1295 states and 1777 transitions. [2025-01-09 20:59:28,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 20:59:28,856 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-01-09 20:59:28,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:28,859 INFO L225 Difference]: With dead ends: 1295 [2025-01-09 20:59:28,859 INFO L226 Difference]: Without dead ends: 852 [2025-01-09 20:59:28,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-01-09 20:59:28,861 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 675 mSDsluCounter, 3537 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 4145 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:28,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [687 Valid, 4145 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 928 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 20:59:28,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2025-01-09 20:59:28,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 485. [2025-01-09 20:59:28,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 462 states have (on average 1.3376623376623376) internal successors, (618), 466 states have internal predecessors, (618), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 20:59:28,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 648 transitions. [2025-01-09 20:59:28,874 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 648 transitions. Word has length 69 [2025-01-09 20:59:28,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:28,874 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 648 transitions. [2025-01-09 20:59:28,874 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-01-09 20:59:28,874 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 648 transitions. [2025-01-09 20:59:28,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-01-09 20:59:28,875 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:28,875 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-01-09 20:59:28,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 20:59:28,875 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-01-09 20:59:28,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:28,876 INFO L85 PathProgramCache]: Analyzing trace with hash -187398510, now seen corresponding path program 1 times [2025-01-09 20:59:28,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:28,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066579763] [2025-01-09 20:59:28,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:28,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:28,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 20:59:28,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 20:59:28,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:28,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:29,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:59:29,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:29,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066579763] [2025-01-09 20:59:29,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066579763] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:29,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:29,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 20:59:29,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709468438] [2025-01-09 20:59:29,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:29,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:59:29,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:29,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:59:29,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:59:29,058 INFO L87 Difference]: Start difference. First operand 485 states and 648 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-01-09 20:59:29,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:29,314 INFO L93 Difference]: Finished difference Result 933 states and 1261 transitions. [2025-01-09 20:59:29,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 20:59:29,315 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-01-09 20:59:29,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:29,317 INFO L225 Difference]: With dead ends: 933 [2025-01-09 20:59:29,317 INFO L226 Difference]: Without dead ends: 490 [2025-01-09 20:59:29,318 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-01-09 20:59:29,318 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 12 mSDsluCounter, 2467 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 3030 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:29,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 3030 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:59:29,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-01-09 20:59:29,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 485. [2025-01-09 20:59:29,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 462 states have (on average 1.3376623376623376) internal successors, (618), 466 states have internal predecessors, (618), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 20:59:29,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 648 transitions. [2025-01-09 20:59:29,328 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 648 transitions. Word has length 69 [2025-01-09 20:59:29,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:29,329 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 648 transitions. [2025-01-09 20:59:29,329 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-01-09 20:59:29,329 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 648 transitions. [2025-01-09 20:59:29,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 20:59:29,329 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:29,329 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-01-09 20:59:29,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 20:59:29,330 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-01-09 20:59:29,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:29,330 INFO L85 PathProgramCache]: Analyzing trace with hash -260522659, now seen corresponding path program 1 times [2025-01-09 20:59:29,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:29,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718125007] [2025-01-09 20:59:29,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:29,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:29,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 20:59:29,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 20:59:29,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:29,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:29,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:59:29,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:29,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718125007] [2025-01-09 20:59:29,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718125007] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:29,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:29,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 20:59:29,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362800533] [2025-01-09 20:59:29,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:29,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 20:59:29,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:29,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 20:59:29,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:59:29,501 INFO L87 Difference]: Start difference. First operand 485 states and 648 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-01-09 20:59:29,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:29,737 INFO L93 Difference]: Finished difference Result 938 states and 1267 transitions. [2025-01-09 20:59:29,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 20:59:29,738 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-01-09 20:59:29,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:29,740 INFO L225 Difference]: With dead ends: 938 [2025-01-09 20:59:29,740 INFO L226 Difference]: Without dead ends: 495 [2025-01-09 20:59:29,741 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-01-09 20:59:29,741 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 20 mSDsluCounter, 3054 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 3611 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:29,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 3611 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:59:29,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-01-09 20:59:29,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 488. [2025-01-09 20:59:29,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 465 states have (on average 1.3376344086021505) internal successors, (622), 469 states have internal predecessors, (622), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 20:59:29,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 652 transitions. [2025-01-09 20:59:29,752 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 652 transitions. Word has length 70 [2025-01-09 20:59:29,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:29,753 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 652 transitions. [2025-01-09 20:59:29,753 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-01-09 20:59:29,753 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 652 transitions. [2025-01-09 20:59:29,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-01-09 20:59:29,753 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:29,753 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-01-09 20:59:29,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 20:59:29,754 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-01-09 20:59:29,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:29,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1876718145, now seen corresponding path program 1 times [2025-01-09 20:59:29,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:29,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046054667] [2025-01-09 20:59:29,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:29,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:29,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 20:59:29,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 20:59:29,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:29,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:29,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:59:29,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:29,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046054667] [2025-01-09 20:59:29,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046054667] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:29,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:29,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 20:59:29,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913552277] [2025-01-09 20:59:29,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:29,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 20:59:29,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:29,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 20:59:29,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:59:29,962 INFO L87 Difference]: Start difference. First operand 488 states and 652 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-01-09 20:59:30,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:30,329 INFO L93 Difference]: Finished difference Result 948 states and 1279 transitions. [2025-01-09 20:59:30,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 20:59:30,330 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-01-09 20:59:30,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:30,332 INFO L225 Difference]: With dead ends: 948 [2025-01-09 20:59:30,332 INFO L226 Difference]: Without dead ends: 502 [2025-01-09 20:59:30,333 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-01-09 20:59:30,333 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 37 mSDsluCounter, 3469 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 4035 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:30,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 4035 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:59:30,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2025-01-09 20:59:30,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 488. [2025-01-09 20:59:30,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 465 states have (on average 1.3376344086021505) internal successors, (622), 469 states have internal predecessors, (622), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 20:59:30,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 652 transitions. [2025-01-09 20:59:30,347 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 652 transitions. Word has length 70 [2025-01-09 20:59:30,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:30,347 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 652 transitions. [2025-01-09 20:59:30,347 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-01-09 20:59:30,348 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 652 transitions. [2025-01-09 20:59:30,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 20:59:30,348 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:30,348 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-01-09 20:59:30,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 20:59:30,349 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-01-09 20:59:30,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:30,349 INFO L85 PathProgramCache]: Analyzing trace with hash -495464894, now seen corresponding path program 1 times [2025-01-09 20:59:30,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:30,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888390397] [2025-01-09 20:59:30,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:30,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:30,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 20:59:30,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 20:59:30,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:30,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:30,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:59:30,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:30,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888390397] [2025-01-09 20:59:30,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888390397] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:30,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:30,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 20:59:30,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682185623] [2025-01-09 20:59:30,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:30,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 20:59:30,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:30,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 20:59:30,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 20:59:30,587 INFO L87 Difference]: Start difference. First operand 488 states and 652 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-01-09 20:59:30,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:30,923 INFO L93 Difference]: Finished difference Result 950 states and 1284 transitions. [2025-01-09 20:59:30,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 20:59:30,924 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-01-09 20:59:30,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:30,926 INFO L225 Difference]: With dead ends: 950 [2025-01-09 20:59:30,926 INFO L226 Difference]: Without dead ends: 504 [2025-01-09 20:59:30,927 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-01-09 20:59:30,928 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 23 mSDsluCounter, 3535 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 4099 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:30,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 4099 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:59:30,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2025-01-09 20:59:30,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 498. [2025-01-09 20:59:30,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 475 states have (on average 1.3347368421052632) internal successors, (634), 479 states have internal predecessors, (634), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 20:59:30,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 664 transitions. [2025-01-09 20:59:30,941 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 664 transitions. Word has length 71 [2025-01-09 20:59:30,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:30,941 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 664 transitions. [2025-01-09 20:59:30,941 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-01-09 20:59:30,941 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 664 transitions. [2025-01-09 20:59:30,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 20:59:30,942 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:30,942 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-01-09 20:59:30,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 20:59:30,942 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-01-09 20:59:30,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:30,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1334490590, now seen corresponding path program 1 times [2025-01-09 20:59:30,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:30,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430458746] [2025-01-09 20:59:30,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:30,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:30,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 20:59:30,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 20:59:30,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:30,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:31,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:59:31,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:31,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430458746] [2025-01-09 20:59:31,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430458746] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:31,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:31,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 20:59:31,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591624835] [2025-01-09 20:59:31,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:31,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 20:59:31,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:31,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 20:59:31,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 20:59:31,159 INFO L87 Difference]: Start difference. First operand 498 states and 664 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-01-09 20:59:31,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:31,508 INFO L93 Difference]: Finished difference Result 970 states and 1308 transitions. [2025-01-09 20:59:31,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 20:59:31,508 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-01-09 20:59:31,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:31,510 INFO L225 Difference]: With dead ends: 970 [2025-01-09 20:59:31,510 INFO L226 Difference]: Without dead ends: 514 [2025-01-09 20:59:31,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 20:59:31,511 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 17 mSDsluCounter, 3997 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4547 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:31,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4547 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:59:31,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-01-09 20:59:31,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 501. [2025-01-09 20:59:31,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 478 states have (on average 1.3347280334728033) internal successors, (638), 482 states have internal predecessors, (638), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 20:59:31,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 668 transitions. [2025-01-09 20:59:31,523 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 668 transitions. Word has length 71 [2025-01-09 20:59:31,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:31,523 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 668 transitions. [2025-01-09 20:59:31,523 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-01-09 20:59:31,523 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 668 transitions. [2025-01-09 20:59:31,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 20:59:31,525 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:31,525 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-01-09 20:59:31,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 20:59:31,525 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-01-09 20:59:31,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:31,525 INFO L85 PathProgramCache]: Analyzing trace with hash -163562146, now seen corresponding path program 1 times [2025-01-09 20:59:31,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:31,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040911328] [2025-01-09 20:59:31,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:31,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:31,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 20:59:31,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 20:59:31,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:31,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:31,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:59:31,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:31,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040911328] [2025-01-09 20:59:31,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040911328] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:31,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:31,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 20:59:31,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560677596] [2025-01-09 20:59:31,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:31,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:59:31,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:31,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:59:31,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:59:31,763 INFO L87 Difference]: Start difference. First operand 501 states and 668 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-01-09 20:59:31,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:31,985 INFO L93 Difference]: Finished difference Result 965 states and 1298 transitions. [2025-01-09 20:59:31,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 20:59:31,985 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-01-09 20:59:31,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:31,987 INFO L225 Difference]: With dead ends: 965 [2025-01-09 20:59:31,987 INFO L226 Difference]: Without dead ends: 506 [2025-01-09 20:59:31,988 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-01-09 20:59:31,988 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 11 mSDsluCounter, 2495 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 3053 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:31,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 3053 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:59:31,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-01-09 20:59:31,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 501. [2025-01-09 20:59:31,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 478 states have (on average 1.3326359832635983) internal successors, (637), 482 states have internal predecessors, (637), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 20:59:31,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 667 transitions. [2025-01-09 20:59:31,999 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 667 transitions. Word has length 71 [2025-01-09 20:59:31,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:31,999 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 667 transitions. [2025-01-09 20:59:31,999 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-01-09 20:59:31,999 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 667 transitions. [2025-01-09 20:59:32,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-09 20:59:32,000 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:32,000 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-01-09 20:59:32,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 20:59:32,000 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-01-09 20:59:32,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:32,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1449108855, now seen corresponding path program 1 times [2025-01-09 20:59:32,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:32,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882566507] [2025-01-09 20:59:32,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:32,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:32,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 20:59:32,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 20:59:32,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:32,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:32,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:59:32,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:32,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882566507] [2025-01-09 20:59:32,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882566507] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:32,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:32,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 20:59:32,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803410682] [2025-01-09 20:59:32,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:32,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 20:59:32,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:32,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 20:59:32,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 20:59:32,147 INFO L87 Difference]: Start difference. First operand 501 states and 667 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-01-09 20:59:32,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:32,411 INFO L93 Difference]: Finished difference Result 963 states and 1296 transitions. [2025-01-09 20:59:32,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 20:59:32,411 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-01-09 20:59:32,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:32,413 INFO L225 Difference]: With dead ends: 963 [2025-01-09 20:59:32,414 INFO L226 Difference]: Without dead ends: 504 [2025-01-09 20:59:32,414 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-01-09 20:59:32,415 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 8 mSDsluCounter, 2450 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3012 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:32,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3012 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 20:59:32,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2025-01-09 20:59:32,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2025-01-09 20:59:32,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 481 states have (on average 1.3305613305613306) internal successors, (640), 485 states have internal predecessors, (640), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 20:59:32,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 670 transitions. [2025-01-09 20:59:32,429 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 670 transitions. Word has length 71 [2025-01-09 20:59:32,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:32,429 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 670 transitions. [2025-01-09 20:59:32,429 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-01-09 20:59:32,429 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 670 transitions. [2025-01-09 20:59:32,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 20:59:32,430 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:32,430 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-01-09 20:59:32,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 20:59:32,430 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-01-09 20:59:32,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:32,431 INFO L85 PathProgramCache]: Analyzing trace with hash 2011256672, now seen corresponding path program 1 times [2025-01-09 20:59:32,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:32,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123594337] [2025-01-09 20:59:32,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:32,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:32,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 20:59:32,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 20:59:32,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:32,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:32,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:59:32,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:32,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123594337] [2025-01-09 20:59:32,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123594337] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:32,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:32,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 20:59:32,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53276064] [2025-01-09 20:59:32,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:32,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 20:59:32,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:32,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 20:59:32,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 20:59:32,746 INFO L87 Difference]: Start difference. First operand 504 states and 670 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-01-09 20:59:33,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:33,105 INFO L93 Difference]: Finished difference Result 978 states and 1315 transitions. [2025-01-09 20:59:33,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 20:59:33,105 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-01-09 20:59:33,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:33,107 INFO L225 Difference]: With dead ends: 978 [2025-01-09 20:59:33,107 INFO L226 Difference]: Without dead ends: 516 [2025-01-09 20:59:33,108 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-01-09 20:59:33,108 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 13 mSDsluCounter, 3498 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4059 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:33,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4059 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:59:33,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-01-09 20:59:33,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 508. [2025-01-09 20:59:33,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 485 states have (on average 1.3298969072164948) internal successors, (645), 489 states have internal predecessors, (645), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 20:59:33,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 675 transitions. [2025-01-09 20:59:33,120 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 675 transitions. Word has length 72 [2025-01-09 20:59:33,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:33,120 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 675 transitions. [2025-01-09 20:59:33,121 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-01-09 20:59:33,121 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 675 transitions. [2025-01-09 20:59:33,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 20:59:33,121 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:33,121 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-01-09 20:59:33,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 20:59:33,121 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-01-09 20:59:33,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:33,122 INFO L85 PathProgramCache]: Analyzing trace with hash -355136947, now seen corresponding path program 1 times [2025-01-09 20:59:33,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:33,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184418814] [2025-01-09 20:59:33,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:33,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:33,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 20:59:33,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 20:59:33,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:33,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:33,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:59:33,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:33,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184418814] [2025-01-09 20:59:33,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184418814] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:33,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:33,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 20:59:33,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682326798] [2025-01-09 20:59:33,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:33,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 20:59:33,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:33,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 20:59:33,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-01-09 20:59:33,346 INFO L87 Difference]: Start difference. First operand 508 states and 675 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-01-09 20:59:33,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:33,706 INFO L93 Difference]: Finished difference Result 987 states and 1325 transitions. [2025-01-09 20:59:33,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 20:59:33,706 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-01-09 20:59:33,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:33,708 INFO L225 Difference]: With dead ends: 987 [2025-01-09 20:59:33,708 INFO L226 Difference]: Without dead ends: 521 [2025-01-09 20:59:33,709 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-01-09 20:59:33,711 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 40 mSDsluCounter, 4019 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 4577 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:33,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 4577 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:59:33,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-01-09 20:59:33,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 511. [2025-01-09 20:59:33,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 488 states have (on average 1.3278688524590163) internal successors, (648), 492 states have internal predecessors, (648), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 20:59:33,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 678 transitions. [2025-01-09 20:59:33,728 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 678 transitions. Word has length 72 [2025-01-09 20:59:33,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:33,728 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 678 transitions. [2025-01-09 20:59:33,729 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-01-09 20:59:33,729 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 678 transitions. [2025-01-09 20:59:33,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 20:59:33,729 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:33,729 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-01-09 20:59:33,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 20:59:33,729 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-01-09 20:59:33,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:33,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1389665468, now seen corresponding path program 1 times [2025-01-09 20:59:33,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:33,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824255701] [2025-01-09 20:59:33,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:33,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:33,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 20:59:33,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 20:59:33,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:33,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:34,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:59:34,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:34,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824255701] [2025-01-09 20:59:34,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824255701] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:34,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:34,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 20:59:34,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637315114] [2025-01-09 20:59:34,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:34,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 20:59:34,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:34,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 20:59:34,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 20:59:34,088 INFO L87 Difference]: Start difference. First operand 511 states and 678 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-01-09 20:59:35,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:35,056 INFO L93 Difference]: Finished difference Result 990 states and 1325 transitions. [2025-01-09 20:59:35,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 20:59:35,056 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-01-09 20:59:35,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:35,059 INFO L225 Difference]: With dead ends: 990 [2025-01-09 20:59:35,059 INFO L226 Difference]: Without dead ends: 521 [2025-01-09 20:59:35,060 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-01-09 20:59:35,060 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 44 mSDsluCounter, 3446 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 4005 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:35,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 4005 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 20:59:35,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-01-09 20:59:35,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 512. [2025-01-09 20:59:35,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 489 states have (on average 1.32719836400818) internal successors, (649), 493 states have internal predecessors, (649), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 20:59:35,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 679 transitions. [2025-01-09 20:59:35,073 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 679 transitions. Word has length 72 [2025-01-09 20:59:35,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:35,074 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 679 transitions. [2025-01-09 20:59:35,074 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-01-09 20:59:35,074 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 679 transitions. [2025-01-09 20:59:35,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 20:59:35,075 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:35,075 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-01-09 20:59:35,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 20:59:35,075 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-01-09 20:59:35,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:35,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1068838908, now seen corresponding path program 1 times [2025-01-09 20:59:35,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:35,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801102883] [2025-01-09 20:59:35,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:35,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:35,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 20:59:35,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 20:59:35,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:35,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:35,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:59:35,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:35,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801102883] [2025-01-09 20:59:35,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801102883] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:35,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:35,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 20:59:35,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340782668] [2025-01-09 20:59:35,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:35,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 20:59:35,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:35,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 20:59:35,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 20:59:35,241 INFO L87 Difference]: Start difference. First operand 512 states and 679 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-01-09 20:59:35,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 20:59:35,610 INFO L93 Difference]: Finished difference Result 995 states and 1332 transitions. [2025-01-09 20:59:35,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 20:59:35,610 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-01-09 20:59:35,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 20:59:35,612 INFO L225 Difference]: With dead ends: 995 [2025-01-09 20:59:35,612 INFO L226 Difference]: Without dead ends: 525 [2025-01-09 20:59:35,613 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-01-09 20:59:35,616 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 33 mSDsluCounter, 3469 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 4035 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 20:59:35,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 4035 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 20:59:35,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-01-09 20:59:35,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 509. [2025-01-09 20:59:35,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 486 states have (on average 1.3292181069958848) internal successors, (646), 490 states have internal predecessors, (646), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 20:59:35,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 676 transitions. [2025-01-09 20:59:35,631 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 676 transitions. Word has length 72 [2025-01-09 20:59:35,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 20:59:35,631 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 676 transitions. [2025-01-09 20:59:35,631 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-01-09 20:59:35,631 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 676 transitions. [2025-01-09 20:59:35,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 20:59:35,632 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 20:59:35,632 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-01-09 20:59:35,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 20:59:35,632 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-01-09 20:59:35,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 20:59:35,633 INFO L85 PathProgramCache]: Analyzing trace with hash 465847704, now seen corresponding path program 1 times [2025-01-09 20:59:35,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 20:59:35,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241806805] [2025-01-09 20:59:35,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 20:59:35,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 20:59:35,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 20:59:35,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 20:59:35,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 20:59:35,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 20:59:56,632 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-01-09 20:59:56,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 20:59:56,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 20:59:56,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241806805] [2025-01-09 20:59:56,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241806805] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 20:59:56,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 20:59:56,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 20:59:56,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076300728] [2025-01-09 20:59:56,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 20:59:56,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 20:59:56,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 20:59:56,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 20:59:56,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=72, Unknown=1, NotChecked=16, Total=110 [2025-01-09 20:59:56,683 INFO L87 Difference]: Start difference. First operand 509 states and 676 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-01-09 20:59:59,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 21:00:03,207 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-01-09 21:00:07,227 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-01-09 21:00:11,234 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-01-09 21:00:15,244 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-01-09 21:00:19,252 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-01-09 21:00:23,256 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-01-09 21:00:27,823 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-01-09 21:00:32,040 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-01-09 21:00:34,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.81s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 21:00:37,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.82s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 21:00:41,677 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-01-09 21:00:45,681 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-01-09 21:00:49,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 21:00:53,075 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-01-09 21:00:57,078 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 []