./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec7_product28.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_spec7_product28.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 f29cc89d3ee64e709bcde3f8f1e5c1c29a2d05992b7eca470a9d177af894449a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:56:22,568 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:56:22,657 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:56:22,666 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:56:22,667 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:56:22,699 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:56:22,700 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:56:22,701 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:56:22,701 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:56:22,702 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:56:22,702 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:56:22,702 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:56:22,703 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:56:22,703 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:56:22,703 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:56:22,704 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:56:22,704 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:56:22,704 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:56:22,704 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:56:22,704 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:56:22,704 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:56:22,705 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:56:22,705 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:56:22,705 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:56:22,705 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:56:22,705 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:56:22,705 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:56:22,705 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:56:22,705 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:56:22,705 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:56:22,705 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:56:22,706 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:56:22,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:56:22,706 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:56:22,707 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:56:22,707 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:56:22,707 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:56:22,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:56:22,707 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:56:22,707 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:56:22,707 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:56:22,707 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:56:22,708 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:56:22,708 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:56:22,708 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:56:22,708 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:56:22,708 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:56:22,708 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:56:22,708 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 -> f29cc89d3ee64e709bcde3f8f1e5c1c29a2d05992b7eca470a9d177af894449a [2025-01-09 03:56:23,031 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:56:23,040 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:56:23,043 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:56:23,045 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:56:23,045 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:56:23,047 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec7_product28.cil.c [2025-01-09 03:56:24,441 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/115b51cb4/61d8c5f841ed457881daee95ac52c860/FLAG08bb363c3 [2025-01-09 03:56:24,886 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:56:24,886 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_product28.cil.c [2025-01-09 03:56:24,912 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/115b51cb4/61d8c5f841ed457881daee95ac52c860/FLAG08bb363c3 [2025-01-09 03:56:24,930 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/115b51cb4/61d8c5f841ed457881daee95ac52c860 [2025-01-09 03:56:24,932 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:56:24,935 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:56:24,936 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:56:24,936 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:56:24,945 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:56:24,946 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:56:24" (1/1) ... [2025-01-09 03:56:24,947 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@288db72e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:24, skipping insertion in model container [2025-01-09 03:56:24,947 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:56:24" (1/1) ... [2025-01-09 03:56:25,003 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:56:25,167 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_spec7_product28.cil.c[1542,1555] [2025-01-09 03:56:25,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:56:25,569 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:56:25,577 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [48] [2025-01-09 03:56:25,579 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [57] [2025-01-09 03:56:25,579 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [217] [2025-01-09 03:56:25,579 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [255] [2025-01-09 03:56:25,580 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [591] [2025-01-09 03:56:25,580 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [871] [2025-01-09 03:56:25,580 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptVerify_spec.i","") [1084] [2025-01-09 03:56:25,581 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1102] [2025-01-09 03:56:25,581 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1468] [2025-01-09 03:56:25,581 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1485] [2025-01-09 03:56:25,581 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2554] [2025-01-09 03:56:25,586 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_spec7_product28.cil.c[1542,1555] [2025-01-09 03:56:25,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:56:25,717 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:56:25,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:25 WrapperNode [2025-01-09 03:56:25,719 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:56:25,720 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:56:25,720 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:56:25,720 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:56:25,726 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:56:25" (1/1) ... [2025-01-09 03:56:25,755 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:56:25" (1/1) ... [2025-01-09 03:56:25,806 INFO L138 Inliner]: procedures = 128, calls = 195, calls flagged for inlining = 55, calls inlined = 45, statements flattened = 842 [2025-01-09 03:56:25,807 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:56:25,807 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:56:25,808 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:56:25,808 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:56:25,819 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:25" (1/1) ... [2025-01-09 03:56:25,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:25" (1/1) ... [2025-01-09 03:56:25,824 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:25" (1/1) ... [2025-01-09 03:56:25,851 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:56:25,851 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:25" (1/1) ... [2025-01-09 03:56:25,851 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:25" (1/1) ... [2025-01-09 03:56:25,868 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:25" (1/1) ... [2025-01-09 03:56:25,870 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:25" (1/1) ... [2025-01-09 03:56:25,885 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:25" (1/1) ... [2025-01-09 03:56:25,888 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:25" (1/1) ... [2025-01-09 03:56:25,895 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:25" (1/1) ... [2025-01-09 03:56:25,906 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:56:25,907 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:56:25,907 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:56:25,907 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:56:25,908 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:25" (1/1) ... [2025-01-09 03:56:25,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:56:25,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:56:25,938 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:56:25,942 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:56:25,961 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-01-09 03:56:25,962 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-01-09 03:56:25,962 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-01-09 03:56:25,962 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-01-09 03:56:25,962 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-01-09 03:56:25,963 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-01-09 03:56:25,963 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-01-09 03:56:25,963 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-01-09 03:56:25,964 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-01-09 03:56:25,964 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-01-09 03:56:25,964 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-01-09 03:56:25,964 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-01-09 03:56:25,964 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-01-09 03:56:25,964 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-01-09 03:56:25,964 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-01-09 03:56:25,965 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-01-09 03:56:25,965 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-01-09 03:56:25,965 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-01-09 03:56:25,965 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-01-09 03:56:25,965 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-01-09 03:56:25,965 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-01-09 03:56:25,966 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-01-09 03:56:25,966 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-01-09 03:56:25,966 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-01-09 03:56:25,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:56:25,966 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-01-09 03:56:25,966 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-01-09 03:56:25,966 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-01-09 03:56:25,968 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-01-09 03:56:25,968 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-01-09 03:56:25,968 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-01-09 03:56:25,968 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-01-09 03:56:25,968 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-01-09 03:56:25,968 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-01-09 03:56:25,969 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-01-09 03:56:25,969 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-01-09 03:56:25,969 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-01-09 03:56:25,969 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-01-09 03:56:25,969 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-01-09 03:56:25,969 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-01-09 03:56:25,969 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-01-09 03:56:25,969 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-01-09 03:56:25,969 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-01-09 03:56:25,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:56:25,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:56:25,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:56:25,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:56:25,969 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-01-09 03:56:25,969 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-01-09 03:56:25,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:56:25,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:56:26,171 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:56:26,173 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:56:27,006 INFO L? ?]: Removed 395 outVars from TransFormulas that were not future-live. [2025-01-09 03:56:27,007 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:56:27,028 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:56:27,031 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:56:27,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:56:27 BoogieIcfgContainer [2025-01-09 03:56:27,032 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:56:27,034 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:56:27,034 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:56:27,038 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:56:27,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:56:24" (1/3) ... [2025-01-09 03:56:27,039 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2624f243 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:56:27, skipping insertion in model container [2025-01-09 03:56:27,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:56:25" (2/3) ... [2025-01-09 03:56:27,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2624f243 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:56:27, skipping insertion in model container [2025-01-09 03:56:27,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:56:27" (3/3) ... [2025-01-09 03:56:27,042 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec7_product28.cil.c [2025-01-09 03:56:27,059 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:56:27,063 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec7_product28.cil.c that has 23 procedures, 323 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:56:27,138 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:56:27,147 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;@112b3dcb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:56:27,147 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:56:27,152 INFO L276 IsEmpty]: Start isEmpty. Operand has 323 states, 250 states have (on average 1.52) internal successors, (380), 254 states have internal predecessors, (380), 49 states have call successors, (49), 22 states have call predecessors, (49), 22 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-01-09 03:56:27,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 03:56:27,165 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:27,166 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 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] [2025-01-09 03:56:27,166 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:27,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:27,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1154192323, now seen corresponding path program 1 times [2025-01-09 03:56:27,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:27,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774204692] [2025-01-09 03:56:27,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:27,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:27,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 03:56:27,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 03:56:27,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:27,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:27,937 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:56:27,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:27,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774204692] [2025-01-09 03:56:27,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774204692] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:56:27,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908277912] [2025-01-09 03:56:27,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:27,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:56:27,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:56:27,942 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:56:27,944 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:56:28,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 03:56:28,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 03:56:28,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:28,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:28,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 1042 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 03:56:28,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:56:28,338 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 03:56:28,338 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:56:28,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908277912] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:28,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:56:28,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-01-09 03:56:28,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125844083] [2025-01-09 03:56:28,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:28,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 03:56:28,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:28,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 03:56:28,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:56:28,369 INFO L87 Difference]: Start difference. First operand has 323 states, 250 states have (on average 1.52) internal successors, (380), 254 states have internal predecessors, (380), 49 states have call successors, (49), 22 states have call predecessors, (49), 22 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:56:28,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:28,412 INFO L93 Difference]: Finished difference Result 498 states and 720 transitions. [2025-01-09 03:56:28,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 03:56:28,414 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 117 [2025-01-09 03:56:28,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:28,425 INFO L225 Difference]: With dead ends: 498 [2025-01-09 03:56:28,425 INFO L226 Difference]: Without dead ends: 316 [2025-01-09 03:56:28,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 118 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:56:28,434 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:56:28,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:28,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-01-09 03:56:28,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2025-01-09 03:56:28,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 244 states have (on average 1.5163934426229508) internal successors, (370), 247 states have internal predecessors, (370), 49 states have call successors, (49), 22 states have call predecessors, (49), 22 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 03:56:28,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 467 transitions. [2025-01-09 03:56:28,513 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 467 transitions. Word has length 117 [2025-01-09 03:56:28,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:28,514 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 467 transitions. [2025-01-09 03:56:28,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:56:28,514 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 467 transitions. [2025-01-09 03:56:28,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 03:56:28,522 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:28,522 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 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] [2025-01-09 03:56:28,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 03:56:28,723 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:56:28,723 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:28,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:28,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1416268157, now seen corresponding path program 1 times [2025-01-09 03:56:28,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:28,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074727269] [2025-01-09 03:56:28,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:28,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:28,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 03:56:28,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 03:56:28,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:28,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:29,023 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:56:29,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:29,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074727269] [2025-01-09 03:56:29,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074727269] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:56:29,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752071376] [2025-01-09 03:56:29,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:29,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:56:29,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:56:29,028 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:56:29,029 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:56:29,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 03:56:29,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 03:56:29,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:29,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:29,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 1042 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:56:29,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:56:29,435 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 03:56:29,440 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:56:29,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752071376] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:29,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:56:29,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:56:29,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427656364] [2025-01-09 03:56:29,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:29,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:56:29,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:29,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:56:29,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:56:29,442 INFO L87 Difference]: Start difference. First operand 316 states and 467 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:56:29,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:29,498 INFO L93 Difference]: Finished difference Result 487 states and 701 transitions. [2025-01-09 03:56:29,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:29,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 117 [2025-01-09 03:56:29,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:29,506 INFO L225 Difference]: With dead ends: 487 [2025-01-09 03:56:29,506 INFO L226 Difference]: Without dead ends: 318 [2025-01-09 03:56:29,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 117 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:56:29,510 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 1 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:56:29,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 928 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:29,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-01-09 03:56:29,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 317. [2025-01-09 03:56:29,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 245 states have (on average 1.5142857142857142) internal successors, (371), 248 states have internal predecessors, (371), 49 states have call successors, (49), 22 states have call predecessors, (49), 22 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 03:56:29,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 468 transitions. [2025-01-09 03:56:29,537 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 468 transitions. Word has length 117 [2025-01-09 03:56:29,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:29,537 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 468 transitions. [2025-01-09 03:56:29,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:56:29,537 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 468 transitions. [2025-01-09 03:56:29,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 03:56:29,542 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:29,542 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:56:29,550 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:56:29,743 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:56:29,743 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:29,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:29,744 INFO L85 PathProgramCache]: Analyzing trace with hash 981695411, now seen corresponding path program 1 times [2025-01-09 03:56:29,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:29,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366718962] [2025-01-09 03:56:29,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:29,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:29,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 03:56:29,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 03:56:29,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:29,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:30,001 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-09 03:56:30,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:30,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366718962] [2025-01-09 03:56:30,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366718962] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:56:30,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234472571] [2025-01-09 03:56:30,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:30,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:56:30,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:56:30,007 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:56:30,009 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:56:30,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 03:56:30,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 03:56:30,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:30,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:30,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 1053 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:56:30,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:56:30,356 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 03:56:30,356 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:56:30,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234472571] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:30,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:56:30,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:56:30,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501226853] [2025-01-09 03:56:30,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:30,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:56:30,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:30,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:56:30,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:56:30,360 INFO L87 Difference]: Start difference. First operand 317 states and 468 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:56:30,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:30,388 INFO L93 Difference]: Finished difference Result 659 states and 987 transitions. [2025-01-09 03:56:30,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:30,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 122 [2025-01-09 03:56:30,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:30,392 INFO L225 Difference]: With dead ends: 659 [2025-01-09 03:56:30,392 INFO L226 Difference]: Without dead ends: 368 [2025-01-09 03:56:30,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 122 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:56:30,393 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 99 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 893 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:56:30,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 893 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:30,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-01-09 03:56:30,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 360. [2025-01-09 03:56:30,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 277 states have (on average 1.5306859205776173) internal successors, (424), 280 states have internal predecessors, (424), 60 states have call successors, (60), 22 states have call predecessors, (60), 22 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2025-01-09 03:56:30,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 543 transitions. [2025-01-09 03:56:30,413 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 543 transitions. Word has length 122 [2025-01-09 03:56:30,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:30,413 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 543 transitions. [2025-01-09 03:56:30,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:56:30,413 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 543 transitions. [2025-01-09 03:56:30,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 03:56:30,415 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:30,415 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:56:30,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 03:56:30,616 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:56:30,616 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:30,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:30,617 INFO L85 PathProgramCache]: Analyzing trace with hash -960086028, now seen corresponding path program 1 times [2025-01-09 03:56:30,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:30,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249171279] [2025-01-09 03:56:30,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:30,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:30,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 03:56:30,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 03:56:30,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:30,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:30,826 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-09 03:56:30,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:30,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249171279] [2025-01-09 03:56:30,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249171279] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:56:30,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295563040] [2025-01-09 03:56:30,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:30,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:56:30,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:56:30,829 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:56:30,831 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:56:30,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 03:56:31,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 03:56:31,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:31,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:31,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 1058 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 03:56:31,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:56:31,226 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 03:56:31,227 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:56:31,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295563040] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:31,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:56:31,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-01-09 03:56:31,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290689714] [2025-01-09 03:56:31,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:31,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:56:31,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:31,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:56:31,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:56:31,228 INFO L87 Difference]: Start difference. First operand 360 states and 543 transitions. Second operand has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 03:56:31,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:31,318 INFO L93 Difference]: Finished difference Result 711 states and 1076 transitions. [2025-01-09 03:56:31,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:56:31,318 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 123 [2025-01-09 03:56:31,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:31,324 INFO L225 Difference]: With dead ends: 711 [2025-01-09 03:56:31,324 INFO L226 Difference]: Without dead ends: 362 [2025-01-09 03:56:31,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 121 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:56:31,327 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 2 mSDsluCounter, 1366 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1825 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:56:31,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1825 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:31,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-01-09 03:56:31,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2025-01-09 03:56:31,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 278 states have (on average 1.5287769784172662) internal successors, (425), 282 states have internal predecessors, (425), 60 states have call successors, (60), 22 states have call predecessors, (60), 23 states have return successors, (61), 59 states have call predecessors, (61), 59 states have call successors, (61) [2025-01-09 03:56:31,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 546 transitions. [2025-01-09 03:56:31,357 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 546 transitions. Word has length 123 [2025-01-09 03:56:31,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:31,357 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 546 transitions. [2025-01-09 03:56:31,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.75) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 03:56:31,358 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 546 transitions. [2025-01-09 03:56:31,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 03:56:31,364 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:31,364 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:56:31,374 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:56:31,568 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:56:31,568 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:31,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:31,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1676940689, now seen corresponding path program 1 times [2025-01-09 03:56:31,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:31,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002329592] [2025-01-09 03:56:31,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:31,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:31,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 03:56:31,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 03:56:31,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:31,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:31,794 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-09 03:56:31,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:31,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002329592] [2025-01-09 03:56:31,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002329592] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:56:31,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849387384] [2025-01-09 03:56:31,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:31,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:56:31,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:56:31,798 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:56:31,800 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:56:31,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 03:56:32,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 03:56:32,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:32,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:32,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 1059 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 03:56:32,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:56:32,188 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 03:56:32,188 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:56:32,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849387384] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:32,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:56:32,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-01-09 03:56:32,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454659646] [2025-01-09 03:56:32,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:32,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:56:32,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:32,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:56:32,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:56:32,190 INFO L87 Difference]: Start difference. First operand 362 states and 546 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 03:56:32,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:32,279 INFO L93 Difference]: Finished difference Result 713 states and 1081 transitions. [2025-01-09 03:56:32,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:56:32,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 124 [2025-01-09 03:56:32,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:32,283 INFO L225 Difference]: With dead ends: 713 [2025-01-09 03:56:32,283 INFO L226 Difference]: Without dead ends: 364 [2025-01-09 03:56:32,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 122 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:56:32,288 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 2 mSDsluCounter, 1354 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1811 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:56:32,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1811 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:32,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-01-09 03:56:32,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2025-01-09 03:56:32,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 279 states have (on average 1.5268817204301075) internal successors, (426), 284 states have internal predecessors, (426), 60 states have call successors, (60), 22 states have call predecessors, (60), 24 states have return successors, (66), 59 states have call predecessors, (66), 59 states have call successors, (66) [2025-01-09 03:56:32,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 552 transitions. [2025-01-09 03:56:32,314 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 552 transitions. Word has length 124 [2025-01-09 03:56:32,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:32,314 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 552 transitions. [2025-01-09 03:56:32,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 03:56:32,315 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 552 transitions. [2025-01-09 03:56:32,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 03:56:32,317 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:32,317 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:56:32,327 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:56:32,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:56:32,518 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:32,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:32,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1991257488, now seen corresponding path program 1 times [2025-01-09 03:56:32,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:32,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128841984] [2025-01-09 03:56:32,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:32,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:32,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 03:56:32,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 03:56:32,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:32,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:32,707 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-09 03:56:32,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:32,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128841984] [2025-01-09 03:56:32,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128841984] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:32,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:32,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:56:32,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810240563] [2025-01-09 03:56:32,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:32,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:56:32,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:32,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:56:32,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:56:32,709 INFO L87 Difference]: Start difference. First operand 364 states and 552 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 03:56:32,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:32,757 INFO L93 Difference]: Finished difference Result 705 states and 1072 transitions. [2025-01-09 03:56:32,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:56:32,758 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 125 [2025-01-09 03:56:32,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:32,761 INFO L225 Difference]: With dead ends: 705 [2025-01-09 03:56:32,761 INFO L226 Difference]: Without dead ends: 364 [2025-01-09 03:56:32,763 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:56:32,763 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 2 mSDsluCounter, 1369 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1829 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:56:32,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1829 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:32,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-01-09 03:56:32,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2025-01-09 03:56:32,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 279 states have (on average 1.5268817204301075) internal successors, (426), 284 states have internal predecessors, (426), 60 states have call successors, (60), 22 states have call predecessors, (60), 24 states have return successors, (65), 59 states have call predecessors, (65), 59 states have call successors, (65) [2025-01-09 03:56:32,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 551 transitions. [2025-01-09 03:56:32,786 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 551 transitions. Word has length 125 [2025-01-09 03:56:32,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:32,787 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 551 transitions. [2025-01-09 03:56:32,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 03:56:32,787 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 551 transitions. [2025-01-09 03:56:32,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 03:56:32,791 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:32,791 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:56:32,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:56:32,792 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:32,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:32,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1104996937, now seen corresponding path program 2 times [2025-01-09 03:56:32,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:32,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910730550] [2025-01-09 03:56:32,792 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:56:32,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:32,819 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 126 statements into 2 equivalence classes. [2025-01-09 03:56:32,830 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 58 of 126 statements. [2025-01-09 03:56:32,831 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 03:56:32,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:33,021 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:56:33,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:33,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910730550] [2025-01-09 03:56:33,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910730550] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:33,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:33,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:56:33,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394613444] [2025-01-09 03:56:33,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:33,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:56:33,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:33,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:56:33,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:56:33,024 INFO L87 Difference]: Start difference. First operand 364 states and 551 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 03:56:33,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:33,468 INFO L93 Difference]: Finished difference Result 956 states and 1429 transitions. [2025-01-09 03:56:33,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 03:56:33,468 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) Word has length 126 [2025-01-09 03:56:33,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:33,477 INFO L225 Difference]: With dead ends: 956 [2025-01-09 03:56:33,477 INFO L226 Difference]: Without dead ends: 795 [2025-01-09 03:56:33,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-01-09 03:56:33,479 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 903 mSDsluCounter, 2238 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 2712 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 03:56:33,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 2712 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 03:56:33,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2025-01-09 03:56:33,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 723. [2025-01-09 03:56:33,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 556 states have (on average 1.5323741007194245) internal successors, (852), 563 states have internal predecessors, (852), 118 states have call successors, (118), 45 states have call predecessors, (118), 48 states have return successors, (132), 118 states have call predecessors, (132), 116 states have call successors, (132) [2025-01-09 03:56:33,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1102 transitions. [2025-01-09 03:56:33,543 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1102 transitions. Word has length 126 [2025-01-09 03:56:33,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:33,544 INFO L471 AbstractCegarLoop]: Abstraction has 723 states and 1102 transitions. [2025-01-09 03:56:33,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 03:56:33,544 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1102 transitions. [2025-01-09 03:56:33,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 03:56:33,548 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:33,548 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:56:33,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:56:33,548 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:33,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:33,549 INFO L85 PathProgramCache]: Analyzing trace with hash -119722744, now seen corresponding path program 1 times [2025-01-09 03:56:33,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:33,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392964618] [2025-01-09 03:56:33,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:33,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:33,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 03:56:33,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 03:56:33,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:33,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:33,698 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-09 03:56:33,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:33,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392964618] [2025-01-09 03:56:33,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392964618] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:33,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:33,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:56:33,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352449095] [2025-01-09 03:56:33,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:33,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:56:33,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:33,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:56:33,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:56:33,700 INFO L87 Difference]: Start difference. First operand 723 states and 1102 transitions. Second operand has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 03:56:33,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:33,757 INFO L93 Difference]: Finished difference Result 1415 states and 2164 transitions. [2025-01-09 03:56:33,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:56:33,758 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 127 [2025-01-09 03:56:33,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:33,768 INFO L225 Difference]: With dead ends: 1415 [2025-01-09 03:56:33,768 INFO L226 Difference]: Without dead ends: 727 [2025-01-09 03:56:33,771 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:56:33,772 INFO L435 NwaCegarLoop]: 461 mSDtfsCounter, 1 mSDsluCounter, 1371 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1832 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:56:33,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1832 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:33,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2025-01-09 03:56:33,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2025-01-09 03:56:33,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 558 states have (on average 1.5304659498207884) internal successors, (854), 567 states have internal predecessors, (854), 118 states have call successors, (118), 45 states have call predecessors, (118), 50 states have return successors, (135), 118 states have call predecessors, (135), 116 states have call successors, (135) [2025-01-09 03:56:33,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1107 transitions. [2025-01-09 03:56:33,819 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1107 transitions. Word has length 127 [2025-01-09 03:56:33,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:33,820 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 1107 transitions. [2025-01-09 03:56:33,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 03:56:33,820 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1107 transitions. [2025-01-09 03:56:33,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 03:56:33,823 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:33,824 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:56:33,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:56:33,825 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:33,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:33,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1102807172, now seen corresponding path program 1 times [2025-01-09 03:56:33,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:33,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066915521] [2025-01-09 03:56:33,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:33,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:33,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 03:56:33,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 03:56:33,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:33,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:34,009 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-09 03:56:34,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:34,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066915521] [2025-01-09 03:56:34,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066915521] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:34,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:34,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:56:34,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291540286] [2025-01-09 03:56:34,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:34,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:56:34,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:34,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:56:34,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:56:34,012 INFO L87 Difference]: Start difference. First operand 727 states and 1107 transitions. Second operand has 8 states, 7 states have (on average 12.0) internal successors, (84), 8 states have internal predecessors, (84), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-01-09 03:56:34,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:34,159 INFO L93 Difference]: Finished difference Result 1414 states and 2157 transitions. [2025-01-09 03:56:34,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 03:56:34,159 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.0) internal successors, (84), 8 states have internal predecessors, (84), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 128 [2025-01-09 03:56:34,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:34,165 INFO L225 Difference]: With dead ends: 1414 [2025-01-09 03:56:34,165 INFO L226 Difference]: Without dead ends: 731 [2025-01-09 03:56:34,168 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:56:34,170 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 7 mSDsluCounter, 2677 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3128 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:56:34,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3128 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:56:34,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2025-01-09 03:56:34,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 729. [2025-01-09 03:56:34,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 560 states have (on average 1.5285714285714285) internal successors, (856), 568 states have internal predecessors, (856), 118 states have call successors, (118), 46 states have call predecessors, (118), 50 states have return successors, (133), 118 states have call predecessors, (133), 116 states have call successors, (133) [2025-01-09 03:56:34,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 1107 transitions. [2025-01-09 03:56:34,210 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 1107 transitions. Word has length 128 [2025-01-09 03:56:34,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:34,210 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 1107 transitions. [2025-01-09 03:56:34,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.0) internal successors, (84), 8 states have internal predecessors, (84), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-01-09 03:56:34,210 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 1107 transitions. [2025-01-09 03:56:34,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 03:56:34,213 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:34,214 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:56:34,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:56:34,214 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:34,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:34,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1741502677, now seen corresponding path program 2 times [2025-01-09 03:56:34,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:34,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583752237] [2025-01-09 03:56:34,214 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:56:34,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:34,234 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 129 statements into 2 equivalence classes. [2025-01-09 03:56:34,241 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 61 of 129 statements. [2025-01-09 03:56:34,241 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 03:56:34,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:34,383 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:56:34,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:34,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583752237] [2025-01-09 03:56:34,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583752237] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:34,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:34,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:56:34,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734102856] [2025-01-09 03:56:34,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:34,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:56:34,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:34,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:56:34,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:56:34,385 INFO L87 Difference]: Start difference. First operand 729 states and 1107 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 03:56:34,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:34,791 INFO L93 Difference]: Finished difference Result 1921 states and 2886 transitions. [2025-01-09 03:56:34,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 03:56:34,792 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) Word has length 129 [2025-01-09 03:56:34,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:34,804 INFO L225 Difference]: With dead ends: 1921 [2025-01-09 03:56:34,804 INFO L226 Difference]: Without dead ends: 1597 [2025-01-09 03:56:34,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-01-09 03:56:34,807 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 513 mSDsluCounter, 2823 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 3323 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 03:56:34,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 3323 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 03:56:34,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1597 states. [2025-01-09 03:56:34,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1597 to 1455. [2025-01-09 03:56:34,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1455 states, 1118 states have (on average 1.5304114490161003) internal successors, (1711), 1136 states have internal predecessors, (1711), 232 states have call successors, (232), 92 states have call predecessors, (232), 104 states have return successors, (288), 234 states have call predecessors, (288), 228 states have call successors, (288) [2025-01-09 03:56:34,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1455 states and 2231 transitions. [2025-01-09 03:56:34,900 INFO L78 Accepts]: Start accepts. Automaton has 1455 states and 2231 transitions. Word has length 129 [2025-01-09 03:56:34,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:34,900 INFO L471 AbstractCegarLoop]: Abstraction has 1455 states and 2231 transitions. [2025-01-09 03:56:34,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 03:56:34,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1455 states and 2231 transitions. [2025-01-09 03:56:34,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 03:56:34,908 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:34,908 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:56:34,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 03:56:34,909 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:34,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:34,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1687631999, now seen corresponding path program 1 times [2025-01-09 03:56:34,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:34,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194520340] [2025-01-09 03:56:34,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:34,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:34,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 03:56:34,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 03:56:34,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:34,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:35,034 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 03:56:35,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:35,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194520340] [2025-01-09 03:56:35,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194520340] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:56:35,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000098834] [2025-01-09 03:56:35,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:35,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:56:35,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:56:35,037 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:56:35,079 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:56:35,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 03:56:35,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 03:56:35,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:35,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:35,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 1064 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 03:56:35,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:56:35,405 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 03:56:35,406 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:56:35,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000098834] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:35,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:56:35,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-01-09 03:56:35,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302978552] [2025-01-09 03:56:35,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:35,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:56:35,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:35,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:56:35,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:56:35,407 INFO L87 Difference]: Start difference. First operand 1455 states and 2231 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:56:35,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:35,519 INFO L93 Difference]: Finished difference Result 2195 states and 3358 transitions. [2025-01-09 03:56:35,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:56:35,520 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2025-01-09 03:56:35,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:35,532 INFO L225 Difference]: With dead ends: 2195 [2025-01-09 03:56:35,533 INFO L226 Difference]: Without dead ends: 1459 [2025-01-09 03:56:35,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 127 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:56:35,537 INFO L435 NwaCegarLoop]: 461 mSDtfsCounter, 1 mSDsluCounter, 1365 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1826 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:56:35,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1826 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:35,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2025-01-09 03:56:35,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 1451. [2025-01-09 03:56:35,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1451 states, 1116 states have (on average 1.5304659498207884) internal successors, (1708), 1134 states have internal predecessors, (1708), 230 states have call successors, (230), 92 states have call predecessors, (230), 104 states have return successors, (286), 232 states have call predecessors, (286), 226 states have call successors, (286) [2025-01-09 03:56:35,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 2224 transitions. [2025-01-09 03:56:35,613 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 2224 transitions. Word has length 129 [2025-01-09 03:56:35,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:35,614 INFO L471 AbstractCegarLoop]: Abstraction has 1451 states and 2224 transitions. [2025-01-09 03:56:35,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:56:35,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2224 transitions. [2025-01-09 03:56:35,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 03:56:35,620 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:35,621 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:56:35,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 03:56:35,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 03:56:35,821 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:35,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:35,822 INFO L85 PathProgramCache]: Analyzing trace with hash 796789112, now seen corresponding path program 1 times [2025-01-09 03:56:35,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:35,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850728870] [2025-01-09 03:56:35,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:35,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:35,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 03:56:35,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 03:56:35,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:35,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:35,975 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-09 03:56:35,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:35,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850728870] [2025-01-09 03:56:35,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850728870] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:35,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:35,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:56:35,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2413312] [2025-01-09 03:56:35,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:35,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:56:35,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:35,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:56:35,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:56:35,977 INFO L87 Difference]: Start difference. First operand 1451 states and 2224 transitions. Second operand has 8 states, 7 states have (on average 12.285714285714286) internal successors, (86), 8 states have internal predecessors, (86), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-01-09 03:56:36,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:36,159 INFO L93 Difference]: Finished difference Result 2843 states and 4364 transitions. [2025-01-09 03:56:36,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 03:56:36,159 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.285714285714286) internal successors, (86), 8 states have internal predecessors, (86), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 130 [2025-01-09 03:56:36,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:36,171 INFO L225 Difference]: With dead ends: 2843 [2025-01-09 03:56:36,171 INFO L226 Difference]: Without dead ends: 1459 [2025-01-09 03:56:36,176 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:56:36,177 INFO L435 NwaCegarLoop]: 453 mSDtfsCounter, 5 mSDsluCounter, 2689 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3142 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:56:36,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3142 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:56:36,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2025-01-09 03:56:36,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 1455. [2025-01-09 03:56:36,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1455 states, 1120 states have (on average 1.5285714285714285) internal successors, (1712), 1137 states have internal predecessors, (1712), 230 states have call successors, (230), 93 states have call predecessors, (230), 104 states have return successors, (282), 232 states have call predecessors, (282), 226 states have call successors, (282) [2025-01-09 03:56:36,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1455 states and 2224 transitions. [2025-01-09 03:56:36,251 INFO L78 Accepts]: Start accepts. Automaton has 1455 states and 2224 transitions. Word has length 130 [2025-01-09 03:56:36,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:36,253 INFO L471 AbstractCegarLoop]: Abstraction has 1455 states and 2224 transitions. [2025-01-09 03:56:36,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.285714285714286) internal successors, (86), 8 states have internal predecessors, (86), 4 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-01-09 03:56:36,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1455 states and 2224 transitions. [2025-01-09 03:56:36,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 03:56:36,259 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:36,259 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:56:36,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:56:36,259 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:36,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:36,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1620096680, now seen corresponding path program 1 times [2025-01-09 03:56:36,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:36,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095263047] [2025-01-09 03:56:36,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:36,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:36,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 03:56:36,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 03:56:36,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:36,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:36,407 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 03:56:36,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:36,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095263047] [2025-01-09 03:56:36,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095263047] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:36,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:36,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:56:36,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986840647] [2025-01-09 03:56:36,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:36,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:56:36,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:36,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:56:36,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:56:36,408 INFO L87 Difference]: Start difference. First operand 1455 states and 2224 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 03:56:36,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:36,498 INFO L93 Difference]: Finished difference Result 2853 states and 4377 transitions. [2025-01-09 03:56:36,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:56:36,499 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 131 [2025-01-09 03:56:36,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:36,509 INFO L225 Difference]: With dead ends: 2853 [2025-01-09 03:56:36,509 INFO L226 Difference]: Without dead ends: 1467 [2025-01-09 03:56:36,514 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:56:36,515 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 0 mSDsluCounter, 1354 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1811 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:56:36,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1811 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:36,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2025-01-09 03:56:36,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1461. [2025-01-09 03:56:36,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1461 states, 1123 states have (on average 1.527159394479074) internal successors, (1715), 1143 states have internal predecessors, (1715), 230 states have call successors, (230), 93 states have call predecessors, (230), 107 states have return successors, (287), 232 states have call predecessors, (287), 226 states have call successors, (287) [2025-01-09 03:56:36,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1461 states and 2232 transitions. [2025-01-09 03:56:36,589 INFO L78 Accepts]: Start accepts. Automaton has 1461 states and 2232 transitions. Word has length 131 [2025-01-09 03:56:36,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:36,589 INFO L471 AbstractCegarLoop]: Abstraction has 1461 states and 2232 transitions. [2025-01-09 03:56:36,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 03:56:36,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 2232 transitions. [2025-01-09 03:56:36,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 03:56:36,595 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:36,596 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:56:36,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:56:36,596 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:36,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:36,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1033820458, now seen corresponding path program 1 times [2025-01-09 03:56:36,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:36,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041120753] [2025-01-09 03:56:36,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:36,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:36,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 03:56:36,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 03:56:36,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:36,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:36,703 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 03:56:36,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:36,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041120753] [2025-01-09 03:56:36,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041120753] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:56:36,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70214016] [2025-01-09 03:56:36,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:36,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:56:36,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:56:36,706 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:56:36,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 03:56:36,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 03:56:36,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 03:56:36,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:36,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:37,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 1066 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:56:37,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:56:37,029 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 03:56:37,029 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:56:37,122 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 03:56:37,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70214016] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:56:37,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:56:37,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 03:56:37,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450006993] [2025-01-09 03:56:37,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:56:37,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:56:37,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:37,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:56:37,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:56:37,124 INFO L87 Difference]: Start difference. First operand 1461 states and 2232 transitions. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 03:56:37,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:37,342 INFO L93 Difference]: Finished difference Result 3427 states and 5465 transitions. [2025-01-09 03:56:37,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:56:37,343 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 131 [2025-01-09 03:56:37,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:37,363 INFO L225 Difference]: With dead ends: 3427 [2025-01-09 03:56:37,363 INFO L226 Difference]: Without dead ends: 2745 [2025-01-09 03:56:37,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 259 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:56:37,368 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 377 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 1653 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:56:37,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 1653 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:56:37,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2025-01-09 03:56:37,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 2649. [2025-01-09 03:56:37,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2649 states, 2055 states have (on average 1.597566909975669) internal successors, (3283), 2075 states have internal predecessors, (3283), 486 states have call successors, (486), 93 states have call predecessors, (486), 107 states have return successors, (628), 488 states have call predecessors, (628), 482 states have call successors, (628) [2025-01-09 03:56:37,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2649 states to 2649 states and 4397 transitions. [2025-01-09 03:56:37,562 INFO L78 Accepts]: Start accepts. Automaton has 2649 states and 4397 transitions. Word has length 131 [2025-01-09 03:56:37,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:37,562 INFO L471 AbstractCegarLoop]: Abstraction has 2649 states and 4397 transitions. [2025-01-09 03:56:37,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 states have internal predecessors, (115), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 03:56:37,562 INFO L276 IsEmpty]: Start isEmpty. Operand 2649 states and 4397 transitions. [2025-01-09 03:56:37,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-01-09 03:56:37,582 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:37,582 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:56:37,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 03:56:37,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:56:37,783 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:37,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:37,783 INFO L85 PathProgramCache]: Analyzing trace with hash 2044509406, now seen corresponding path program 1 times [2025-01-09 03:56:37,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:37,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153689509] [2025-01-09 03:56:37,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:37,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:37,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 03:56:37,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 03:56:37,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:37,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:37,864 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 03:56:37,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:37,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153689509] [2025-01-09 03:56:37,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153689509] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:37,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:37,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:56:37,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436642095] [2025-01-09 03:56:37,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:37,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:56:37,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:37,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:56:37,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:37,867 INFO L87 Difference]: Start difference. First operand 2649 states and 4397 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:56:38,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:38,002 INFO L93 Difference]: Finished difference Result 6277 states and 10611 transitions. [2025-01-09 03:56:38,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:38,003 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 138 [2025-01-09 03:56:38,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:38,033 INFO L225 Difference]: With dead ends: 6277 [2025-01-09 03:56:38,034 INFO L226 Difference]: Without dead ends: 3853 [2025-01-09 03:56:38,046 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:56:38,047 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 97 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 948 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:56:38,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 948 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:38,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3853 states. [2025-01-09 03:56:38,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3853 to 3821. [2025-01-09 03:56:38,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3821 states, 2971 states have (on average 1.6139347021204982) internal successors, (4795), 2991 states have internal predecessors, (4795), 742 states have call successors, (742), 93 states have call predecessors, (742), 107 states have return successors, (969), 744 states have call predecessors, (969), 738 states have call successors, (969) [2025-01-09 03:56:38,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3821 states to 3821 states and 6506 transitions. [2025-01-09 03:56:38,242 INFO L78 Accepts]: Start accepts. Automaton has 3821 states and 6506 transitions. Word has length 138 [2025-01-09 03:56:38,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:38,243 INFO L471 AbstractCegarLoop]: Abstraction has 3821 states and 6506 transitions. [2025-01-09 03:56:38,243 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:56:38,243 INFO L276 IsEmpty]: Start isEmpty. Operand 3821 states and 6506 transitions. [2025-01-09 03:56:38,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 03:56:38,267 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:38,267 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:56:38,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:56:38,268 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:38,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:38,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1192248238, now seen corresponding path program 1 times [2025-01-09 03:56:38,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:38,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483068182] [2025-01-09 03:56:38,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:38,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:38,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 03:56:38,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 03:56:38,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:38,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:38,361 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 03:56:38,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:38,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483068182] [2025-01-09 03:56:38,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483068182] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:38,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:38,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:56:38,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285271661] [2025-01-09 03:56:38,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:38,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:56:38,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:38,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:56:38,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:38,368 INFO L87 Difference]: Start difference. First operand 3821 states and 6506 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:56:38,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:38,554 INFO L93 Difference]: Finished difference Result 9069 states and 15564 transitions. [2025-01-09 03:56:38,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:38,555 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 139 [2025-01-09 03:56:38,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:38,598 INFO L225 Difference]: With dead ends: 9069 [2025-01-09 03:56:38,598 INFO L226 Difference]: Without dead ends: 5677 [2025-01-09 03:56:38,616 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:56:38,618 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 95 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 934 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:56:38,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 934 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:38,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5677 states. [2025-01-09 03:56:38,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5677 to 5645. [2025-01-09 03:56:38,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5645 states, 4415 states have (on average 1.6251415628539072) internal successors, (7175), 4435 states have internal predecessors, (7175), 1122 states have call successors, (1122), 93 states have call predecessors, (1122), 107 states have return successors, (1413), 1124 states have call predecessors, (1413), 1118 states have call successors, (1413) [2025-01-09 03:56:38,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5645 states to 5645 states and 9710 transitions. [2025-01-09 03:56:38,944 INFO L78 Accepts]: Start accepts. Automaton has 5645 states and 9710 transitions. Word has length 139 [2025-01-09 03:56:38,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:38,944 INFO L471 AbstractCegarLoop]: Abstraction has 5645 states and 9710 transitions. [2025-01-09 03:56:38,945 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, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:56:38,945 INFO L276 IsEmpty]: Start isEmpty. Operand 5645 states and 9710 transitions. [2025-01-09 03:56:38,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-01-09 03:56:38,979 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:38,979 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:56:38,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:56:38,979 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:38,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:38,980 INFO L85 PathProgramCache]: Analyzing trace with hash 2094042944, now seen corresponding path program 1 times [2025-01-09 03:56:38,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:38,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559289078] [2025-01-09 03:56:38,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:38,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:39,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-01-09 03:56:39,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-01-09 03:56:39,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:39,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:39,072 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 03:56:39,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:39,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559289078] [2025-01-09 03:56:39,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559289078] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:39,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:39,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:56:39,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035382074] [2025-01-09 03:56:39,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:39,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:56:39,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:39,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:56:39,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:39,073 INFO L87 Difference]: Start difference. First operand 5645 states and 9710 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:56:39,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:39,297 INFO L93 Difference]: Finished difference Result 13145 states and 22856 transitions. [2025-01-09 03:56:39,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:39,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 140 [2025-01-09 03:56:39,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:39,371 INFO L225 Difference]: With dead ends: 13145 [2025-01-09 03:56:39,371 INFO L226 Difference]: Without dead ends: 8413 [2025-01-09 03:56:39,397 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:56:39,398 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 93 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 923 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:56:39,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 923 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:39,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8413 states. [2025-01-09 03:56:39,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8413 to 8381. [2025-01-09 03:56:39,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8381 states, 6659 states have (on average 1.6343294789007359) internal successors, (10883), 6679 states have internal predecessors, (10883), 1614 states have call successors, (1614), 93 states have call predecessors, (1614), 107 states have return successors, (2081), 1616 states have call predecessors, (2081), 1610 states have call successors, (2081) [2025-01-09 03:56:39,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8381 states to 8381 states and 14578 transitions. [2025-01-09 03:56:39,867 INFO L78 Accepts]: Start accepts. Automaton has 8381 states and 14578 transitions. Word has length 140 [2025-01-09 03:56:39,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:39,868 INFO L471 AbstractCegarLoop]: Abstraction has 8381 states and 14578 transitions. [2025-01-09 03:56:39,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:56:39,868 INFO L276 IsEmpty]: Start isEmpty. Operand 8381 states and 14578 transitions. [2025-01-09 03:56:39,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 03:56:39,919 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:39,919 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:56:39,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:56:39,919 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:39,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:39,920 INFO L85 PathProgramCache]: Analyzing trace with hash -406162993, now seen corresponding path program 1 times [2025-01-09 03:56:39,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:39,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708033617] [2025-01-09 03:56:39,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:39,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:39,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 03:56:39,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 03:56:39,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:39,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:39,985 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 03:56:39,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:39,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708033617] [2025-01-09 03:56:39,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708033617] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:39,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:39,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:56:39,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214933114] [2025-01-09 03:56:39,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:39,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:56:39,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:39,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:56:39,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:39,988 INFO L87 Difference]: Start difference. First operand 8381 states and 14578 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:56:40,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:40,451 INFO L93 Difference]: Finished difference Result 19437 states and 34158 transitions. [2025-01-09 03:56:40,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:40,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 141 [2025-01-09 03:56:40,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:40,519 INFO L225 Difference]: With dead ends: 19437 [2025-01-09 03:56:40,519 INFO L226 Difference]: Without dead ends: 12757 [2025-01-09 03:56:40,558 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:56:40,559 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 91 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 931 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:56:40,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 931 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:40,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12757 states. [2025-01-09 03:56:41,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12757 to 12725. [2025-01-09 03:56:41,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12725 states, 10287 states have (on average 1.6404199475065617) internal successors, (16875), 10307 states have internal predecessors, (16875), 2330 states have call successors, (2330), 93 states have call predecessors, (2330), 107 states have return successors, (3090), 2332 states have call predecessors, (3090), 2326 states have call successors, (3090) [2025-01-09 03:56:41,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12725 states to 12725 states and 22295 transitions. [2025-01-09 03:56:41,257 INFO L78 Accepts]: Start accepts. Automaton has 12725 states and 22295 transitions. Word has length 141 [2025-01-09 03:56:41,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:41,257 INFO L471 AbstractCegarLoop]: Abstraction has 12725 states and 22295 transitions. [2025-01-09 03:56:41,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:56:41,257 INFO L276 IsEmpty]: Start isEmpty. Operand 12725 states and 22295 transitions. [2025-01-09 03:56:41,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 03:56:41,307 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:41,307 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:56:41,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:56:41,308 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:41,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:41,308 INFO L85 PathProgramCache]: Analyzing trace with hash -732774340, now seen corresponding path program 1 times [2025-01-09 03:56:41,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:41,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131098263] [2025-01-09 03:56:41,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:41,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:41,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 03:56:41,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 03:56:41,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:41,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:41,366 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 03:56:41,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:41,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131098263] [2025-01-09 03:56:41,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131098263] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:41,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:41,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:56:41,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761222743] [2025-01-09 03:56:41,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:41,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:56:41,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:41,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:56:41,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:41,368 INFO L87 Difference]: Start difference. First operand 12725 states and 22295 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:56:41,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:41,926 INFO L93 Difference]: Finished difference Result 30801 states and 54365 transitions. [2025-01-09 03:56:41,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:41,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 142 [2025-01-09 03:56:41,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:42,034 INFO L225 Difference]: With dead ends: 30801 [2025-01-09 03:56:42,034 INFO L226 Difference]: Without dead ends: 20661 [2025-01-09 03:56:42,074 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:56:42,075 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 89 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 947 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:56:42,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 947 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:42,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20661 states. [2025-01-09 03:56:43,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20661 to 20629. [2025-01-09 03:56:43,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20629 states, 16687 states have (on average 1.6337867801282435) internal successors, (27263), 16707 states have internal predecessors, (27263), 3834 states have call successors, (3834), 93 states have call predecessors, (3834), 107 states have return successors, (5104), 3836 states have call predecessors, (5104), 3830 states have call successors, (5104) [2025-01-09 03:56:43,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20629 states to 20629 states and 36201 transitions. [2025-01-09 03:56:43,144 INFO L78 Accepts]: Start accepts. Automaton has 20629 states and 36201 transitions. Word has length 142 [2025-01-09 03:56:43,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:43,144 INFO L471 AbstractCegarLoop]: Abstraction has 20629 states and 36201 transitions. [2025-01-09 03:56:43,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:56:43,145 INFO L276 IsEmpty]: Start isEmpty. Operand 20629 states and 36201 transitions. [2025-01-09 03:56:43,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 03:56:43,328 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:43,328 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:56:43,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:56:43,329 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:43,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:43,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1191709907, now seen corresponding path program 1 times [2025-01-09 03:56:43,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:43,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443286455] [2025-01-09 03:56:43,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:43,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:43,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 03:56:43,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 03:56:43,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:43,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:43,406 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 03:56:43,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:43,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443286455] [2025-01-09 03:56:43,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443286455] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:43,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:43,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:56:43,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016662602] [2025-01-09 03:56:43,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:43,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:56:43,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:43,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:56:43,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:43,409 INFO L87 Difference]: Start difference. First operand 20629 states and 36201 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:56:44,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:44,602 INFO L93 Difference]: Finished difference Result 50837 states and 89593 transitions. [2025-01-09 03:56:44,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:44,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 143 [2025-01-09 03:56:44,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:44,831 INFO L225 Difference]: With dead ends: 50837 [2025-01-09 03:56:44,831 INFO L226 Difference]: Without dead ends: 34237 [2025-01-09 03:56:44,909 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:56:44,911 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 87 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 928 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:56:44,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 928 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:44,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34237 states. [2025-01-09 03:56:46,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34237 to 34205. [2025-01-09 03:56:46,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34205 states, 27839 states have (on average 1.6316318833291426) internal successors, (45423), 27859 states have internal predecessors, (45423), 6258 states have call successors, (6258), 93 states have call predecessors, (6258), 107 states have return successors, (8167), 6260 states have call predecessors, (8167), 6254 states have call successors, (8167) [2025-01-09 03:56:46,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34205 states to 34205 states and 59848 transitions. [2025-01-09 03:56:46,677 INFO L78 Accepts]: Start accepts. Automaton has 34205 states and 59848 transitions. Word has length 143 [2025-01-09 03:56:46,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:46,678 INFO L471 AbstractCegarLoop]: Abstraction has 34205 states and 59848 transitions. [2025-01-09 03:56:46,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:56:46,678 INFO L276 IsEmpty]: Start isEmpty. Operand 34205 states and 59848 transitions. [2025-01-09 03:56:46,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 03:56:46,809 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:46,810 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:56:46,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:56:46,810 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:46,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:46,811 INFO L85 PathProgramCache]: Analyzing trace with hash 704564350, now seen corresponding path program 1 times [2025-01-09 03:56:46,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:46,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027413109] [2025-01-09 03:56:46,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:46,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:46,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 03:56:46,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 03:56:46,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:46,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:46,876 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 03:56:46,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:46,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027413109] [2025-01-09 03:56:46,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027413109] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:46,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:46,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:56:46,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11005097] [2025-01-09 03:56:46,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:46,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:56:46,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:46,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:56:46,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:46,880 INFO L87 Difference]: Start difference. First operand 34205 states and 59848 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:56:48,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:48,693 INFO L93 Difference]: Finished difference Result 88521 states and 155570 transitions. [2025-01-09 03:56:48,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:48,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 144 [2025-01-09 03:56:48,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:49,106 INFO L225 Difference]: With dead ends: 88521 [2025-01-09 03:56:49,106 INFO L226 Difference]: Without dead ends: 59945 [2025-01-09 03:56:49,243 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:56:49,245 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 85 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 941 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:56:49,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 941 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:49,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59945 states. [2025-01-09 03:56:52,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59945 to 59913. [2025-01-09 03:56:52,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59913 states, 48735 states have (on average 1.6214835333948907) internal successors, (79023), 48755 states have internal predecessors, (79023), 11070 states have call successors, (11070), 93 states have call predecessors, (11070), 107 states have return successors, (14463), 11072 states have call predecessors, (14463), 11066 states have call successors, (14463) [2025-01-09 03:56:52,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59913 states to 59913 states and 104556 transitions. [2025-01-09 03:56:52,869 INFO L78 Accepts]: Start accepts. Automaton has 59913 states and 104556 transitions. Word has length 144 [2025-01-09 03:56:52,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:52,870 INFO L471 AbstractCegarLoop]: Abstraction has 59913 states and 104556 transitions. [2025-01-09 03:56:52,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:56:52,870 INFO L276 IsEmpty]: Start isEmpty. Operand 59913 states and 104556 transitions. [2025-01-09 03:56:53,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 03:56:53,075 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:53,075 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:56:53,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 03:56:53,076 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:53,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:53,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1195628180, now seen corresponding path program 1 times [2025-01-09 03:56:53,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:53,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154495849] [2025-01-09 03:56:53,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:53,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:53,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 03:56:53,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 03:56:53,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:53,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:53,147 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 03:56:53,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:53,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154495849] [2025-01-09 03:56:53,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154495849] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:53,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:53,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:56:53,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336208118] [2025-01-09 03:56:53,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:53,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:56:53,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:53,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:56:53,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:53,149 INFO L87 Difference]: Start difference. First operand 59913 states and 104556 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:56:56,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:56,065 INFO L93 Difference]: Finished difference Result 158585 states and 278204 transitions. [2025-01-09 03:56:56,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:56,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 145 [2025-01-09 03:56:56,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:56,776 INFO L225 Difference]: With dead ends: 158585 [2025-01-09 03:56:56,776 INFO L226 Difference]: Without dead ends: 106613 [2025-01-09 03:56:57,015 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:56:57,017 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 83 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 926 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:56:57,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 926 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:57,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106613 states. [2025-01-09 03:57:00,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106613 to 106581. [2025-01-09 03:57:00,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106581 states, 87247 states have (on average 1.6165942668515823) internal successors, (141043), 87267 states have internal predecessors, (141043), 19226 states have call successors, (19226), 93 states have call predecessors, (19226), 107 states have return successors, (25464), 19228 states have call predecessors, (25464), 19222 states have call successors, (25464) [2025-01-09 03:57:01,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106581 states to 106581 states and 185733 transitions. [2025-01-09 03:57:01,455 INFO L78 Accepts]: Start accepts. Automaton has 106581 states and 185733 transitions. Word has length 145 [2025-01-09 03:57:01,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:01,456 INFO L471 AbstractCegarLoop]: Abstraction has 106581 states and 185733 transitions. [2025-01-09 03:57:01,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:57:01,456 INFO L276 IsEmpty]: Start isEmpty. Operand 106581 states and 185733 transitions. [2025-01-09 03:57:01,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 03:57:01,821 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:01,821 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:01,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 03:57:01,821 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:01,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:01,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1454016224, now seen corresponding path program 1 times [2025-01-09 03:57:01,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:01,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439454210] [2025-01-09 03:57:01,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:01,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:01,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 03:57:01,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 03:57:01,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:01,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:01,903 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 03:57:01,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:01,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439454210] [2025-01-09 03:57:01,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439454210] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:01,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:57:01,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:57:01,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421850250] [2025-01-09 03:57:01,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:01,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:57:01,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:01,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:57:01,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:57:01,906 INFO L87 Difference]: Start difference. First operand 106581 states and 185733 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:57:07,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:07,109 INFO L93 Difference]: Finished difference Result 290393 states and 505987 transitions. [2025-01-09 03:57:07,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:57:07,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 146 [2025-01-09 03:57:07,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:08,273 INFO L225 Difference]: With dead ends: 290393 [2025-01-09 03:57:08,273 INFO L226 Difference]: Without dead ends: 194533 [2025-01-09 03:57:08,790 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:57:08,791 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 81 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 926 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:57:08,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 926 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:08,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194533 states. [2025-01-09 03:57:14,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194533 to 194501. [2025-01-09 03:57:15,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194501 states, 160307 states have (on average 1.6102291228704921) internal successors, (258131), 160327 states have internal predecessors, (258131), 34086 states have call successors, (34086), 93 states have call predecessors, (34086), 107 states have return successors, (43782), 34088 states have call predecessors, (43782), 34082 states have call successors, (43782) [2025-01-09 03:57:16,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194501 states to 194501 states and 335999 transitions. [2025-01-09 03:57:16,225 INFO L78 Accepts]: Start accepts. Automaton has 194501 states and 335999 transitions. Word has length 146 [2025-01-09 03:57:16,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:16,225 INFO L471 AbstractCegarLoop]: Abstraction has 194501 states and 335999 transitions. [2025-01-09 03:57:16,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:57:16,226 INFO L276 IsEmpty]: Start isEmpty. Operand 194501 states and 335999 transitions. [2025-01-09 03:57:16,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 03:57:16,601 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:16,601 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:16,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 03:57:16,602 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:16,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:16,602 INFO L85 PathProgramCache]: Analyzing trace with hash 2108604020, now seen corresponding path program 1 times [2025-01-09 03:57:16,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:16,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968212632] [2025-01-09 03:57:16,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:16,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:16,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 03:57:16,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 03:57:16,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:16,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:16,664 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 03:57:16,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:16,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968212632] [2025-01-09 03:57:16,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968212632] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:16,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:57:16,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:57:16,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861926059] [2025-01-09 03:57:16,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:16,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:57:16,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:16,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:57:16,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:57:16,667 INFO L87 Difference]: Start difference. First operand 194501 states and 335999 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15)