./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec3_product13.cil.c --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/product-lines/email_spec3_product13.cil.c -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 c1a514ed3c88dbb6b86d895b5ccbc4ee84ef064cf150167d71ca780388d60956 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:52:35,442 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:52:35,481 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:52:35,485 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:52:35,485 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:52:35,500 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:52:35,501 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:52:35,501 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:52:35,502 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:52:35,502 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:52:35,502 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:52:35,502 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:52:35,502 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:52:35,502 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:52:35,502 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:52:35,503 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:52:35,503 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:52:35,503 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:52:35,503 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:52:35,503 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:52:35,503 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:52:35,503 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:52:35,503 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:52:35,503 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:52:35,503 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:52:35,503 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:52:35,504 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:52:35,504 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:52:35,504 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:52:35,504 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:52:35,504 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:52:35,504 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:52:35,504 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:52:35,504 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:52:35,504 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:52:35,504 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:52:35,504 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:52:35,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:52:35,505 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:52:35,505 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:52:35,505 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:52:35,505 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:52:35,505 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:52:35,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:52:35,505 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:52:35,505 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:52:35,505 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:52:35,505 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:52:35,505 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 -> c1a514ed3c88dbb6b86d895b5ccbc4ee84ef064cf150167d71ca780388d60956 [2025-01-09 03:52:35,705 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:52:35,715 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:52:35,716 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:52:35,717 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:52:35,717 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:52:35,718 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec3_product13.cil.c [2025-01-09 03:52:36,967 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/89246a5d9/61763deefc2a42fcb6a07302392932eb/FLAGe8b4ab99e [2025-01-09 03:52:37,500 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:52:37,504 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_product13.cil.c [2025-01-09 03:52:37,526 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/89246a5d9/61763deefc2a42fcb6a07302392932eb/FLAGe8b4ab99e [2025-01-09 03:52:38,023 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/89246a5d9/61763deefc2a42fcb6a07302392932eb [2025-01-09 03:52:38,025 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:52:38,027 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:52:38,028 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:52:38,029 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:52:38,032 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:52:38,033 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:52:38" (1/1) ... [2025-01-09 03:52:38,033 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35f16c2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:38, skipping insertion in model container [2025-01-09 03:52:38,033 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:52:38" (1/1) ... [2025-01-09 03:52:38,078 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:52:38,474 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/product-lines/email_spec3_product13.cil.c[62004,62017] [2025-01-09 03:52:38,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:52:38,491 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:52:38,497 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [48] [2025-01-09 03:52:38,498 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignVerify_spec.i","") [97] [2025-01-09 03:52:38,498 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [163] [2025-01-09 03:52:38,498 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [384] [2025-01-09 03:52:38,498 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [662] [2025-01-09 03:52:38,498 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1071] [2025-01-09 03:52:38,498 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1330] [2025-01-09 03:52:38,498 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1427] [2025-01-09 03:52:38,499 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1793] [2025-01-09 03:52:38,499 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2862] [2025-01-09 03:52:38,500 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2871] [2025-01-09 03:52:38,587 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/product-lines/email_spec3_product13.cil.c[62004,62017] [2025-01-09 03:52:38,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:52:38,609 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:52:38,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:38 WrapperNode [2025-01-09 03:52:38,610 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:52:38,611 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:52:38,611 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:52:38,611 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:52:38,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:38" (1/1) ... [2025-01-09 03:52:38,628 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:38" (1/1) ... [2025-01-09 03:52:38,653 INFO L138 Inliner]: procedures = 125, calls = 184, calls flagged for inlining = 52, calls inlined = 43, statements flattened = 824 [2025-01-09 03:52:38,654 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:52:38,654 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:52:38,654 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:52:38,654 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:52:38,662 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:38" (1/1) ... [2025-01-09 03:52:38,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:38" (1/1) ... [2025-01-09 03:52:38,668 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:38" (1/1) ... [2025-01-09 03:52:38,689 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-01-09 03:52:38,690 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:38" (1/1) ... [2025-01-09 03:52:38,690 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:38" (1/1) ... [2025-01-09 03:52:38,698 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:38" (1/1) ... [2025-01-09 03:52:38,699 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:38" (1/1) ... [2025-01-09 03:52:38,706 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:38" (1/1) ... [2025-01-09 03:52:38,708 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:38" (1/1) ... [2025-01-09 03:52:38,712 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:38" (1/1) ... [2025-01-09 03:52:38,717 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:52:38,717 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:52:38,717 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:52:38,717 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:52:38,718 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:38" (1/1) ... [2025-01-09 03:52:38,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:52:38,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:52:38,742 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 03:52:38,744 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 03:52:38,761 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-01-09 03:52:38,761 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-01-09 03:52:38,761 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-01-09 03:52:38,761 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-01-09 03:52:38,762 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-01-09 03:52:38,762 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-01-09 03:52:38,762 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-01-09 03:52:38,762 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-01-09 03:52:38,762 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-01-09 03:52:38,762 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-01-09 03:52:38,762 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-01-09 03:52:38,762 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-01-09 03:52:38,762 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-01-09 03:52:38,762 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-01-09 03:52:38,762 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-01-09 03:52:38,762 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-01-09 03:52:38,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:52:38,763 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-01-09 03:52:38,763 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-01-09 03:52:38,763 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-01-09 03:52:38,763 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-01-09 03:52:38,763 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-01-09 03:52:38,763 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-01-09 03:52:38,763 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-01-09 03:52:38,763 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-01-09 03:52:38,763 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-01-09 03:52:38,763 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-01-09 03:52:38,763 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-01-09 03:52:38,763 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-01-09 03:52:38,763 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-01-09 03:52:38,764 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-01-09 03:52:38,764 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-01-09 03:52:38,764 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-01-09 03:52:38,764 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-01-09 03:52:38,764 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-01-09 03:52:38,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:52:38,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:52:38,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:52:38,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:52:38,764 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-01-09 03:52:38,764 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-01-09 03:52:38,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:52:38,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:52:38,883 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:52:38,884 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:52:39,531 INFO L? ?]: Removed 362 outVars from TransFormulas that were not future-live. [2025-01-09 03:52:39,531 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:52:39,547 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:52:39,547 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:52:39,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:52:39 BoogieIcfgContainer [2025-01-09 03:52:39,548 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:52:39,550 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:52:39,550 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:52:39,554 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:52:39,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:52:38" (1/3) ... [2025-01-09 03:52:39,556 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@129954b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:52:39, skipping insertion in model container [2025-01-09 03:52:39,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:38" (2/3) ... [2025-01-09 03:52:39,556 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@129954b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:52:39, skipping insertion in model container [2025-01-09 03:52:39,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:52:39" (3/3) ... [2025-01-09 03:52:39,557 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec3_product13.cil.c [2025-01-09 03:52:39,575 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:52:39,578 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec3_product13.cil.c that has 19 procedures, 285 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:52:39,655 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:52:39,666 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;@1956cc65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:52:39,669 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:52:39,673 INFO L276 IsEmpty]: Start isEmpty. Operand has 285 states, 222 states have (on average 1.5360360360360361) internal successors, (341), 226 states have internal predecessors, (341), 43 states have call successors, (43), 18 states have call predecessors, (43), 18 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2025-01-09 03:52:39,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 03:52:39,686 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:39,687 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:39,687 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:39,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:39,691 INFO L85 PathProgramCache]: Analyzing trace with hash 598564369, now seen corresponding path program 1 times [2025-01-09 03:52:39,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:39,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626432132] [2025-01-09 03:52:39,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:39,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:39,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 03:52:39,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 03:52:39,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:39,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:40,359 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 03:52:40,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:40,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626432132] [2025-01-09 03:52:40,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626432132] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:52:40,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747031599] [2025-01-09 03:52:40,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:40,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:52:40,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:52:40,369 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:52:40,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 03:52:40,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 03:52:40,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 03:52:40,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:40,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:40,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 980 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:52:40,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:52:40,727 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 03:52:40,727 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:52:40,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747031599] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:40,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:52:40,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:52:40,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843034624] [2025-01-09 03:52:40,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:40,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:40,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:40,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:40,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:52:40,761 INFO L87 Difference]: Start difference. First operand has 285 states, 222 states have (on average 1.5360360360360361) internal successors, (341), 226 states have internal predecessors, (341), 43 states have call successors, (43), 18 states have call predecessors, (43), 18 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:52:40,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:40,814 INFO L93 Difference]: Finished difference Result 423 states and 622 transitions. [2025-01-09 03:52:40,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:40,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 100 [2025-01-09 03:52:40,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:40,827 INFO L225 Difference]: With dead ends: 423 [2025-01-09 03:52:40,827 INFO L226 Difference]: Without dead ends: 279 [2025-01-09 03:52:40,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:52:40,834 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 1 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:40,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 837 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:40,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-01-09 03:52:40,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 278. [2025-01-09 03:52:40,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 217 states have (on average 1.5299539170506913) internal successors, (332), 219 states have internal predecessors, (332), 43 states have call successors, (43), 18 states have call predecessors, (43), 17 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 03:52:40,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 415 transitions. [2025-01-09 03:52:40,899 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 415 transitions. Word has length 100 [2025-01-09 03:52:40,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:40,900 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 415 transitions. [2025-01-09 03:52:40,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:52:40,901 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 415 transitions. [2025-01-09 03:52:40,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 03:52:40,904 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:40,905 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:40,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 03:52:41,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 03:52:41,110 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:41,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:41,111 INFO L85 PathProgramCache]: Analyzing trace with hash -95750820, now seen corresponding path program 1 times [2025-01-09 03:52:41,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:41,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001474508] [2025-01-09 03:52:41,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:41,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:41,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 03:52:41,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 03:52:41,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:41,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:41,412 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 03:52:41,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:41,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001474508] [2025-01-09 03:52:41,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001474508] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:52:41,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564939259] [2025-01-09 03:52:41,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:41,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:52:41,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:52:41,420 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:52:41,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 03:52:41,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 03:52:41,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 03:52:41,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:41,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:41,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 991 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:52:41,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:52:41,701 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 03:52:41,701 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:52:41,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564939259] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:41,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:52:41,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:52:41,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480653907] [2025-01-09 03:52:41,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:41,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:41,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:41,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:41,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:52:41,705 INFO L87 Difference]: Start difference. First operand 278 states and 415 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:52:41,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:41,728 INFO L93 Difference]: Finished difference Result 581 states and 881 transitions. [2025-01-09 03:52:41,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:41,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2025-01-09 03:52:41,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:41,731 INFO L225 Difference]: With dead ends: 581 [2025-01-09 03:52:41,731 INFO L226 Difference]: Without dead ends: 329 [2025-01-09 03:52:41,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:52:41,733 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 99 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:41,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 785 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:41,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2025-01-09 03:52:41,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 321. [2025-01-09 03:52:41,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 249 states have (on average 1.5461847389558232) internal successors, (385), 251 states have internal predecessors, (385), 54 states have call successors, (54), 18 states have call predecessors, (54), 17 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-01-09 03:52:41,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 490 transitions. [2025-01-09 03:52:41,752 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 490 transitions. Word has length 105 [2025-01-09 03:52:41,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:41,755 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 490 transitions. [2025-01-09 03:52:41,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:52:41,756 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 490 transitions. [2025-01-09 03:52:41,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 03:52:41,758 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:41,758 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:41,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 03:52:41,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:52:41,964 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:41,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:41,966 INFO L85 PathProgramCache]: Analyzing trace with hash -2005709152, now seen corresponding path program 1 times [2025-01-09 03:52:41,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:41,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824363777] [2025-01-09 03:52:41,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:41,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:41,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 03:52:41,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 03:52:41,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:41,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:42,185 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 03:52:42,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:42,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824363777] [2025-01-09 03:52:42,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824363777] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:52:42,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199504512] [2025-01-09 03:52:42,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:42,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:52:42,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:52:42,190 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:52:42,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 03:52:42,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 03:52:42,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 03:52:42,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:42,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:42,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 996 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 03:52:42,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:52:42,532 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 03:52:42,533 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:52:42,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199504512] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:42,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:52:42,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-01-09 03:52:42,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795027524] [2025-01-09 03:52:42,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:42,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:52:42,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:42,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:52:42,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:52:42,535 INFO L87 Difference]: Start difference. First operand 321 states and 490 transitions. Second operand has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:52:42,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:42,596 INFO L93 Difference]: Finished difference Result 633 states and 970 transitions. [2025-01-09 03:52:42,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:52:42,597 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 106 [2025-01-09 03:52:42,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:42,600 INFO L225 Difference]: With dead ends: 633 [2025-01-09 03:52:42,600 INFO L226 Difference]: Without dead ends: 323 [2025-01-09 03:52:42,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:52:42,602 INFO L435 NwaCegarLoop]: 406 mSDtfsCounter, 2 mSDsluCounter, 1207 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1613 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:42,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1613 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:42,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-01-09 03:52:42,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2025-01-09 03:52:42,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 250 states have (on average 1.544) internal successors, (386), 253 states have internal predecessors, (386), 54 states have call successors, (54), 18 states have call predecessors, (54), 18 states have return successors, (53), 51 states have call predecessors, (53), 51 states have call successors, (53) [2025-01-09 03:52:42,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 493 transitions. [2025-01-09 03:52:42,629 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 493 transitions. Word has length 106 [2025-01-09 03:52:42,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:42,629 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 493 transitions. [2025-01-09 03:52:42,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:52:42,629 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 493 transitions. [2025-01-09 03:52:42,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 03:52:42,632 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:42,633 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:42,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 03:52:42,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:52:42,835 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:42,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:42,836 INFO L85 PathProgramCache]: Analyzing trace with hash -468878833, now seen corresponding path program 1 times [2025-01-09 03:52:42,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:42,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358566530] [2025-01-09 03:52:42,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:42,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:42,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 03:52:42,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 03:52:42,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:42,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:43,029 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 03:52:43,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:43,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358566530] [2025-01-09 03:52:43,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358566530] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:52:43,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445189204] [2025-01-09 03:52:43,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:43,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:52:43,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:52:43,032 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:52:43,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 03:52:43,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 03:52:43,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 03:52:43,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:43,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:43,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 997 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 03:52:43,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:52:43,331 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 03:52:43,331 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:52:43,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445189204] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:43,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:52:43,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-01-09 03:52:43,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891718552] [2025-01-09 03:52:43,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:43,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:52:43,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:43,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:52:43,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:52:43,332 INFO L87 Difference]: Start difference. First operand 323 states and 493 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:52:43,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:43,394 INFO L93 Difference]: Finished difference Result 635 states and 975 transitions. [2025-01-09 03:52:43,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:52:43,396 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 107 [2025-01-09 03:52:43,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:43,399 INFO L225 Difference]: With dead ends: 635 [2025-01-09 03:52:43,399 INFO L226 Difference]: Without dead ends: 325 [2025-01-09 03:52:43,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:52:43,402 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 2 mSDsluCounter, 1195 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1599 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:43,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1599 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:43,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-01-09 03:52:43,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2025-01-09 03:52:43,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 251 states have (on average 1.5418326693227091) internal successors, (387), 255 states have internal predecessors, (387), 54 states have call successors, (54), 18 states have call predecessors, (54), 19 states have return successors, (58), 51 states have call predecessors, (58), 51 states have call successors, (58) [2025-01-09 03:52:43,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 499 transitions. [2025-01-09 03:52:43,429 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 499 transitions. Word has length 107 [2025-01-09 03:52:43,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:43,429 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 499 transitions. [2025-01-09 03:52:43,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:52:43,430 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 499 transitions. [2025-01-09 03:52:43,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 03:52:43,433 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:43,433 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:43,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 03:52:43,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:52:43,634 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:43,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:43,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1199803206, now seen corresponding path program 1 times [2025-01-09 03:52:43,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:43,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028921096] [2025-01-09 03:52:43,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:43,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:43,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 03:52:43,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 03:52:43,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:43,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:43,790 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 03:52:43,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:43,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028921096] [2025-01-09 03:52:43,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028921096] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:43,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:43,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:52:43,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274486589] [2025-01-09 03:52:43,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:43,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:52:43,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:43,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:52:43,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:52:43,793 INFO L87 Difference]: Start difference. First operand 325 states and 499 transitions. Second operand has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:52:43,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:43,834 INFO L93 Difference]: Finished difference Result 627 states and 966 transitions. [2025-01-09 03:52:43,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:52:43,835 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2025-01-09 03:52:43,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:43,837 INFO L225 Difference]: With dead ends: 627 [2025-01-09 03:52:43,837 INFO L226 Difference]: Without dead ends: 325 [2025-01-09 03:52:43,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:52:43,839 INFO L435 NwaCegarLoop]: 407 mSDtfsCounter, 2 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1617 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:43,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1617 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:43,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-01-09 03:52:43,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2025-01-09 03:52:43,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 251 states have (on average 1.5418326693227091) internal successors, (387), 255 states have internal predecessors, (387), 54 states have call successors, (54), 18 states have call predecessors, (54), 19 states have return successors, (57), 51 states have call predecessors, (57), 51 states have call successors, (57) [2025-01-09 03:52:43,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 498 transitions. [2025-01-09 03:52:43,852 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 498 transitions. Word has length 108 [2025-01-09 03:52:43,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:43,853 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 498 transitions. [2025-01-09 03:52:43,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:52:43,853 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 498 transitions. [2025-01-09 03:52:43,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 03:52:43,854 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:43,855 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:43,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 03:52:43,855 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:43,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:43,855 INFO L85 PathProgramCache]: Analyzing trace with hash 553710795, now seen corresponding path program 2 times [2025-01-09 03:52:43,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:43,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372455138] [2025-01-09 03:52:43,856 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:52:43,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:43,876 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 109 statements into 2 equivalence classes. [2025-01-09 03:52:43,893 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 03:52:43,893 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:52:43,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:44,002 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 03:52:44,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:44,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372455138] [2025-01-09 03:52:44,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372455138] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:44,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:44,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:52:44,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702185934] [2025-01-09 03:52:44,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:44,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:52:44,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:44,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:52:44,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:52:44,004 INFO L87 Difference]: Start difference. First operand 325 states and 498 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:52:44,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:44,059 INFO L93 Difference]: Finished difference Result 625 states and 961 transitions. [2025-01-09 03:52:44,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:52:44,060 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 109 [2025-01-09 03:52:44,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:44,064 INFO L225 Difference]: With dead ends: 625 [2025-01-09 03:52:44,064 INFO L226 Difference]: Without dead ends: 325 [2025-01-09 03:52:44,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:52:44,067 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 2 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1603 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:44,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1603 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:44,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-01-09 03:52:44,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2025-01-09 03:52:44,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 251 states have (on average 1.5418326693227091) internal successors, (387), 255 states have internal predecessors, (387), 54 states have call successors, (54), 18 states have call predecessors, (54), 19 states have return successors, (56), 51 states have call predecessors, (56), 51 states have call successors, (56) [2025-01-09 03:52:44,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 497 transitions. [2025-01-09 03:52:44,089 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 497 transitions. Word has length 109 [2025-01-09 03:52:44,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:44,090 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 497 transitions. [2025-01-09 03:52:44,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:52:44,090 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 497 transitions. [2025-01-09 03:52:44,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 03:52:44,091 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:44,091 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:44,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:52:44,091 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:44,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:44,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1204596008, now seen corresponding path program 3 times [2025-01-09 03:52:44,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:44,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122484385] [2025-01-09 03:52:44,092 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 03:52:44,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:44,109 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 110 statements into 3 equivalence classes. [2025-01-09 03:52:44,122 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 98 of 110 statements. [2025-01-09 03:52:44,122 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 03:52:44,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:44,272 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-09 03:52:44,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:44,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122484385] [2025-01-09 03:52:44,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122484385] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:44,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:44,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:52:44,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822230284] [2025-01-09 03:52:44,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:44,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:52:44,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:44,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:52:44,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:52:44,273 INFO L87 Difference]: Start difference. First operand 325 states and 497 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:52:44,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:44,500 INFO L93 Difference]: Finished difference Result 704 states and 1018 transitions. [2025-01-09 03:52:44,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 03:52:44,500 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) Word has length 110 [2025-01-09 03:52:44,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:44,504 INFO L225 Difference]: With dead ends: 704 [2025-01-09 03:52:44,504 INFO L226 Difference]: Without dead ends: 583 [2025-01-09 03:52:44,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-01-09 03:52:44,506 INFO L435 NwaCegarLoop]: 612 mSDtfsCounter, 563 mSDsluCounter, 1849 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 2461 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:44,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 2461 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:52:44,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2025-01-09 03:52:44,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 573. [2025-01-09 03:52:44,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 449 states have (on average 1.4988864142538976) internal successors, (673), 456 states have internal predecessors, (673), 80 states have call successors, (80), 38 states have call predecessors, (80), 43 states have return successors, (87), 78 states have call predecessors, (87), 75 states have call successors, (87) [2025-01-09 03:52:44,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 840 transitions. [2025-01-09 03:52:44,525 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 840 transitions. Word has length 110 [2025-01-09 03:52:44,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:44,526 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 840 transitions. [2025-01-09 03:52:44,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:52:44,526 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 840 transitions. [2025-01-09 03:52:44,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 03:52:44,527 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:44,527 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:44,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:52:44,527 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:44,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:44,528 INFO L85 PathProgramCache]: Analyzing trace with hash 524787469, now seen corresponding path program 1 times [2025-01-09 03:52:44,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:44,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727907214] [2025-01-09 03:52:44,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:44,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:44,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 03:52:44,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 03:52:44,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:44,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:44,616 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 03:52:44,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:44,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727907214] [2025-01-09 03:52:44,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727907214] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:44,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:44,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:52:44,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900827391] [2025-01-09 03:52:44,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:44,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:52:44,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:44,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:52:44,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:52:44,617 INFO L87 Difference]: Start difference. First operand 573 states and 840 transitions. Second operand has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:52:44,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:44,653 INFO L93 Difference]: Finished difference Result 1125 states and 1653 transitions. [2025-01-09 03:52:44,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:52:44,653 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 111 [2025-01-09 03:52:44,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:44,656 INFO L225 Difference]: With dead ends: 1125 [2025-01-09 03:52:44,656 INFO L226 Difference]: Without dead ends: 575 [2025-01-09 03:52:44,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:52:44,657 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 1 mSDsluCounter, 1212 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1620 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:44,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1620 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:44,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2025-01-09 03:52:44,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 575. [2025-01-09 03:52:44,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 450 states have (on average 1.4977777777777779) internal successors, (674), 458 states have internal predecessors, (674), 80 states have call successors, (80), 38 states have call predecessors, (80), 44 states have return successors, (89), 78 states have call predecessors, (89), 75 states have call successors, (89) [2025-01-09 03:52:44,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 843 transitions. [2025-01-09 03:52:44,674 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 843 transitions. Word has length 111 [2025-01-09 03:52:44,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:44,674 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 843 transitions. [2025-01-09 03:52:44,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:52:44,675 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 843 transitions. [2025-01-09 03:52:44,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 03:52:44,676 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:44,676 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:44,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:52:44,676 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:44,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:44,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1022278711, now seen corresponding path program 1 times [2025-01-09 03:52:44,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:44,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719493642] [2025-01-09 03:52:44,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:44,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:44,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 03:52:44,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 03:52:44,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:44,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:44,796 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 03:52:44,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:44,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719493642] [2025-01-09 03:52:44,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719493642] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:44,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:44,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:52:44,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208505691] [2025-01-09 03:52:44,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:44,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:52:44,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:44,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:52:44,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:52:44,798 INFO L87 Difference]: Start difference. First operand 575 states and 843 transitions. Second operand has 8 states, 7 states have (on average 11.142857142857142) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 03:52:44,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:44,923 INFO L93 Difference]: Finished difference Result 1130 states and 1662 transitions. [2025-01-09 03:52:44,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 03:52:44,924 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.142857142857142) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 112 [2025-01-09 03:52:44,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:44,927 INFO L225 Difference]: With dead ends: 1130 [2025-01-09 03:52:44,927 INFO L226 Difference]: Without dead ends: 580 [2025-01-09 03:52:44,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:52:44,929 INFO L435 NwaCegarLoop]: 400 mSDtfsCounter, 5 mSDsluCounter, 2371 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2771 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:44,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2771 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:52:44,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-01-09 03:52:44,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2025-01-09 03:52:44,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 454 states have (on average 1.4955947136563876) internal successors, (679), 462 states have internal predecessors, (679), 80 states have call successors, (80), 39 states have call predecessors, (80), 45 states have return successors, (94), 78 states have call predecessors, (94), 75 states have call successors, (94) [2025-01-09 03:52:44,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 853 transitions. [2025-01-09 03:52:44,948 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 853 transitions. Word has length 112 [2025-01-09 03:52:44,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:44,948 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 853 transitions. [2025-01-09 03:52:44,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.142857142857142) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 03:52:44,948 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 853 transitions. [2025-01-09 03:52:44,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 03:52:44,950 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:44,950 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:44,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:52:44,950 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:44,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:44,950 INFO L85 PathProgramCache]: Analyzing trace with hash 19858293, now seen corresponding path program 1 times [2025-01-09 03:52:44,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:44,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880798855] [2025-01-09 03:52:44,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:44,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:44,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 03:52:44,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 03:52:44,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:44,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:45,061 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:52:45,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:45,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880798855] [2025-01-09 03:52:45,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880798855] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:52:45,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802713638] [2025-01-09 03:52:45,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:45,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:52:45,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:52:45,065 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:52:45,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 03:52:45,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 03:52:45,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 03:52:45,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:45,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:45,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 1003 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:52:45,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:52:45,298 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:52:45,299 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:52:45,353 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:52:45,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802713638] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:52:45,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:52:45,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 03:52:45,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380074749] [2025-01-09 03:52:45,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:52:45,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:52:45,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:45,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:52:45,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:52:45,358 INFO L87 Difference]: Start difference. First operand 580 states and 853 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:52:45,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:45,510 INFO L93 Difference]: Finished difference Result 1315 states and 1979 transitions. [2025-01-09 03:52:45,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:52:45,510 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 113 [2025-01-09 03:52:45,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:45,515 INFO L225 Difference]: With dead ends: 1315 [2025-01-09 03:52:45,515 INFO L226 Difference]: Without dead ends: 937 [2025-01-09 03:52:45,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:52:45,517 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 381 mSDsluCounter, 1181 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 1624 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:45,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 1624 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:52:45,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2025-01-09 03:52:45,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 877. [2025-01-09 03:52:45,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 687 states have (on average 1.5589519650655022) internal successors, (1071), 695 states have internal predecessors, (1071), 144 states have call successors, (144), 39 states have call predecessors, (144), 45 states have return successors, (168), 142 states have call predecessors, (168), 139 states have call successors, (168) [2025-01-09 03:52:45,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1383 transitions. [2025-01-09 03:52:45,552 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1383 transitions. Word has length 113 [2025-01-09 03:52:45,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:45,552 INFO L471 AbstractCegarLoop]: Abstraction has 877 states and 1383 transitions. [2025-01-09 03:52:45,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:52:45,552 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1383 transitions. [2025-01-09 03:52:45,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 03:52:45,555 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:45,555 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:45,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 03:52:45,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 03:52:45,756 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:45,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:45,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1610880530, now seen corresponding path program 1 times [2025-01-09 03:52:45,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:45,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887274614] [2025-01-09 03:52:45,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:45,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:45,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 03:52:45,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 03:52:45,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:45,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:45,815 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:52:45,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:45,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887274614] [2025-01-09 03:52:45,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887274614] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:45,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:45,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:45,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961194320] [2025-01-09 03:52:45,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:45,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:45,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:45,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:45,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:45,816 INFO L87 Difference]: Start difference. First operand 877 states and 1383 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:52:45,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:45,850 INFO L93 Difference]: Finished difference Result 1998 states and 3203 transitions. [2025-01-09 03:52:45,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:45,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 120 [2025-01-09 03:52:45,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:45,856 INFO L225 Difference]: With dead ends: 1998 [2025-01-09 03:52:45,856 INFO L226 Difference]: Without dead ends: 1190 [2025-01-09 03:52:45,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:45,859 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 97 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:45,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 833 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:45,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2025-01-09 03:52:45,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 1170. [2025-01-09 03:52:45,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1170 states, 916 states have (on average 1.581877729257642) internal successors, (1449), 924 states have internal predecessors, (1449), 208 states have call successors, (208), 39 states have call predecessors, (208), 45 states have return successors, (242), 206 states have call predecessors, (242), 203 states have call successors, (242) [2025-01-09 03:52:45,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1899 transitions. [2025-01-09 03:52:45,899 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 1899 transitions. Word has length 120 [2025-01-09 03:52:45,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:45,899 INFO L471 AbstractCegarLoop]: Abstraction has 1170 states and 1899 transitions. [2025-01-09 03:52:45,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:52:45,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1899 transitions. [2025-01-09 03:52:45,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 03:52:45,904 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:45,904 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:45,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 03:52:45,904 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:45,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:45,904 INFO L85 PathProgramCache]: Analyzing trace with hash -392667443, now seen corresponding path program 1 times [2025-01-09 03:52:45,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:45,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187536325] [2025-01-09 03:52:45,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:45,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:45,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 03:52:45,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 03:52:45,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:45,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:45,949 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:52:45,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:45,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187536325] [2025-01-09 03:52:45,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187536325] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:45,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:45,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:45,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389825619] [2025-01-09 03:52:45,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:45,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:45,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:45,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:45,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:45,950 INFO L87 Difference]: Start difference. First operand 1170 states and 1899 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:52:46,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:46,001 INFO L93 Difference]: Finished difference Result 2696 states and 4415 transitions. [2025-01-09 03:52:46,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:46,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2025-01-09 03:52:46,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:46,009 INFO L225 Difference]: With dead ends: 2696 [2025-01-09 03:52:46,009 INFO L226 Difference]: Without dead ends: 1646 [2025-01-09 03:52:46,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:46,013 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 95 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:46,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 822 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:46,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2025-01-09 03:52:46,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1626. [2025-01-09 03:52:46,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1626 states, 1277 states have (on average 1.600626468285043) internal successors, (2044), 1285 states have internal predecessors, (2044), 303 states have call successors, (303), 39 states have call predecessors, (303), 45 states have return successors, (337), 301 states have call predecessors, (337), 298 states have call successors, (337) [2025-01-09 03:52:46,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1626 states and 2684 transitions. [2025-01-09 03:52:46,143 INFO L78 Accepts]: Start accepts. Automaton has 1626 states and 2684 transitions. Word has length 121 [2025-01-09 03:52:46,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:46,143 INFO L471 AbstractCegarLoop]: Abstraction has 1626 states and 2684 transitions. [2025-01-09 03:52:46,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:52:46,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1626 states and 2684 transitions. [2025-01-09 03:52:46,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 03:52:46,150 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:46,150 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:46,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:52:46,150 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:46,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:46,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1521889968, now seen corresponding path program 1 times [2025-01-09 03:52:46,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:46,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674737519] [2025-01-09 03:52:46,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:46,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:46,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 03:52:46,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 03:52:46,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:46,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:46,210 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:52:46,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:46,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674737519] [2025-01-09 03:52:46,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674737519] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:46,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:46,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:46,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526279069] [2025-01-09 03:52:46,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:46,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:46,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:46,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:46,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:46,211 INFO L87 Difference]: Start difference. First operand 1626 states and 2684 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:52:46,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:46,283 INFO L93 Difference]: Finished difference Result 3715 states and 6194 transitions. [2025-01-09 03:52:46,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:46,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2025-01-09 03:52:46,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:46,297 INFO L225 Difference]: With dead ends: 3715 [2025-01-09 03:52:46,297 INFO L226 Difference]: Without dead ends: 2330 [2025-01-09 03:52:46,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:46,303 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 93 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:46,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 817 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:46,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2330 states. [2025-01-09 03:52:46,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2330 to 2310. [2025-01-09 03:52:46,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2310 states, 1838 states have (on average 1.616430903155604) internal successors, (2971), 1846 states have internal predecessors, (2971), 426 states have call successors, (426), 39 states have call predecessors, (426), 45 states have return successors, (476), 424 states have call predecessors, (476), 421 states have call successors, (476) [2025-01-09 03:52:46,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2310 states to 2310 states and 3873 transitions. [2025-01-09 03:52:46,409 INFO L78 Accepts]: Start accepts. Automaton has 2310 states and 3873 transitions. Word has length 122 [2025-01-09 03:52:46,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:46,409 INFO L471 AbstractCegarLoop]: Abstraction has 2310 states and 3873 transitions. [2025-01-09 03:52:46,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:52:46,410 INFO L276 IsEmpty]: Start isEmpty. Operand 2310 states and 3873 transitions. [2025-01-09 03:52:46,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 03:52:46,422 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:46,422 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:46,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:52:46,423 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:46,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:46,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1682866866, now seen corresponding path program 1 times [2025-01-09 03:52:46,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:46,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659270587] [2025-01-09 03:52:46,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:46,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:46,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 03:52:46,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 03:52:46,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:46,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:46,491 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:52:46,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:46,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659270587] [2025-01-09 03:52:46,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659270587] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:46,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:46,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:46,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260335948] [2025-01-09 03:52:46,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:46,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:46,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:46,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:46,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:46,492 INFO L87 Difference]: Start difference. First operand 2310 states and 3873 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:52:46,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:46,643 INFO L93 Difference]: Finished difference Result 5288 states and 8945 transitions. [2025-01-09 03:52:46,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:46,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 123 [2025-01-09 03:52:46,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:46,664 INFO L225 Difference]: With dead ends: 5288 [2025-01-09 03:52:46,665 INFO L226 Difference]: Without dead ends: 3416 [2025-01-09 03:52:46,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:46,673 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 91 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:46,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 817 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:46,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3416 states. [2025-01-09 03:52:46,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3416 to 3396. [2025-01-09 03:52:46,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3396 states, 2745 states have (on average 1.6280510018214935) internal successors, (4469), 2753 states have internal predecessors, (4469), 605 states have call successors, (605), 39 states have call predecessors, (605), 45 states have return successors, (681), 603 states have call predecessors, (681), 600 states have call successors, (681) [2025-01-09 03:52:46,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3396 states to 3396 states and 5755 transitions. [2025-01-09 03:52:46,887 INFO L78 Accepts]: Start accepts. Automaton has 3396 states and 5755 transitions. Word has length 123 [2025-01-09 03:52:46,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:46,888 INFO L471 AbstractCegarLoop]: Abstraction has 3396 states and 5755 transitions. [2025-01-09 03:52:46,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:52:46,888 INFO L276 IsEmpty]: Start isEmpty. Operand 3396 states and 5755 transitions. [2025-01-09 03:52:46,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 03:52:46,902 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:46,902 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:46,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:52:46,902 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:46,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:46,903 INFO L85 PathProgramCache]: Analyzing trace with hash -304991092, now seen corresponding path program 1 times [2025-01-09 03:52:46,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:46,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564545318] [2025-01-09 03:52:46,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:46,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:46,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 03:52:46,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 03:52:46,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:46,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:46,958 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:52:46,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:46,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564545318] [2025-01-09 03:52:46,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564545318] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:46,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:46,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:46,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727922619] [2025-01-09 03:52:46,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:46,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:46,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:46,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:46,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:46,960 INFO L87 Difference]: Start difference. First operand 3396 states and 5755 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:52:47,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:47,086 INFO L93 Difference]: Finished difference Result 8129 states and 13867 transitions. [2025-01-09 03:52:47,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:47,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 124 [2025-01-09 03:52:47,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:47,114 INFO L225 Difference]: With dead ends: 8129 [2025-01-09 03:52:47,114 INFO L226 Difference]: Without dead ends: 5392 [2025-01-09 03:52:47,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:47,125 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 89 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:47,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 838 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:47,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5392 states. [2025-01-09 03:52:47,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5392 to 5372. [2025-01-09 03:52:47,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5372 states, 4345 states have (on average 1.6262370540851554) internal successors, (7066), 4353 states have internal predecessors, (7066), 981 states have call successors, (981), 39 states have call predecessors, (981), 45 states have return successors, (1101), 979 states have call predecessors, (1101), 976 states have call successors, (1101) [2025-01-09 03:52:47,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5372 states to 5372 states and 9148 transitions. [2025-01-09 03:52:47,382 INFO L78 Accepts]: Start accepts. Automaton has 5372 states and 9148 transitions. Word has length 124 [2025-01-09 03:52:47,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:47,383 INFO L471 AbstractCegarLoop]: Abstraction has 5372 states and 9148 transitions. [2025-01-09 03:52:47,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:52:47,383 INFO L276 IsEmpty]: Start isEmpty. Operand 5372 states and 9148 transitions. [2025-01-09 03:52:47,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 03:52:47,400 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:47,400 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:47,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:52:47,401 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:47,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:47,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1170635918, now seen corresponding path program 1 times [2025-01-09 03:52:47,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:47,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024909204] [2025-01-09 03:52:47,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:47,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:47,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 03:52:47,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 03:52:47,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:47,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:47,455 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:52:47,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:47,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024909204] [2025-01-09 03:52:47,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024909204] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:47,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:47,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:47,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734495242] [2025-01-09 03:52:47,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:47,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:47,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:47,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:47,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:47,457 INFO L87 Difference]: Start difference. First operand 5372 states and 9148 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:52:47,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:47,701 INFO L93 Difference]: Finished difference Result 13138 states and 22532 transitions. [2025-01-09 03:52:47,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:47,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 125 [2025-01-09 03:52:47,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:47,745 INFO L225 Difference]: With dead ends: 13138 [2025-01-09 03:52:47,745 INFO L226 Difference]: Without dead ends: 8786 [2025-01-09 03:52:47,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:47,757 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 87 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:47,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 820 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:47,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8786 states. [2025-01-09 03:52:48,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8786 to 8766. [2025-01-09 03:52:48,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8766 states, 7133 states have (on average 1.6270853778213936) internal successors, (11606), 7141 states have internal predecessors, (11606), 1587 states have call successors, (1587), 39 states have call predecessors, (1587), 45 states have return successors, (1785), 1585 states have call predecessors, (1785), 1582 states have call successors, (1785) [2025-01-09 03:52:48,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8766 states to 8766 states and 14978 transitions. [2025-01-09 03:52:48,077 INFO L78 Accepts]: Start accepts. Automaton has 8766 states and 14978 transitions. Word has length 125 [2025-01-09 03:52:48,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:48,077 INFO L471 AbstractCegarLoop]: Abstraction has 8766 states and 14978 transitions. [2025-01-09 03:52:48,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:52:48,077 INFO L276 IsEmpty]: Start isEmpty. Operand 8766 states and 14978 transitions. [2025-01-09 03:52:48,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 03:52:48,106 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:48,107 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:48,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:52:48,107 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:48,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:48,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1509261102, now seen corresponding path program 1 times [2025-01-09 03:52:48,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:48,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481841663] [2025-01-09 03:52:48,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:48,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:48,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 03:52:48,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 03:52:48,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:48,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:48,197 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:52:48,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:48,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481841663] [2025-01-09 03:52:48,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481841663] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:48,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:48,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:48,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858554315] [2025-01-09 03:52:48,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:48,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:48,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:48,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:48,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:48,201 INFO L87 Difference]: Start difference. First operand 8766 states and 14978 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:52:48,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:48,582 INFO L93 Difference]: Finished difference Result 22559 states and 38719 transitions. [2025-01-09 03:52:48,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:48,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 126 [2025-01-09 03:52:48,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:48,645 INFO L225 Difference]: With dead ends: 22559 [2025-01-09 03:52:48,645 INFO L226 Difference]: Without dead ends: 15213 [2025-01-09 03:52:48,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:48,674 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 85 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:48,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 829 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:48,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15213 states. [2025-01-09 03:52:49,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15213 to 15193. [2025-01-09 03:52:49,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15193 states, 12357 states have (on average 1.6190013757384478) internal successors, (20006), 12365 states have internal predecessors, (20006), 2790 states have call successors, (2790), 39 states have call predecessors, (2790), 45 states have return successors, (3132), 2788 states have call predecessors, (3132), 2785 states have call successors, (3132) [2025-01-09 03:52:49,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15193 states to 15193 states and 25928 transitions. [2025-01-09 03:52:49,394 INFO L78 Accepts]: Start accepts. Automaton has 15193 states and 25928 transitions. Word has length 126 [2025-01-09 03:52:49,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:49,395 INFO L471 AbstractCegarLoop]: Abstraction has 15193 states and 25928 transitions. [2025-01-09 03:52:49,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:52:49,395 INFO L276 IsEmpty]: Start isEmpty. Operand 15193 states and 25928 transitions. [2025-01-09 03:52:49,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 03:52:49,426 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:49,426 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:49,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:52:49,427 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:49,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:49,427 INFO L85 PathProgramCache]: Analyzing trace with hash 121099667, now seen corresponding path program 1 times [2025-01-09 03:52:49,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:49,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860831473] [2025-01-09 03:52:49,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:49,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:49,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 03:52:49,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 03:52:49,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:49,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:49,486 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:52:49,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:49,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860831473] [2025-01-09 03:52:49,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860831473] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:49,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:49,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:49,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252152256] [2025-01-09 03:52:49,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:49,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:49,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:49,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:49,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:49,489 INFO L87 Difference]: Start difference. First operand 15193 states and 25928 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:52:50,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:50,086 INFO L93 Difference]: Finished difference Result 40075 states and 68722 transitions. [2025-01-09 03:52:50,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:50,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 127 [2025-01-09 03:52:50,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:50,225 INFO L225 Difference]: With dead ends: 40075 [2025-01-09 03:52:50,225 INFO L226 Difference]: Without dead ends: 26880 [2025-01-09 03:52:50,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:50,272 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 83 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:50,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 820 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:50,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26880 states. [2025-01-09 03:52:51,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26880 to 26860. [2025-01-09 03:52:51,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26860 states, 21985 states have (on average 1.6152376620423015) internal successors, (35511), 21993 states have internal predecessors, (35511), 4829 states have call successors, (4829), 39 states have call predecessors, (4829), 45 states have return successors, (5445), 4827 states have call predecessors, (5445), 4824 states have call successors, (5445) [2025-01-09 03:52:51,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26860 states to 26860 states and 45785 transitions. [2025-01-09 03:52:51,290 INFO L78 Accepts]: Start accepts. Automaton has 26860 states and 45785 transitions. Word has length 127 [2025-01-09 03:52:51,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:51,290 INFO L471 AbstractCegarLoop]: Abstraction has 26860 states and 45785 transitions. [2025-01-09 03:52:51,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:52:51,291 INFO L276 IsEmpty]: Start isEmpty. Operand 26860 states and 45785 transitions. [2025-01-09 03:52:51,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 03:52:51,330 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:51,330 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:51,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:52:51,331 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:51,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:51,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1419785680, now seen corresponding path program 1 times [2025-01-09 03:52:51,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:51,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366011988] [2025-01-09 03:52:51,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:51,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:51,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 03:52:51,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 03:52:51,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:51,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:51,385 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:52:51,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:51,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366011988] [2025-01-09 03:52:51,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366011988] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:51,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:51,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:51,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170393007] [2025-01-09 03:52:51,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:51,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:51,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:51,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:51,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:51,387 INFO L87 Difference]: Start difference. First operand 26860 states and 45785 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:52:52,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:52,636 INFO L93 Difference]: Finished difference Result 73027 states and 124954 transitions. [2025-01-09 03:52:52,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:52,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 128 [2025-01-09 03:52:52,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:52,847 INFO L225 Difference]: With dead ends: 73027 [2025-01-09 03:52:52,847 INFO L226 Difference]: Without dead ends: 48860 [2025-01-09 03:52:52,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:52,926 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 81 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:52,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 820 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:52,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48860 states. [2025-01-09 03:52:54,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48860 to 48840. [2025-01-09 03:52:54,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48840 states, 40250 states have (on average 1.6095155279503106) internal successors, (64783), 40258 states have internal predecessors, (64783), 8544 states have call successors, (8544), 39 states have call predecessors, (8544), 45 states have return successors, (9692), 8542 states have call predecessors, (9692), 8539 states have call successors, (9692) [2025-01-09 03:52:54,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48840 states to 48840 states and 83019 transitions. [2025-01-09 03:52:54,689 INFO L78 Accepts]: Start accepts. Automaton has 48840 states and 83019 transitions. Word has length 128 [2025-01-09 03:52:54,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:52:54,689 INFO L471 AbstractCegarLoop]: Abstraction has 48840 states and 83019 transitions. [2025-01-09 03:52:54,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:52:54,690 INFO L276 IsEmpty]: Start isEmpty. Operand 48840 states and 83019 transitions. [2025-01-09 03:52:54,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 03:52:54,730 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:54,731 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:54,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:52:54,731 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:54,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:54,731 INFO L85 PathProgramCache]: Analyzing trace with hash -859318381, now seen corresponding path program 1 times [2025-01-09 03:52:54,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:54,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403498021] [2025-01-09 03:52:54,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:54,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:54,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 03:52:54,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 03:52:54,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:54,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:54,787 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:52:54,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:54,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403498021] [2025-01-09 03:52:54,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403498021] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:54,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:52:54,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:52:54,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110659727] [2025-01-09 03:52:54,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:54,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:52:54,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:54,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:52:54,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:54,790 INFO L87 Difference]: Start difference. First operand 48840 states and 83019 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:52:56,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:56,801 INFO L93 Difference]: Finished difference Result 90994 states and 154997 transitions. [2025-01-09 03:52:56,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:52:56,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 129 [2025-01-09 03:52:56,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:57,172 INFO L225 Difference]: With dead ends: 90994 [2025-01-09 03:52:57,173 INFO L226 Difference]: Without dead ends: 90616 [2025-01-09 03:52:57,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:52:57,231 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 76 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:57,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 834 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:57,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90616 states. [2025-01-09 03:53:00,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90616 to 90596. [2025-01-09 03:53:00,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90596 states, 75207 states have (on average 1.6019918358663423) internal successors, (120481), 75215 states have internal predecessors, (120481), 15343 states have call successors, (15343), 39 states have call predecessors, (15343), 45 states have return successors, (17537), 15341 states have call predecessors, (17537), 15338 states have call successors, (17537) [2025-01-09 03:53:00,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90596 states to 90596 states and 153361 transitions. [2025-01-09 03:53:00,397 INFO L78 Accepts]: Start accepts. Automaton has 90596 states and 153361 transitions. Word has length 129 [2025-01-09 03:53:00,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:00,398 INFO L471 AbstractCegarLoop]: Abstraction has 90596 states and 153361 transitions. [2025-01-09 03:53:00,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:53:00,398 INFO L276 IsEmpty]: Start isEmpty. Operand 90596 states and 153361 transitions. [2025-01-09 03:53:00,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 03:53:00,429 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:00,430 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:53:00,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:53:00,430 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:00,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:00,430 INFO L85 PathProgramCache]: Analyzing trace with hash -390297713, now seen corresponding path program 1 times [2025-01-09 03:53:00,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:00,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699531242] [2025-01-09 03:53:00,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:00,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:00,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 03:53:00,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 03:53:00,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:00,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:00,552 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 03:53:00,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:00,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699531242] [2025-01-09 03:53:00,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699531242] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:00,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:00,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:53:00,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640558930] [2025-01-09 03:53:00,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:00,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:53:00,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:00,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:53:00,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:53:00,554 INFO L87 Difference]: Start difference. First operand 90596 states and 153361 transitions. Second operand has 8 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:53:02,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:02,242 INFO L93 Difference]: Finished difference Result 90992 states and 153908 transitions. [2025-01-09 03:53:02,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 03:53:02,242 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 130 [2025-01-09 03:53:02,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:02,519 INFO L225 Difference]: With dead ends: 90992 [2025-01-09 03:53:02,519 INFO L226 Difference]: Without dead ends: 90620 [2025-01-09 03:53:02,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:53:02,558 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 4 mSDsluCounter, 2409 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2813 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:02,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2813 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:02,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90620 states. [2025-01-09 03:53:05,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90620 to 90614. [2025-01-09 03:53:05,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90614 states, 75216 states have (on average 1.6019065092533504) internal successors, (120489), 75230 states have internal predecessors, (120489), 15346 states have call successors, (15346), 39 states have call predecessors, (15346), 51 states have return successors, (17549), 15344 states have call predecessors, (17549), 15341 states have call successors, (17549) [2025-01-09 03:53:06,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90614 states to 90614 states and 153384 transitions. [2025-01-09 03:53:06,034 INFO L78 Accepts]: Start accepts. Automaton has 90614 states and 153384 transitions. Word has length 130 [2025-01-09 03:53:06,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:06,034 INFO L471 AbstractCegarLoop]: Abstraction has 90614 states and 153384 transitions. [2025-01-09 03:53:06,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:53:06,035 INFO L276 IsEmpty]: Start isEmpty. Operand 90614 states and 153384 transitions. [2025-01-09 03:53:06,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 03:53:06,064 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:06,064 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:53:06,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 03:53:06,065 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:06,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:06,065 INFO L85 PathProgramCache]: Analyzing trace with hash -553686296, now seen corresponding path program 1 times [2025-01-09 03:53:06,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:06,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617499472] [2025-01-09 03:53:06,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:06,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:06,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 03:53:06,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 03:53:06,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:06,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:06,234 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-09 03:53:06,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:06,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617499472] [2025-01-09 03:53:06,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617499472] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:53:06,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429729056] [2025-01-09 03:53:06,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:06,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:53:06,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:53:06,237 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:53:06,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 03:53:06,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 03:53:06,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 03:53:06,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:06,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:06,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 1056 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 03:53:06,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:53:06,616 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 03:53:06,616 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:53:06,849 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 03:53:06,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429729056] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:53:06,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:53:06,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 23 [2025-01-09 03:53:06,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64705798] [2025-01-09 03:53:06,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:53:06,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 03:53:06,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:06,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 03:53:06,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2025-01-09 03:53:06,851 INFO L87 Difference]: Start difference. First operand 90614 states and 153384 transitions. Second operand has 23 states, 22 states have (on average 10.636363636363637) internal successors, (234), 22 states have internal predecessors, (234), 6 states have call successors, (37), 6 states have call predecessors, (37), 10 states have return successors, (32), 6 states have call predecessors, (32), 6 states have call successors, (32) [2025-01-09 03:53:12,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:12,608 INFO L93 Difference]: Finished difference Result 181717 states and 313997 transitions. [2025-01-09 03:53:12,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-01-09 03:53:12,609 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 10.636363636363637) internal successors, (234), 22 states have internal predecessors, (234), 6 states have call successors, (37), 6 states have call predecessors, (37), 10 states have return successors, (32), 6 states have call predecessors, (32), 6 states have call successors, (32) Word has length 131 [2025-01-09 03:53:12,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:13,818 INFO L225 Difference]: With dead ends: 181717 [2025-01-09 03:53:13,819 INFO L226 Difference]: Without dead ends: 181327 [2025-01-09 03:53:13,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=325, Invalid=2431, Unknown=0, NotChecked=0, Total=2756 [2025-01-09 03:53:13,890 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 1262 mSDsluCounter, 3119 mSDsCounter, 0 mSdLazyCounter, 5783 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1294 SdHoareTripleChecker+Valid, 3287 SdHoareTripleChecker+Invalid, 6051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 5783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:13,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1294 Valid, 3287 Invalid, 6051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 5783 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-09 03:53:14,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181327 states.