./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec4_product24.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_spec4_product24.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 cc83a32f8f5c6143265231752530a7f576faa355052cdad9509cfbce0d0adeb3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:54:07,446 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:54:07,493 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:54:07,501 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:54:07,501 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:54:07,532 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:54:07,532 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:54:07,536 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:54:07,537 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:54:07,537 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:54:07,537 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:54:07,537 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:54:07,538 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:54:07,538 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:54:07,538 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:54:07,538 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:54:07,538 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:54:07,538 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:54:07,538 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:54:07,538 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:54:07,538 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:54:07,538 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:54:07,538 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:54:07,538 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:54:07,538 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:54:07,538 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:54:07,538 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:54:07,538 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:54:07,538 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:54:07,538 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:54:07,538 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:54:07,539 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:54:07,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:54:07,539 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:54:07,539 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:54:07,539 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:54:07,539 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:54:07,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:54:07,539 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:54:07,539 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:54:07,539 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:54:07,539 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:54:07,539 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:54:07,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:54:07,539 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:54:07,539 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:54:07,539 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:54:07,539 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:54:07,539 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 -> cc83a32f8f5c6143265231752530a7f576faa355052cdad9509cfbce0d0adeb3 [2025-01-09 03:54:07,780 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:54:07,788 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:54:07,790 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:54:07,792 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:54:07,792 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:54:07,794 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec4_product24.cil.c [2025-01-09 03:54:09,088 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ccb6b710/4a1406e740a747309042a82988d1e8ca/FLAG4046bb080 [2025-01-09 03:54:09,456 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:54:09,457 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product24.cil.c [2025-01-09 03:54:09,476 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ccb6b710/4a1406e740a747309042a82988d1e8ca/FLAG4046bb080 [2025-01-09 03:54:09,654 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7ccb6b710/4a1406e740a747309042a82988d1e8ca [2025-01-09 03:54:09,657 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:54:09,658 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:54:09,659 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:54:09,659 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:54:09,664 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:54:09,664 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:54:09" (1/1) ... [2025-01-09 03:54:09,665 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2751653f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:09, skipping insertion in model container [2025-01-09 03:54:09,665 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:54:09" (1/1) ... [2025-01-09 03:54:09,699 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:54:09,998 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_spec4_product24.cil.c[33676,33689] [2025-01-09 03:54:10,149 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:54:10,165 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:54:10,173 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [48] [2025-01-09 03:54:10,174 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [277] [2025-01-09 03:54:10,175 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1357] [2025-01-09 03:54:10,175 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1375] [2025-01-09 03:54:10,175 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1424] [2025-01-09 03:54:10,175 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1433] [2025-01-09 03:54:10,175 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1799] [2025-01-09 03:54:10,175 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2211] [2025-01-09 03:54:10,175 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignForward_spec.i","") [2503] [2025-01-09 03:54:10,175 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2530] [2025-01-09 03:54:10,175 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2629] [2025-01-09 03:54:10,234 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_spec4_product24.cil.c[33676,33689] [2025-01-09 03:54:10,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:54:10,301 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:54:10,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:10 WrapperNode [2025-01-09 03:54:10,304 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:54:10,305 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:54:10,305 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:54:10,305 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:54:10,309 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:54:10" (1/1) ... [2025-01-09 03:54:10,335 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:54:10" (1/1) ... [2025-01-09 03:54:10,386 INFO L138 Inliner]: procedures = 130, calls = 193, calls flagged for inlining = 63, calls inlined = 58, statements flattened = 1039 [2025-01-09 03:54:10,387 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:54:10,387 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:54:10,387 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:54:10,387 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:54:10,398 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:10" (1/1) ... [2025-01-09 03:54:10,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:10" (1/1) ... [2025-01-09 03:54:10,406 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:10" (1/1) ... [2025-01-09 03:54:10,431 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:54:10,432 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:10" (1/1) ... [2025-01-09 03:54:10,432 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:10" (1/1) ... [2025-01-09 03:54:10,447 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:10" (1/1) ... [2025-01-09 03:54:10,453 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:10" (1/1) ... [2025-01-09 03:54:10,461 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:10" (1/1) ... [2025-01-09 03:54:10,464 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:10" (1/1) ... [2025-01-09 03:54:10,465 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:10" (1/1) ... [2025-01-09 03:54:10,469 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:54:10,470 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:54:10,470 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:54:10,470 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:54:10,471 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:10" (1/1) ... [2025-01-09 03:54:10,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:54:10,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:54:10,494 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:54:10,499 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:54:10,512 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-01-09 03:54:10,513 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-01-09 03:54:10,513 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-01-09 03:54:10,513 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-01-09 03:54:10,513 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-01-09 03:54:10,513 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-01-09 03:54:10,513 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-01-09 03:54:10,513 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-01-09 03:54:10,513 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-01-09 03:54:10,513 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-01-09 03:54:10,513 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-01-09 03:54:10,514 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-01-09 03:54:10,514 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-01-09 03:54:10,514 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-01-09 03:54:10,514 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-01-09 03:54:10,514 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-01-09 03:54:10,514 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-01-09 03:54:10,514 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-01-09 03:54:10,514 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-01-09 03:54:10,514 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-01-09 03:54:10,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:54:10,514 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-01-09 03:54:10,514 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-01-09 03:54:10,514 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-01-09 03:54:10,514 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-01-09 03:54:10,515 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-01-09 03:54:10,515 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-01-09 03:54:10,515 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-01-09 03:54:10,515 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-01-09 03:54:10,515 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-01-09 03:54:10,515 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-01-09 03:54:10,515 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-01-09 03:54:10,515 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-01-09 03:54:10,515 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-01-09 03:54:10,515 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-01-09 03:54:10,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:54:10,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:54:10,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:54:10,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:54:10,515 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-01-09 03:54:10,516 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-01-09 03:54:10,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:54:10,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:54:10,670 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:54:10,672 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:54:11,254 INFO L? ?]: Removed 458 outVars from TransFormulas that were not future-live. [2025-01-09 03:54:11,254 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:54:11,269 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:54:11,270 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:54:11,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:54:11 BoogieIcfgContainer [2025-01-09 03:54:11,271 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:54:11,272 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:54:11,272 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:54:11,284 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:54:11,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:54:09" (1/3) ... [2025-01-09 03:54:11,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dca9714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:54:11, skipping insertion in model container [2025-01-09 03:54:11,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:10" (2/3) ... [2025-01-09 03:54:11,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dca9714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:54:11, skipping insertion in model container [2025-01-09 03:54:11,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:54:11" (3/3) ... [2025-01-09 03:54:11,286 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec4_product24.cil.c [2025-01-09 03:54:11,297 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:54:11,301 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec4_product24.cil.c that has 19 procedures, 326 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:54:11,349 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:54:11,357 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;@5e1b1004, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:54:11,358 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:54:11,361 INFO L276 IsEmpty]: Start isEmpty. Operand has 326 states, 258 states have (on average 1.5271317829457365) internal successors, (394), 260 states have internal predecessors, (394), 48 states have call successors, (48), 18 states have call predecessors, (48), 18 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 03:54:11,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 03:54:11,370 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:11,370 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:11,370 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:11,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:11,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1135221693, now seen corresponding path program 1 times [2025-01-09 03:54:11,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:11,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496519201] [2025-01-09 03:54:11,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:11,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:11,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 03:54:11,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 03:54:11,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:11,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:11,886 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 03:54:11,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:11,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496519201] [2025-01-09 03:54:11,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496519201] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:54:11,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159965060] [2025-01-09 03:54:11,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:11,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:54:11,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:54:11,889 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:54:11,894 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:54:12,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 03:54:12,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 03:54:12,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:12,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:12,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 928 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 03:54:12,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:54:12,163 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 03:54:12,164 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:54:12,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159965060] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:12,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:54:12,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-01-09 03:54:12,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214781458] [2025-01-09 03:54:12,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:12,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 03:54:12,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:12,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 03:54:12,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:54:12,183 INFO L87 Difference]: Start difference. First operand has 326 states, 258 states have (on average 1.5271317829457365) internal successors, (394), 260 states have internal predecessors, (394), 48 states have call successors, (48), 18 states have call predecessors, (48), 18 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:54:12,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:12,215 INFO L93 Difference]: Finished difference Result 494 states and 728 transitions. [2025-01-09 03:54:12,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 03:54:12,217 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 92 [2025-01-09 03:54:12,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:12,223 INFO L225 Difference]: With dead ends: 494 [2025-01-09 03:54:12,223 INFO L226 Difference]: Without dead ends: 319 [2025-01-09 03:54:12,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 93 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:54:12,228 INFO L435 NwaCegarLoop]: 487 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, 487 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:54:12,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:12,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-01-09 03:54:12,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2025-01-09 03:54:12,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 252 states have (on average 1.5238095238095237) internal successors, (384), 253 states have internal predecessors, (384), 48 states have call successors, (48), 18 states have call predecessors, (48), 18 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2025-01-09 03:54:12,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 479 transitions. [2025-01-09 03:54:12,294 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 479 transitions. Word has length 92 [2025-01-09 03:54:12,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:12,295 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 479 transitions. [2025-01-09 03:54:12,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:54:12,296 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 479 transitions. [2025-01-09 03:54:12,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 03:54:12,302 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:12,302 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:12,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 03:54:12,503 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:54:12,504 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:12,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:12,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1208104725, now seen corresponding path program 1 times [2025-01-09 03:54:12,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:12,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068021900] [2025-01-09 03:54:12,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:12,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:12,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 03:54:12,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 03:54:12,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:12,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:12,747 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 03:54:12,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:12,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068021900] [2025-01-09 03:54:12,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068021900] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:54:12,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988440231] [2025-01-09 03:54:12,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:12,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:54:12,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:54:12,750 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:54:12,752 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:54:12,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 03:54:12,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 03:54:12,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:12,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:12,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 928 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:54:12,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:54:12,992 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 03:54:12,992 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:54:12,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988440231] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:12,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:54:12,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:54:12,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696069615] [2025-01-09 03:54:12,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:12,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:12,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:12,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:12,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:54:12,994 INFO L87 Difference]: Start difference. First operand 319 states and 479 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:54:13,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:13,020 INFO L93 Difference]: Finished difference Result 483 states and 709 transitions. [2025-01-09 03:54:13,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:13,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 92 [2025-01-09 03:54:13,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:13,023 INFO L225 Difference]: With dead ends: 483 [2025-01-09 03:54:13,023 INFO L226 Difference]: Without dead ends: 321 [2025-01-09 03:54:13,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 92 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:54:13,025 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 1 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 952 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:54:13,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 952 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:13,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-01-09 03:54:13,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 320. [2025-01-09 03:54:13,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 253 states have (on average 1.5217391304347827) internal successors, (385), 254 states have internal predecessors, (385), 48 states have call successors, (48), 18 states have call predecessors, (48), 18 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2025-01-09 03:54:13,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 480 transitions. [2025-01-09 03:54:13,041 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 480 transitions. Word has length 92 [2025-01-09 03:54:13,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:13,041 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 480 transitions. [2025-01-09 03:54:13,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:54:13,041 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 480 transitions. [2025-01-09 03:54:13,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 03:54:13,044 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:13,044 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:13,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 03:54:13,244 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:54:13,245 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:13,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:13,246 INFO L85 PathProgramCache]: Analyzing trace with hash -27605784, now seen corresponding path program 1 times [2025-01-09 03:54:13,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:13,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79479653] [2025-01-09 03:54:13,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:13,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:13,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 03:54:13,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 03:54:13,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:13,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:13,461 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 03:54:13,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:13,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79479653] [2025-01-09 03:54:13,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79479653] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:54:13,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900124314] [2025-01-09 03:54:13,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:13,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:54:13,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:54:13,464 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:54:13,465 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:54:13,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 03:54:13,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 03:54:13,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:13,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:13,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:54:13,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:54:13,692 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 03:54:13,692 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:54:13,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900124314] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:13,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:54:13,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:54:13,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785159772] [2025-01-09 03:54:13,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:13,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:13,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:13,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:13,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:54:13,693 INFO L87 Difference]: Start difference. First operand 320 states and 480 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:54:13,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:13,714 INFO L93 Difference]: Finished difference Result 675 states and 1027 transitions. [2025-01-09 03:54:13,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:13,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 100 [2025-01-09 03:54:13,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:13,717 INFO L225 Difference]: With dead ends: 675 [2025-01-09 03:54:13,717 INFO L226 Difference]: Without dead ends: 381 [2025-01-09 03:54:13,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:54:13,719 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 115 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 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:54:13,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 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:54:13,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2025-01-09 03:54:13,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 373. [2025-01-09 03:54:13,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 295 states have (on average 1.5389830508474576) internal successors, (454), 296 states have internal predecessors, (454), 59 states have call successors, (59), 18 states have call predecessors, (59), 18 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-01-09 03:54:13,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 571 transitions. [2025-01-09 03:54:13,734 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 571 transitions. Word has length 100 [2025-01-09 03:54:13,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:13,734 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 571 transitions. [2025-01-09 03:54:13,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:54:13,735 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 571 transitions. [2025-01-09 03:54:13,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 03:54:13,737 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:13,738 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:13,747 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:54:13,938 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:54:13,939 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:13,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:13,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1294635410, now seen corresponding path program 1 times [2025-01-09 03:54:13,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:13,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518333135] [2025-01-09 03:54:13,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:13,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:13,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 03:54:13,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 03:54:13,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:13,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:14,090 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 03:54:14,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:14,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518333135] [2025-01-09 03:54:14,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518333135] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:54:14,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010392563] [2025-01-09 03:54:14,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:14,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:54:14,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:54:14,096 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:54:14,097 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:54:14,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 03:54:14,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 03:54:14,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:14,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:14,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 957 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 03:54:14,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:54:14,341 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 03:54:14,342 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:54:14,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010392563] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:14,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:54:14,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-01-09 03:54:14,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504663951] [2025-01-09 03:54:14,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:14,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:54:14,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:14,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:54:14,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:54:14,343 INFO L87 Difference]: Start difference. First operand 373 states and 571 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:54:14,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:14,395 INFO L93 Difference]: Finished difference Result 737 states and 1132 transitions. [2025-01-09 03:54:14,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:54:14,396 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 101 [2025-01-09 03:54:14,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:14,399 INFO L225 Difference]: With dead ends: 737 [2025-01-09 03:54:14,399 INFO L226 Difference]: Without dead ends: 375 [2025-01-09 03:54:14,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 99 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:54:14,400 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 2 mSDsluCounter, 1402 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1873 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:54:14,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1873 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:14,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-01-09 03:54:14,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2025-01-09 03:54:14,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 296 states have (on average 1.537162162162162) internal successors, (455), 298 states have internal predecessors, (455), 59 states have call successors, (59), 18 states have call predecessors, (59), 19 states have return successors, (60), 58 states have call predecessors, (60), 58 states have call successors, (60) [2025-01-09 03:54:14,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 574 transitions. [2025-01-09 03:54:14,414 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 574 transitions. Word has length 101 [2025-01-09 03:54:14,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:14,414 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 574 transitions. [2025-01-09 03:54:14,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:54:14,414 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 574 transitions. [2025-01-09 03:54:14,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 03:54:14,416 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:14,416 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:14,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 03:54:14,616 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:54:14,617 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:14,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:14,617 INFO L85 PathProgramCache]: Analyzing trace with hash -571003350, now seen corresponding path program 1 times [2025-01-09 03:54:14,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:14,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202036795] [2025-01-09 03:54:14,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:14,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:14,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 03:54:14,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 03:54:14,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:14,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:14,757 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 03:54:14,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:14,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202036795] [2025-01-09 03:54:14,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202036795] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:54:14,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132570582] [2025-01-09 03:54:14,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:14,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:54:14,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:54:14,760 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:54:14,761 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:54:14,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 03:54:14,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 03:54:14,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:14,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:14,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 958 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 03:54:14,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:54:15,011 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 03:54:15,011 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:54:15,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132570582] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:15,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:54:15,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-01-09 03:54:15,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265213843] [2025-01-09 03:54:15,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:15,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:54:15,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:15,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:54:15,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:54:15,013 INFO L87 Difference]: Start difference. First operand 375 states and 574 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:54:15,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:15,064 INFO L93 Difference]: Finished difference Result 739 states and 1137 transitions. [2025-01-09 03:54:15,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:54:15,065 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 102 [2025-01-09 03:54:15,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:15,067 INFO L225 Difference]: With dead ends: 739 [2025-01-09 03:54:15,067 INFO L226 Difference]: Without dead ends: 377 [2025-01-09 03:54:15,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:54:15,069 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 2 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1859 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:54:15,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1859 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:15,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-01-09 03:54:15,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2025-01-09 03:54:15,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 297 states have (on average 1.5353535353535352) internal successors, (456), 300 states have internal predecessors, (456), 59 states have call successors, (59), 18 states have call predecessors, (59), 20 states have return successors, (65), 58 states have call predecessors, (65), 58 states have call successors, (65) [2025-01-09 03:54:15,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 580 transitions. [2025-01-09 03:54:15,082 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 580 transitions. Word has length 102 [2025-01-09 03:54:15,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:15,082 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 580 transitions. [2025-01-09 03:54:15,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:54:15,083 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 580 transitions. [2025-01-09 03:54:15,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 03:54:15,084 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:15,084 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-01-09 03:54:15,096 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:54:15,289 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:54:15,289 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:15,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:15,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1545164056, now seen corresponding path program 1 times [2025-01-09 03:54:15,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:15,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229986446] [2025-01-09 03:54:15,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:15,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:15,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 03:54:15,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 03:54:15,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:15,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:15,416 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 03:54:15,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:15,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229986446] [2025-01-09 03:54:15,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229986446] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:15,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:15,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:54:15,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387817059] [2025-01-09 03:54:15,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:15,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:54:15,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:15,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:54:15,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:54:15,418 INFO L87 Difference]: Start difference. First operand 377 states and 580 transitions. Second operand has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:54:15,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:15,455 INFO L93 Difference]: Finished difference Result 731 states and 1128 transitions. [2025-01-09 03:54:15,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:54:15,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 103 [2025-01-09 03:54:15,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:15,458 INFO L225 Difference]: With dead ends: 731 [2025-01-09 03:54:15,458 INFO L226 Difference]: Without dead ends: 377 [2025-01-09 03:54:15,459 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:54:15,460 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 2 mSDsluCounter, 1405 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1877 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:54:15,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1877 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:15,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-01-09 03:54:15,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2025-01-09 03:54:15,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 297 states have (on average 1.5353535353535352) internal successors, (456), 300 states have internal predecessors, (456), 59 states have call successors, (59), 18 states have call predecessors, (59), 20 states have return successors, (64), 58 states have call predecessors, (64), 58 states have call successors, (64) [2025-01-09 03:54:15,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 579 transitions. [2025-01-09 03:54:15,473 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 579 transitions. Word has length 103 [2025-01-09 03:54:15,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:15,473 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 579 transitions. [2025-01-09 03:54:15,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:54:15,473 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 579 transitions. [2025-01-09 03:54:15,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 03:54:15,475 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:15,475 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 03:54:15,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:54:15,475 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:15,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:15,476 INFO L85 PathProgramCache]: Analyzing trace with hash -605751822, now seen corresponding path program 2 times [2025-01-09 03:54:15,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:15,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210489109] [2025-01-09 03:54:15,476 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:54:15,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:15,489 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 104 statements into 2 equivalence classes. [2025-01-09 03:54:15,494 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 45 of 104 statements. [2025-01-09 03:54:15,494 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 03:54:15,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:15,586 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 03:54:15,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:15,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210489109] [2025-01-09 03:54:15,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210489109] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:15,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:15,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:54:15,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557492480] [2025-01-09 03:54:15,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:15,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:54:15,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:15,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:54:15,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:54:15,588 INFO L87 Difference]: Start difference. First operand 377 states and 579 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:54:15,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:15,899 INFO L93 Difference]: Finished difference Result 764 states and 1181 transitions. [2025-01-09 03:54:15,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 03:54:15,899 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 104 [2025-01-09 03:54:15,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:15,907 INFO L225 Difference]: With dead ends: 764 [2025-01-09 03:54:15,907 INFO L226 Difference]: Without dead ends: 760 [2025-01-09 03:54:15,908 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:54:15,909 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 800 mSDsluCounter, 2328 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 801 SdHoareTripleChecker+Valid, 2821 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:15,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [801 Valid, 2821 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:54:15,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2025-01-09 03:54:15,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 749. [2025-01-09 03:54:15,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 592 states have (on average 1.5405405405405406) internal successors, (912), 595 states have internal predecessors, (912), 116 states have call successors, (116), 37 states have call predecessors, (116), 40 states have return successors, (130), 116 states have call predecessors, (130), 114 states have call successors, (130) [2025-01-09 03:54:15,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1158 transitions. [2025-01-09 03:54:15,939 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1158 transitions. Word has length 104 [2025-01-09 03:54:15,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:15,939 INFO L471 AbstractCegarLoop]: Abstraction has 749 states and 1158 transitions. [2025-01-09 03:54:15,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:54:15,940 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1158 transitions. [2025-01-09 03:54:15,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 03:54:15,942 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:15,942 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-01-09 03:54:15,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:54:15,943 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:15,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:15,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1352306925, now seen corresponding path program 1 times [2025-01-09 03:54:15,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:15,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265187938] [2025-01-09 03:54:15,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:15,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:15,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 03:54:15,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 03:54:15,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:15,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:16,044 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 03:54:16,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:16,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265187938] [2025-01-09 03:54:16,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265187938] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:16,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:16,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:54:16,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779201115] [2025-01-09 03:54:16,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:16,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:54:16,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:16,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:54:16,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:54:16,046 INFO L87 Difference]: Start difference. First operand 749 states and 1158 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:54:16,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:16,088 INFO L93 Difference]: Finished difference Result 1467 states and 2276 transitions. [2025-01-09 03:54:16,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:54:16,089 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 105 [2025-01-09 03:54:16,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:16,092 INFO L225 Difference]: With dead ends: 1467 [2025-01-09 03:54:16,092 INFO L226 Difference]: Without dead ends: 753 [2025-01-09 03:54:16,094 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:54:16,094 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 1 mSDsluCounter, 1407 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1880 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:54:16,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1880 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:16,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2025-01-09 03:54:16,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 753. [2025-01-09 03:54:16,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 753 states, 594 states have (on average 1.5387205387205387) internal successors, (914), 599 states have internal predecessors, (914), 116 states have call successors, (116), 37 states have call predecessors, (116), 42 states have return successors, (133), 116 states have call predecessors, (133), 114 states have call successors, (133) [2025-01-09 03:54:16,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1163 transitions. [2025-01-09 03:54:16,124 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1163 transitions. Word has length 105 [2025-01-09 03:54:16,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:16,124 INFO L471 AbstractCegarLoop]: Abstraction has 753 states and 1163 transitions. [2025-01-09 03:54:16,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:54:16,124 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1163 transitions. [2025-01-09 03:54:16,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 03:54:16,126 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:16,126 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:16,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:54:16,127 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:16,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:16,127 INFO L85 PathProgramCache]: Analyzing trace with hash -118561338, now seen corresponding path program 1 times [2025-01-09 03:54:16,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:16,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829906355] [2025-01-09 03:54:16,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:16,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:16,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 03:54:16,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 03:54:16,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:16,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:16,278 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 03:54:16,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:16,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829906355] [2025-01-09 03:54:16,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829906355] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:16,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:16,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:54:16,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166461431] [2025-01-09 03:54:16,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:16,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:54:16,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:16,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:54:16,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:54:16,280 INFO L87 Difference]: Start difference. First operand 753 states and 1163 transitions. Second operand has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:54:16,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:16,339 INFO L93 Difference]: Finished difference Result 1471 states and 2281 transitions. [2025-01-09 03:54:16,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:54:16,340 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 106 [2025-01-09 03:54:16,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:16,344 INFO L225 Difference]: With dead ends: 1471 [2025-01-09 03:54:16,344 INFO L226 Difference]: Without dead ends: 757 [2025-01-09 03:54:16,348 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:54:16,348 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 0 mSDsluCounter, 1402 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1873 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:16,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1873 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:16,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2025-01-09 03:54:16,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 753. [2025-01-09 03:54:16,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 753 states, 594 states have (on average 1.5387205387205387) internal successors, (914), 599 states have internal predecessors, (914), 116 states have call successors, (116), 37 states have call predecessors, (116), 42 states have return successors, (133), 116 states have call predecessors, (133), 114 states have call successors, (133) [2025-01-09 03:54:16,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1163 transitions. [2025-01-09 03:54:16,379 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1163 transitions. Word has length 106 [2025-01-09 03:54:16,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:16,379 INFO L471 AbstractCegarLoop]: Abstraction has 753 states and 1163 transitions. [2025-01-09 03:54:16,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.0) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:54:16,379 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1163 transitions. [2025-01-09 03:54:16,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 03:54:16,381 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:16,381 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:16,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:54:16,381 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:16,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:16,382 INFO L85 PathProgramCache]: Analyzing trace with hash -2027019128, now seen corresponding path program 1 times [2025-01-09 03:54:16,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:16,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755223087] [2025-01-09 03:54:16,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:16,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:16,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 03:54:16,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 03:54:16,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:16,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:16,481 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 03:54:16,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:16,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755223087] [2025-01-09 03:54:16,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755223087] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:16,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:16,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:54:16,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641465747] [2025-01-09 03:54:16,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:16,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:54:16,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:16,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:54:16,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:54:16,482 INFO L87 Difference]: Start difference. First operand 753 states and 1163 transitions. Second operand has 8 states, 7 states have (on average 10.142857142857142) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 03:54:16,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:16,624 INFO L93 Difference]: Finished difference Result 1466 states and 2269 transitions. [2025-01-09 03:54:16,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 03:54:16,624 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.142857142857142) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 106 [2025-01-09 03:54:16,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:16,628 INFO L225 Difference]: With dead ends: 1466 [2025-01-09 03:54:16,628 INFO L226 Difference]: Without dead ends: 757 [2025-01-09 03:54:16,630 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:54:16,630 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 7 mSDsluCounter, 2749 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3212 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:54:16,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3212 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:54:16,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2025-01-09 03:54:16,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 755. [2025-01-09 03:54:16,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 755 states, 596 states have (on average 1.5369127516778522) internal successors, (916), 600 states have internal predecessors, (916), 116 states have call successors, (116), 38 states have call predecessors, (116), 42 states have return successors, (131), 116 states have call predecessors, (131), 114 states have call successors, (131) [2025-01-09 03:54:16,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1163 transitions. [2025-01-09 03:54:16,653 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1163 transitions. Word has length 106 [2025-01-09 03:54:16,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:16,654 INFO L471 AbstractCegarLoop]: Abstraction has 755 states and 1163 transitions. [2025-01-09 03:54:16,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.142857142857142) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 03:54:16,654 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1163 transitions. [2025-01-09 03:54:16,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 03:54:16,656 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:16,656 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-01-09 03:54:16,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 03:54:16,656 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:16,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:16,656 INFO L85 PathProgramCache]: Analyzing trace with hash -36880270, now seen corresponding path program 2 times [2025-01-09 03:54:16,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:16,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592229796] [2025-01-09 03:54:16,656 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:54:16,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:16,669 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 107 statements into 2 equivalence classes. [2025-01-09 03:54:16,674 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 48 of 107 statements. [2025-01-09 03:54:16,674 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 03:54:16,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:16,792 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 03:54:16,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:16,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592229796] [2025-01-09 03:54:16,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592229796] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:16,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:16,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:54:16,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255010383] [2025-01-09 03:54:16,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:16,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:54:16,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:16,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:54:16,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:54:16,794 INFO L87 Difference]: Start difference. First operand 755 states and 1163 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:54:17,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:17,120 INFO L93 Difference]: Finished difference Result 1536 states and 2386 transitions. [2025-01-09 03:54:17,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 03:54:17,120 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 107 [2025-01-09 03:54:17,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:17,128 INFO L225 Difference]: With dead ends: 1536 [2025-01-09 03:54:17,128 INFO L226 Difference]: Without dead ends: 1530 [2025-01-09 03:54:17,129 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:54:17,130 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 792 mSDsluCounter, 2347 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 2846 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:17,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 2846 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:54:17,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530 states. [2025-01-09 03:54:17,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1530 to 1507. [2025-01-09 03:54:17,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1507 states, 1190 states have (on average 1.5378151260504203) internal successors, (1830), 1200 states have internal predecessors, (1830), 228 states have call successors, (228), 76 states have call predecessors, (228), 88 states have return successors, (284), 230 states have call predecessors, (284), 224 states have call successors, (284) [2025-01-09 03:54:17,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 2342 transitions. [2025-01-09 03:54:17,190 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 2342 transitions. Word has length 107 [2025-01-09 03:54:17,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:17,190 INFO L471 AbstractCegarLoop]: Abstraction has 1507 states and 2342 transitions. [2025-01-09 03:54:17,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:54:17,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 2342 transitions. [2025-01-09 03:54:17,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 03:54:17,194 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:17,194 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:17,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 03:54:17,195 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:17,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:17,195 INFO L85 PathProgramCache]: Analyzing trace with hash -654098621, now seen corresponding path program 1 times [2025-01-09 03:54:17,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:17,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340267887] [2025-01-09 03:54:17,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:17,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:17,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 03:54:17,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 03:54:17,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:17,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:17,292 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-01-09 03:54:17,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:17,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340267887] [2025-01-09 03:54:17,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340267887] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:54:17,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389045540] [2025-01-09 03:54:17,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:17,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:54:17,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:54:17,295 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:54:17,296 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:54:17,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 03:54:17,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 03:54:17,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:17,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:17,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 963 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 03:54:17,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:54:17,544 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 03:54:17,544 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:54:17,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389045540] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:17,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:54:17,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-01-09 03:54:17,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001018490] [2025-01-09 03:54:17,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:17,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:54:17,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:17,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:54:17,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:54:17,546 INFO L87 Difference]: Start difference. First operand 1507 states and 2342 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:54:17,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:17,618 INFO L93 Difference]: Finished difference Result 2273 states and 3525 transitions. [2025-01-09 03:54:17,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:54:17,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 107 [2025-01-09 03:54:17,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:17,626 INFO L225 Difference]: With dead ends: 2273 [2025-01-09 03:54:17,626 INFO L226 Difference]: Without dead ends: 1511 [2025-01-09 03:54:17,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 105 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:54:17,630 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 1 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1870 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:54:17,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1870 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:17,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2025-01-09 03:54:17,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1503. [2025-01-09 03:54:17,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1503 states, 1188 states have (on average 1.537037037037037) internal successors, (1826), 1198 states have internal predecessors, (1826), 226 states have call successors, (226), 76 states have call predecessors, (226), 88 states have return successors, (282), 228 states have call predecessors, (282), 222 states have call successors, (282) [2025-01-09 03:54:17,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 2334 transitions. [2025-01-09 03:54:17,688 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 2334 transitions. Word has length 107 [2025-01-09 03:54:17,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:17,688 INFO L471 AbstractCegarLoop]: Abstraction has 1503 states and 2334 transitions. [2025-01-09 03:54:17,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:54:17,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 2334 transitions. [2025-01-09 03:54:17,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 03:54:17,692 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:17,693 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-01-09 03:54:17,700 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:54:17,893 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,SelfDestructingSolverStorable11 [2025-01-09 03:54:17,894 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:17,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:17,894 INFO L85 PathProgramCache]: Analyzing trace with hash -782641393, now seen corresponding path program 1 times [2025-01-09 03:54:17,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:17,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045274101] [2025-01-09 03:54:17,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:17,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:17,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 03:54:17,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 03:54:17,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:17,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:18,021 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 03:54:18,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:18,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045274101] [2025-01-09 03:54:18,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045274101] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:18,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:18,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:54:18,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112961852] [2025-01-09 03:54:18,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:18,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:54:18,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:18,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:54:18,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:54:18,023 INFO L87 Difference]: Start difference. First operand 1503 states and 2334 transitions. Second operand has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 8 states have internal predecessors, (73), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 03:54:18,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:18,168 INFO L93 Difference]: Finished difference Result 2951 states and 4591 transitions. [2025-01-09 03:54:18,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 03:54:18,169 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 8 states have internal predecessors, (73), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 108 [2025-01-09 03:54:18,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:18,177 INFO L225 Difference]: With dead ends: 2951 [2025-01-09 03:54:18,178 INFO L226 Difference]: Without dead ends: 1515 [2025-01-09 03:54:18,182 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:54:18,183 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 5 mSDsluCounter, 2761 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3226 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:54:18,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3226 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:54:18,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2025-01-09 03:54:18,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1507. [2025-01-09 03:54:18,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1507 states, 1192 states have (on average 1.5352348993288591) internal successors, (1830), 1201 states have internal predecessors, (1830), 226 states have call successors, (226), 77 states have call predecessors, (226), 88 states have return successors, (278), 228 states have call predecessors, (278), 222 states have call successors, (278) [2025-01-09 03:54:18,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 2334 transitions. [2025-01-09 03:54:18,242 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 2334 transitions. Word has length 108 [2025-01-09 03:54:18,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:18,243 INFO L471 AbstractCegarLoop]: Abstraction has 1507 states and 2334 transitions. [2025-01-09 03:54:18,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 8 states have internal predecessors, (73), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-01-09 03:54:18,243 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 2334 transitions. [2025-01-09 03:54:18,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 03:54:18,248 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:18,248 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:18,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:54:18,248 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:18,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:18,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1587611522, now seen corresponding path program 1 times [2025-01-09 03:54:18,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:18,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529337875] [2025-01-09 03:54:18,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:18,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:18,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 03:54:18,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 03:54:18,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:18,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:18,404 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 03:54:18,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:18,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529337875] [2025-01-09 03:54:18,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529337875] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:54:18,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383731350] [2025-01-09 03:54:18,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:18,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:54:18,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:54:18,410 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:54:18,413 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:54:18,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 03:54:18,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 03:54:18,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:18,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:18,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 965 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:54:18,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:54:18,693 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:18,694 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:54:18,777 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:18,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383731350] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:54:18,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:54:18,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-01-09 03:54:18,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558648521] [2025-01-09 03:54:18,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:54:18,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 03:54:18,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:18,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 03:54:18,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:54:18,779 INFO L87 Difference]: Start difference. First operand 1507 states and 2334 transitions. Second operand has 11 states, 10 states have (on average 11.4) internal successors, (114), 11 states have internal predecessors, (114), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) [2025-01-09 03:54:19,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:19,327 INFO L93 Difference]: Finished difference Result 4421 states and 7182 transitions. [2025-01-09 03:54:19,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 03:54:19,329 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.4) internal successors, (114), 11 states have internal predecessors, (114), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) Word has length 109 [2025-01-09 03:54:19,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:19,342 INFO L225 Difference]: With dead ends: 4421 [2025-01-09 03:54:19,343 INFO L226 Difference]: Without dead ends: 2993 [2025-01-09 03:54:19,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2025-01-09 03:54:19,347 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 1246 mSDsluCounter, 2836 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1246 SdHoareTripleChecker+Valid, 3295 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:19,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1246 Valid, 3295 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 03:54:19,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2993 states. [2025-01-09 03:54:19,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2993 to 2897. [2025-01-09 03:54:19,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2897 states, 2326 states have (on average 1.587274290627687) internal successors, (3692), 2334 states have internal predecessors, (3692), 482 states have call successors, (482), 78 states have call predecessors, (482), 88 states have return successors, (614), 484 states have call predecessors, (614), 478 states have call successors, (614) [2025-01-09 03:54:19,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2897 states to 2897 states and 4788 transitions. [2025-01-09 03:54:19,456 INFO L78 Accepts]: Start accepts. Automaton has 2897 states and 4788 transitions. Word has length 109 [2025-01-09 03:54:19,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:19,456 INFO L471 AbstractCegarLoop]: Abstraction has 2897 states and 4788 transitions. [2025-01-09 03:54:19,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.4) internal successors, (114), 11 states have internal predecessors, (114), 4 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) [2025-01-09 03:54:19,456 INFO L276 IsEmpty]: Start isEmpty. Operand 2897 states and 4788 transitions. [2025-01-09 03:54:19,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 03:54:19,466 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:19,466 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:19,477 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:54:19,666 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:54:19,666 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:19,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:19,667 INFO L85 PathProgramCache]: Analyzing trace with hash 2029879749, now seen corresponding path program 1 times [2025-01-09 03:54:19,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:19,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876531785] [2025-01-09 03:54:19,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:19,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:19,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 03:54:19,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 03:54:19,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:19,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:19,710 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:19,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:19,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876531785] [2025-01-09 03:54:19,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876531785] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:19,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:19,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:19,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242048122] [2025-01-09 03:54:19,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:19,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:19,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:19,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:19,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:19,711 INFO L87 Difference]: Start difference. First operand 2897 states and 4788 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:54:19,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:19,850 INFO L93 Difference]: Finished difference Result 6831 states and 11492 transitions. [2025-01-09 03:54:19,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:19,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 113 [2025-01-09 03:54:19,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:19,871 INFO L225 Difference]: With dead ends: 6831 [2025-01-09 03:54:19,871 INFO L226 Difference]: Without dead ends: 4201 [2025-01-09 03:54:19,878 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:54:19,878 INFO L435 NwaCegarLoop]: 492 mSDtfsCounter, 112 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 961 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:54:19,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 961 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:19,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4201 states. [2025-01-09 03:54:20,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4201 to 4169. [2025-01-09 03:54:20,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4169 states, 3342 states have (on average 1.6050269299820468) internal successors, (5364), 3350 states have internal predecessors, (5364), 738 states have call successors, (738), 78 states have call predecessors, (738), 88 states have return successors, (950), 740 states have call predecessors, (950), 734 states have call successors, (950) [2025-01-09 03:54:20,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4169 states to 4169 states and 7052 transitions. [2025-01-09 03:54:20,073 INFO L78 Accepts]: Start accepts. Automaton has 4169 states and 7052 transitions. Word has length 113 [2025-01-09 03:54:20,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:20,073 INFO L471 AbstractCegarLoop]: Abstraction has 4169 states and 7052 transitions. [2025-01-09 03:54:20,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:54:20,077 INFO L276 IsEmpty]: Start isEmpty. Operand 4169 states and 7052 transitions. [2025-01-09 03:54:20,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 03:54:20,096 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:20,097 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:20,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:54:20,097 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:20,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:20,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1604117708, now seen corresponding path program 1 times [2025-01-09 03:54:20,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:20,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209300921] [2025-01-09 03:54:20,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:20,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:20,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 03:54:20,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 03:54:20,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:20,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:20,164 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:20,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:20,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209300921] [2025-01-09 03:54:20,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209300921] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:20,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:20,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:20,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233051710] [2025-01-09 03:54:20,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:20,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:20,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:20,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:20,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:20,165 INFO L87 Difference]: Start difference. First operand 4169 states and 7052 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:54:20,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:20,350 INFO L93 Difference]: Finished difference Result 9983 states and 17000 transitions. [2025-01-09 03:54:20,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:20,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 114 [2025-01-09 03:54:20,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:20,389 INFO L225 Difference]: With dead ends: 9983 [2025-01-09 03:54:20,390 INFO L226 Difference]: Without dead ends: 6285 [2025-01-09 03:54:20,410 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:54:20,411 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 110 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 950 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:54:20,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 950 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:20,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6285 states. [2025-01-09 03:54:20,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6285 to 6253. [2025-01-09 03:54:20,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6253 states, 5046 states have (on average 1.613158937772493) internal successors, (8140), 5054 states have internal predecessors, (8140), 1118 states have call successors, (1118), 78 states have call predecessors, (1118), 88 states have return successors, (1394), 1120 states have call predecessors, (1394), 1114 states have call successors, (1394) [2025-01-09 03:54:20,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6253 states to 6253 states and 10652 transitions. [2025-01-09 03:54:20,761 INFO L78 Accepts]: Start accepts. Automaton has 6253 states and 10652 transitions. Word has length 114 [2025-01-09 03:54:20,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:20,761 INFO L471 AbstractCegarLoop]: Abstraction has 6253 states and 10652 transitions. [2025-01-09 03:54:20,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:54:20,762 INFO L276 IsEmpty]: Start isEmpty. Operand 6253 states and 10652 transitions. [2025-01-09 03:54:20,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 03:54:20,788 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:20,789 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:20,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:54:20,789 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:20,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:20,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1031313641, now seen corresponding path program 1 times [2025-01-09 03:54:20,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:20,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844239922] [2025-01-09 03:54:20,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:20,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:20,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 03:54:20,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 03:54:20,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:20,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:20,844 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:20,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:20,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844239922] [2025-01-09 03:54:20,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844239922] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:20,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:20,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:20,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944533236] [2025-01-09 03:54:20,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:20,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:20,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:20,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:20,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:20,847 INFO L87 Difference]: Start difference. First operand 6253 states and 10652 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:54:21,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:21,105 INFO L93 Difference]: Finished difference Result 14699 states and 25264 transitions. [2025-01-09 03:54:21,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:21,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2025-01-09 03:54:21,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:21,148 INFO L225 Difference]: With dead ends: 14699 [2025-01-09 03:54:21,148 INFO L226 Difference]: Without dead ends: 9441 [2025-01-09 03:54:21,166 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:54:21,166 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 108 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 945 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:54:21,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 945 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:21,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9441 states. [2025-01-09 03:54:21,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9441 to 9409. [2025-01-09 03:54:21,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9409 states, 7710 states have (on average 1.6197146562905318) internal successors, (12488), 7718 states have internal predecessors, (12488), 1610 states have call successors, (1610), 78 states have call predecessors, (1610), 88 states have return successors, (2054), 1612 states have call predecessors, (2054), 1606 states have call successors, (2054) [2025-01-09 03:54:21,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9409 states to 9409 states and 16152 transitions. [2025-01-09 03:54:21,535 INFO L78 Accepts]: Start accepts. Automaton has 9409 states and 16152 transitions. Word has length 115 [2025-01-09 03:54:21,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:21,535 INFO L471 AbstractCegarLoop]: Abstraction has 9409 states and 16152 transitions. [2025-01-09 03:54:21,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:54:21,536 INFO L276 IsEmpty]: Start isEmpty. Operand 9409 states and 16152 transitions. [2025-01-09 03:54:21,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 03:54:21,563 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:21,563 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:21,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:54:21,563 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:21,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:21,564 INFO L85 PathProgramCache]: Analyzing trace with hash -179853165, now seen corresponding path program 1 times [2025-01-09 03:54:21,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:21,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92328131] [2025-01-09 03:54:21,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:21,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:21,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 03:54:21,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 03:54:21,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:21,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:21,602 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:21,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:21,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92328131] [2025-01-09 03:54:21,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92328131] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:21,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:21,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:21,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577928003] [2025-01-09 03:54:21,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:21,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:21,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:21,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:21,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:21,603 INFO L87 Difference]: Start difference. First operand 9409 states and 16152 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:54:21,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:21,979 INFO L93 Difference]: Finished difference Result 22051 states and 38172 transitions. [2025-01-09 03:54:21,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:21,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 116 [2025-01-09 03:54:21,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:22,034 INFO L225 Difference]: With dead ends: 22051 [2025-01-09 03:54:22,034 INFO L226 Difference]: Without dead ends: 14485 [2025-01-09 03:54:22,061 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:54:22,062 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 106 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 945 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:54:22,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 945 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:22,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14485 states. [2025-01-09 03:54:22,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14485 to 14453. [2025-01-09 03:54:22,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14453 states, 12038 states have (on average 1.6238577836849974) internal successors, (19548), 12046 states have internal predecessors, (19548), 2326 states have call successors, (2326), 78 states have call predecessors, (2326), 88 states have return successors, (3050), 2328 states have call predecessors, (3050), 2322 states have call successors, (3050) [2025-01-09 03:54:22,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14453 states to 14453 states and 24924 transitions. [2025-01-09 03:54:22,879 INFO L78 Accepts]: Start accepts. Automaton has 14453 states and 24924 transitions. Word has length 116 [2025-01-09 03:54:22,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:22,880 INFO L471 AbstractCegarLoop]: Abstraction has 14453 states and 24924 transitions. [2025-01-09 03:54:22,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:54:22,880 INFO L276 IsEmpty]: Start isEmpty. Operand 14453 states and 24924 transitions. [2025-01-09 03:54:22,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 03:54:22,914 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:22,914 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:22,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:54:22,915 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:22,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:22,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1849708539, now seen corresponding path program 1 times [2025-01-09 03:54:22,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:22,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841791462] [2025-01-09 03:54:22,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:22,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:22,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 03:54:22,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 03:54:22,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:22,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:22,968 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:22,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:22,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841791462] [2025-01-09 03:54:22,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841791462] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:22,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:22,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:22,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780548688] [2025-01-09 03:54:22,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:22,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:22,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:22,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:22,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:22,969 INFO L87 Difference]: Start difference. First operand 14453 states and 24924 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:54:23,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:23,547 INFO L93 Difference]: Finished difference Result 34155 states and 59408 transitions. [2025-01-09 03:54:23,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:23,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2025-01-09 03:54:23,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:23,644 INFO L225 Difference]: With dead ends: 34155 [2025-01-09 03:54:23,644 INFO L226 Difference]: Without dead ends: 22829 [2025-01-09 03:54:23,680 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:54:23,681 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 104 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 945 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:54:23,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 945 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:23,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22829 states. [2025-01-09 03:54:24,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22829 to 22797. [2025-01-09 03:54:24,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22797 states, 18878 states have (on average 1.618391778790126) internal successors, (30552), 18886 states have internal predecessors, (30552), 3830 states have call successors, (3830), 78 states have call predecessors, (3830), 88 states have return successors, (5042), 3832 states have call predecessors, (5042), 3826 states have call successors, (5042) [2025-01-09 03:54:24,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22797 states to 22797 states and 39424 transitions. [2025-01-09 03:54:24,564 INFO L78 Accepts]: Start accepts. Automaton has 22797 states and 39424 transitions. Word has length 117 [2025-01-09 03:54:24,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:24,565 INFO L471 AbstractCegarLoop]: Abstraction has 22797 states and 39424 transitions. [2025-01-09 03:54:24,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:54:24,565 INFO L276 IsEmpty]: Start isEmpty. Operand 22797 states and 39424 transitions. [2025-01-09 03:54:24,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 03:54:24,603 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:24,604 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:24,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:54:24,604 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:24,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:24,604 INFO L85 PathProgramCache]: Analyzing trace with hash -860020817, now seen corresponding path program 1 times [2025-01-09 03:54:24,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:24,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088240170] [2025-01-09 03:54:24,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:24,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:24,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 03:54:24,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 03:54:24,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:24,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:24,654 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:24,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:24,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088240170] [2025-01-09 03:54:24,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088240170] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:24,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:24,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:24,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788359149] [2025-01-09 03:54:24,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:24,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:24,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:24,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:24,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:24,656 INFO L87 Difference]: Start difference. First operand 22797 states and 39424 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:54:25,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:25,617 INFO L93 Difference]: Finished difference Result 56091 states and 97396 transitions. [2025-01-09 03:54:25,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:25,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 118 [2025-01-09 03:54:25,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:25,773 INFO L225 Difference]: With dead ends: 56091 [2025-01-09 03:54:25,773 INFO L226 Difference]: Without dead ends: 37965 [2025-01-09 03:54:25,826 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:54:25,827 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 102 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 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:54:25,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 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:54:25,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37965 states. [2025-01-09 03:54:27,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37965 to 37933. [2025-01-09 03:54:27,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37933 states, 31590 states have (on average 1.6160810383032604) internal successors, (51052), 31598 states have internal predecessors, (51052), 6254 states have call successors, (6254), 78 states have call predecessors, (6254), 88 states have return successors, (8066), 6256 states have call predecessors, (8066), 6250 states have call successors, (8066) [2025-01-09 03:54:27,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37933 states to 37933 states and 65372 transitions. [2025-01-09 03:54:27,395 INFO L78 Accepts]: Start accepts. Automaton has 37933 states and 65372 transitions. Word has length 118 [2025-01-09 03:54:27,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:27,396 INFO L471 AbstractCegarLoop]: Abstraction has 37933 states and 65372 transitions. [2025-01-09 03:54:27,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:54:27,396 INFO L276 IsEmpty]: Start isEmpty. Operand 37933 states and 65372 transitions. [2025-01-09 03:54:27,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 03:54:27,441 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:27,442 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:27,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:54:27,442 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:27,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:27,442 INFO L85 PathProgramCache]: Analyzing trace with hash -427129107, now seen corresponding path program 1 times [2025-01-09 03:54:27,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:27,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259329300] [2025-01-09 03:54:27,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:27,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:27,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 03:54:27,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 03:54:27,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:27,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:27,485 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:27,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:27,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259329300] [2025-01-09 03:54:27,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259329300] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:27,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:27,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:27,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861489840] [2025-01-09 03:54:27,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:27,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:27,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:27,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:27,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:27,488 INFO L87 Difference]: Start difference. First operand 37933 states and 65372 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:54:28,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:28,953 INFO L93 Difference]: Finished difference Result 97975 states and 169568 transitions. [2025-01-09 03:54:28,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:28,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2025-01-09 03:54:28,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:29,240 INFO L225 Difference]: With dead ends: 97975 [2025-01-09 03:54:29,240 INFO L226 Difference]: Without dead ends: 66553 [2025-01-09 03:54:29,324 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:54:29,327 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 100 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 960 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:54:29,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 960 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:29,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66553 states. [2025-01-09 03:54:31,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66553 to 66521. [2025-01-09 03:54:31,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66521 states, 55366 states have (on average 1.6069790123902756) internal successors, (88972), 55374 states have internal predecessors, (88972), 11066 states have call successors, (11066), 78 states have call predecessors, (11066), 88 states have return successors, (14290), 11068 states have call predecessors, (14290), 11062 states have call successors, (14290) [2025-01-09 03:54:32,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66521 states to 66521 states and 114328 transitions. [2025-01-09 03:54:32,198 INFO L78 Accepts]: Start accepts. Automaton has 66521 states and 114328 transitions. Word has length 119 [2025-01-09 03:54:32,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:32,199 INFO L471 AbstractCegarLoop]: Abstraction has 66521 states and 114328 transitions. [2025-01-09 03:54:32,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:54:32,199 INFO L276 IsEmpty]: Start isEmpty. Operand 66521 states and 114328 transitions. [2025-01-09 03:54:32,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 03:54:32,283 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:32,283 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:32,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 03:54:32,283 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:32,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:32,284 INFO L85 PathProgramCache]: Analyzing trace with hash -423923730, now seen corresponding path program 1 times [2025-01-09 03:54:32,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:32,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340911745] [2025-01-09 03:54:32,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:32,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:32,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 03:54:32,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 03:54:32,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:32,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:32,340 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:32,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:32,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340911745] [2025-01-09 03:54:32,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340911745] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:32,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:32,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:32,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268433171] [2025-01-09 03:54:32,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:32,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:32,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:32,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:32,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:32,342 INFO L87 Difference]: Start difference. First operand 66521 states and 114328 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:54:35,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:35,607 INFO L93 Difference]: Finished difference Result 176119 states and 304120 transitions. [2025-01-09 03:54:35,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:35,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 120 [2025-01-09 03:54:35,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:36,128 INFO L225 Difference]: With dead ends: 176119 [2025-01-09 03:54:36,128 INFO L226 Difference]: Without dead ends: 118701 [2025-01-09 03:54:36,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:36,273 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 98 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 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:54:36,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 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:54:36,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118701 states. [2025-01-09 03:54:40,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118701 to 118669. [2025-01-09 03:54:40,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118669 states, 99358 states have (on average 1.6024074558666639) internal successors, (159212), 99366 states have internal predecessors, (159212), 19222 states have call successors, (19222), 78 states have call predecessors, (19222), 88 states have return successors, (25154), 19224 states have call predecessors, (25154), 19218 states have call successors, (25154) [2025-01-09 03:54:40,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118669 states to 118669 states and 203588 transitions. [2025-01-09 03:54:41,043 INFO L78 Accepts]: Start accepts. Automaton has 118669 states and 203588 transitions. Word has length 120 [2025-01-09 03:54:41,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:41,043 INFO L471 AbstractCegarLoop]: Abstraction has 118669 states and 203588 transitions. [2025-01-09 03:54:41,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:54:41,044 INFO L276 IsEmpty]: Start isEmpty. Operand 118669 states and 203588 transitions. [2025-01-09 03:54:41,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 03:54:41,120 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:41,120 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:41,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 03:54:41,120 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:41,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:41,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1180349163, now seen corresponding path program 1 times [2025-01-09 03:54:41,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:41,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237074051] [2025-01-09 03:54:41,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:41,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:41,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 03:54:41,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 03:54:41,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:41,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:41,164 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:41,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:41,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237074051] [2025-01-09 03:54:41,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237074051] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:41,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:41,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:41,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41750524] [2025-01-09 03:54:41,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:41,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:41,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:41,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:41,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:41,166 INFO L87 Difference]: Start difference. First operand 118669 states and 203588 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:54:46,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:46,247 INFO L93 Difference]: Finished difference Result 323727 states and 555208 transitions. [2025-01-09 03:54:46,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:46,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2025-01-09 03:54:46,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:47,286 INFO L225 Difference]: With dead ends: 323727 [2025-01-09 03:54:47,287 INFO L226 Difference]: Without dead ends: 217261 [2025-01-09 03:54:47,541 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:54:47,542 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 96 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 952 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:54:47,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 952 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:47,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217261 states.